./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.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_9c4d323e-7c32-4287-b3cb-37c59212548b/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d323e-7c32-4287-b3cb-37c59212548b/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_9c4d323e-7c32-4287-b3cb-37c59212548b/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d323e-7c32-4287-b3cb-37c59212548b/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d323e-7c32-4287-b3cb-37c59212548b/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_9c4d323e-7c32-4287-b3cb-37c59212548b/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 a9d301fd24d7dbc3684a100e80ac453023513d8631f488025251adcc1a8646b5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:01:25,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:01:25,384 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d323e-7c32-4287-b3cb-37c59212548b/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 08:01:25,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:01:25,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:01:25,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:01:25,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:01:25,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:01:25,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:01:25,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:01:25,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:01:25,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:01:25,449 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:01:25,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:01:25,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:01:25,451 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:01:25,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:01:25,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:01:25,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:01:25,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:01:25,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:01:25,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:01:25,455 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:01:25,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:01:25,456 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:01:25,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:01:25,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:01:25,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:01:25,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:01:25,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:01:25,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:01:25,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:01:25,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:01:25,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:01:25,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:01:25,462 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:01:25,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:01:25,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:01:25,462 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:01:25,463 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_9c4d323e-7c32-4287-b3cb-37c59212548b/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_9c4d323e-7c32-4287-b3cb-37c59212548b/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 -> a9d301fd24d7dbc3684a100e80ac453023513d8631f488025251adcc1a8646b5 [2023-11-19 08:01:25,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:01:25,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:01:25,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:01:25,809 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:01:25,809 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:01:25,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d323e-7c32-4287-b3cb-37c59212548b/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2023-11-19 08:01:29,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:01:29,509 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:01:29,510 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d323e-7c32-4287-b3cb-37c59212548b/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2023-11-19 08:01:29,532 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d323e-7c32-4287-b3cb-37c59212548b/bin/uautomizer-verify-uCwYo4JHxu/data/561221da6/d3b19ba48d4646c7b4e630ea26cc52af/FLAG04c113fe2 [2023-11-19 08:01:29,549 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d323e-7c32-4287-b3cb-37c59212548b/bin/uautomizer-verify-uCwYo4JHxu/data/561221da6/d3b19ba48d4646c7b4e630ea26cc52af [2023-11-19 08:01:29,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:01:29,554 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:01:29,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:01:29,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:01:29,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:01:29,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:01:29" (1/1) ... [2023-11-19 08:01:29,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a97a43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:29, skipping insertion in model container [2023-11-19 08:01:29,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:01:29" (1/1) ... [2023-11-19 08:01:29,659 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:01:29,848 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_9c4d323e-7c32-4287-b3cb-37c59212548b/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i[995,1008] [2023-11-19 08:01:30,238 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:01:30,261 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:01:30,279 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_9c4d323e-7c32-4287-b3cb-37c59212548b/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i[995,1008] [2023-11-19 08:01:30,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:01:30,467 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:01:30,468 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:01:30,478 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:01:30,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:30 WrapperNode [2023-11-19 08:01:30,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:01:30,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:01:30,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:01:30,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:01:30,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:30" (1/1) ... [2023-11-19 08:01:30,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:30" (1/1) ... [2023-11-19 08:01:30,632 INFO L138 Inliner]: procedures = 177, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 152 [2023-11-19 08:01:30,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:01:30,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:01:30,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:01:30,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:01:30,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:30" (1/1) ... [2023-11-19 08:01:30,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:30" (1/1) ... [2023-11-19 08:01:30,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:30" (1/1) ... [2023-11-19 08:01:30,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:30" (1/1) ... [2023-11-19 08:01:30,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:30" (1/1) ... [2023-11-19 08:01:30,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:30" (1/1) ... [2023-11-19 08:01:30,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:30" (1/1) ... [2023-11-19 08:01:30,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:30" (1/1) ... [2023-11-19 08:01:30,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:01:30,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:01:30,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:01:30,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:01:30,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:30" (1/1) ... [2023-11-19 08:01:30,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:01:30,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d323e-7c32-4287-b3cb-37c59212548b/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:01:30,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d323e-7c32-4287-b3cb-37c59212548b/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:01:30,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d323e-7c32-4287-b3cb-37c59212548b/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:01:30,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 08:01:30,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:01:30,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 08:01:30,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:01:30,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:01:30,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:01:30,848 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 08:01:30,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 08:01:30,848 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 08:01:30,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 08:01:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 08:01:30,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 08:01:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 08:01:30,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 08:01:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:01:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 08:01:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:01:30,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:01:30,855 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 08:01:31,148 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:01:31,150 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:01:31,828 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:01:32,329 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:01:32,330 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:01:32,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:01:32 BoogieIcfgContainer [2023-11-19 08:01:32,340 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:01:32,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:01:32,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:01:32,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:01:32,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:01:29" (1/3) ... [2023-11-19 08:01:32,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51acd729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:01:32, skipping insertion in model container [2023-11-19 08:01:32,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:30" (2/3) ... [2023-11-19 08:01:32,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51acd729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:01:32, skipping insertion in model container [2023-11-19 08:01:32,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:01:32" (3/3) ... [2023-11-19 08:01:32,356 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.oepc.i [2023-11-19 08:01:32,366 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 08:01:32,379 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:01:32,379 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 08:01:32,379 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:01:32,491 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:01:32,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 314 flow [2023-11-19 08:01:32,685 INFO L124 PetriNetUnfolderBase]: 2/145 cut-off events. [2023-11-19 08:01:32,685 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:01:32,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-11-19 08:01:32,700 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 149 transitions, 314 flow [2023-11-19 08:01:32,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 128 transitions, 268 flow [2023-11-19 08:01:32,717 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:01:32,730 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 128 transitions, 268 flow [2023-11-19 08:01:32,734 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 128 transitions, 268 flow [2023-11-19 08:01:32,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 128 transitions, 268 flow [2023-11-19 08:01:32,817 INFO L124 PetriNetUnfolderBase]: 1/128 cut-off events. [2023-11-19 08:01:32,818 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:01:32,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 1/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-11-19 08:01:32,824 INFO L119 LiptonReduction]: Number of co-enabled transitions 2002 [2023-11-19 08:01:44,720 INFO L134 LiptonReduction]: Checked pairs total: 3962 [2023-11-19 08:01:44,721 INFO L136 LiptonReduction]: Total number of compositions: 108 [2023-11-19 08:01:44,738 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:01:44,746 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;@5d55e743, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:01:44,747 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-19 08:01:44,757 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:01:44,757 INFO L124 PetriNetUnfolderBase]: 1/23 cut-off events. [2023-11-19 08:01:44,757 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:01:44,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:01:44,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:01:44,759 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:01:44,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:44,765 INFO L85 PathProgramCache]: Analyzing trace with hash 676138884, now seen corresponding path program 1 times [2023-11-19 08:01:44,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:44,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703772977] [2023-11-19 08:01:44,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:44,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:45,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:01:45,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:45,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703772977] [2023-11-19 08:01:45,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703772977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:45,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:45,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:01:45,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659146834] [2023-11-19 08:01:45,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:45,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:01:45,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:45,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:01:45,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:01:45,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 257 [2023-11-19 08:01:45,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 60 flow. Second operand has 2 states, 2 states have (on average 141.5) internal successors, (283), 2 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:45,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:01:45,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 257 [2023-11-19 08:01:45,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:01:46,319 INFO L124 PetriNetUnfolderBase]: 2075/2894 cut-off events. [2023-11-19 08:01:46,319 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-19 08:01:46,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5890 conditions, 2894 events. 2075/2894 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 12218 event pairs, 2075 based on Foata normal form. 0/2893 useless extension candidates. Maximal degree in co-relation 5878. Up to 2893 conditions per place. [2023-11-19 08:01:46,352 INFO L140 encePairwiseOnDemand]: 256/257 looper letters, 22 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-11-19 08:01:46,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 23 transitions, 102 flow [2023-11-19 08:01:46,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:01:46,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:01:46,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 295 transitions. [2023-11-19 08:01:46,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5739299610894941 [2023-11-19 08:01:46,380 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 295 transitions. [2023-11-19 08:01:46,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 295 transitions. [2023-11-19 08:01:46,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:01:46,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 295 transitions. [2023-11-19 08:01:46,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:46,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:46,401 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:46,404 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 60 flow. Second operand 2 states and 295 transitions. [2023-11-19 08:01:46,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 23 transitions, 102 flow [2023-11-19 08:01:46,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 98 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 08:01:46,413 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 54 flow [2023-11-19 08:01:46,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-11-19 08:01:46,421 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2023-11-19 08:01:46,421 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 54 flow [2023-11-19 08:01:46,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 141.5) internal successors, (283), 2 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:46,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:01:46,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:01:46,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:01:46,423 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:01:46,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:46,435 INFO L85 PathProgramCache]: Analyzing trace with hash -514835400, now seen corresponding path program 1 times [2023-11-19 08:01:46,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:46,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093093188] [2023-11-19 08:01:46,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:46,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:01:47,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:47,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093093188] [2023-11-19 08:01:47,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093093188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:47,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:47,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:01:47,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164734793] [2023-11-19 08:01:47,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:47,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:01:47,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:47,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:01:47,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:01:47,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 257 [2023-11-19 08:01:47,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:47,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:01:47,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 257 [2023-11-19 08:01:47,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:01:48,057 INFO L124 PetriNetUnfolderBase]: 2153/3044 cut-off events. [2023-11-19 08:01:48,058 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:01:48,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6187 conditions, 3044 events. 2153/3044 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 14096 event pairs, 386 based on Foata normal form. 144/3187 useless extension candidates. Maximal degree in co-relation 6184. Up to 2206 conditions per place. [2023-11-19 08:01:48,082 INFO L140 encePairwiseOnDemand]: 253/257 looper letters, 31 selfloop transitions, 2 changer transitions 18/52 dead transitions. [2023-11-19 08:01:48,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 52 transitions, 216 flow [2023-11-19 08:01:48,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:01:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:01:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 713 transitions. [2023-11-19 08:01:48,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.554863813229572 [2023-11-19 08:01:48,089 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 713 transitions. [2023-11-19 08:01:48,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 713 transitions. [2023-11-19 08:01:48,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:01:48,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 713 transitions. [2023-11-19 08:01:48,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.6) internal successors, (713), 5 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:48,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:48,103 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:48,105 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 54 flow. Second operand 5 states and 713 transitions. [2023-11-19 08:01:48,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 52 transitions, 216 flow [2023-11-19 08:01:48,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 52 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:01:48,114 INFO L231 Difference]: Finished difference. Result has 40 places, 23 transitions, 66 flow [2023-11-19 08:01:48,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2023-11-19 08:01:48,115 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2023-11-19 08:01:48,115 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 66 flow [2023-11-19 08:01:48,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:48,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:01:48,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:01:48,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:01:48,117 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:01:48,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:48,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1219976902, now seen corresponding path program 1 times [2023-11-19 08:01:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:48,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278832242] [2023-11-19 08:01:48,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:48,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:01:48,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:48,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278832242] [2023-11-19 08:01:48,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278832242] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:48,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:48,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:01:48,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467444887] [2023-11-19 08:01:48,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:48,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:01:48,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:48,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:01:48,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:01:48,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 257 [2023-11-19 08:01:48,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 23 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:48,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:01:48,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 257 [2023-11-19 08:01:48,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:01:49,566 INFO L124 PetriNetUnfolderBase]: 2480/3515 cut-off events. [2023-11-19 08:01:49,567 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2023-11-19 08:01:49,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7746 conditions, 3515 events. 2480/3515 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 17230 event pairs, 403 based on Foata normal form. 108/3622 useless extension candidates. Maximal degree in co-relation 7739. Up to 1405 conditions per place. [2023-11-19 08:01:49,590 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 40 selfloop transitions, 3 changer transitions 23/67 dead transitions. [2023-11-19 08:01:49,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 67 transitions, 299 flow [2023-11-19 08:01:49,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:01:49,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:01:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 848 transitions. [2023-11-19 08:01:49,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5499351491569391 [2023-11-19 08:01:49,595 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 848 transitions. [2023-11-19 08:01:49,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 848 transitions. [2023-11-19 08:01:49,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:01:49,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 848 transitions. [2023-11-19 08:01:49,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:49,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:49,605 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:49,606 INFO L175 Difference]: Start difference. First operand has 40 places, 23 transitions, 66 flow. Second operand 6 states and 848 transitions. [2023-11-19 08:01:49,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 67 transitions, 299 flow [2023-11-19 08:01:49,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 67 transitions, 289 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-19 08:01:49,624 INFO L231 Difference]: Finished difference. Result has 43 places, 23 transitions, 76 flow [2023-11-19 08:01:49,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=23} [2023-11-19 08:01:49,626 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2023-11-19 08:01:49,630 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 23 transitions, 76 flow [2023-11-19 08:01:49,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:49,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:01:49,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:01:49,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:01:49,633 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:01:49,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:49,633 INFO L85 PathProgramCache]: Analyzing trace with hash -834731391, now seen corresponding path program 1 times [2023-11-19 08:01:49,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:49,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732725414] [2023-11-19 08:01:49,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:49,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:01:50,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:50,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732725414] [2023-11-19 08:01:50,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732725414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:50,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:50,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:01:50,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421880026] [2023-11-19 08:01:50,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:50,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:01:50,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:50,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:01:50,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:01:50,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 257 [2023-11-19 08:01:50,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 23 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:50,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:01:50,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 257 [2023-11-19 08:01:50,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:01:50,744 INFO L124 PetriNetUnfolderBase]: 1248/1977 cut-off events. [2023-11-19 08:01:50,744 INFO L125 PetriNetUnfolderBase]: For 837/837 co-relation queries the response was YES. [2023-11-19 08:01:50,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4546 conditions, 1977 events. 1248/1977 cut-off events. For 837/837 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9575 event pairs, 252 based on Foata normal form. 72/2049 useless extension candidates. Maximal degree in co-relation 4537. Up to 1271 conditions per place. [2023-11-19 08:01:50,764 INFO L140 encePairwiseOnDemand]: 253/257 looper letters, 36 selfloop transitions, 2 changer transitions 15/54 dead transitions. [2023-11-19 08:01:50,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 264 flow [2023-11-19 08:01:50,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:01:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:01:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 725 transitions. [2023-11-19 08:01:50,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5642023346303502 [2023-11-19 08:01:50,769 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 725 transitions. [2023-11-19 08:01:50,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 725 transitions. [2023-11-19 08:01:50,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:01:50,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 725 transitions. [2023-11-19 08:01:50,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:50,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:50,780 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:50,781 INFO L175 Difference]: Start difference. First operand has 43 places, 23 transitions, 76 flow. Second operand 5 states and 725 transitions. [2023-11-19 08:01:50,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 264 flow [2023-11-19 08:01:50,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 239 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-11-19 08:01:50,790 INFO L231 Difference]: Finished difference. Result has 42 places, 23 transitions, 72 flow [2023-11-19 08:01:50,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=23} [2023-11-19 08:01:50,792 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-11-19 08:01:50,793 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 23 transitions, 72 flow [2023-11-19 08:01:50,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:50,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:01:50,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:01:50,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:01:50,795 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:01:50,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:50,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1193402553, now seen corresponding path program 1 times [2023-11-19 08:01:50,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:50,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589351551] [2023-11-19 08:01:50,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:50,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:01:52,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:52,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589351551] [2023-11-19 08:01:52,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589351551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:52,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:52,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:01:52,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299515414] [2023-11-19 08:01:52,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:52,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 08:01:52,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:52,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 08:01:52,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:01:53,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 257 [2023-11-19 08:01:53,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 23 transitions, 72 flow. Second operand has 8 states, 8 states have (on average 124.875) internal successors, (999), 8 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:53,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:01:53,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 257 [2023-11-19 08:01:53,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:01:54,136 INFO L124 PetriNetUnfolderBase]: 1396/2100 cut-off events. [2023-11-19 08:01:54,136 INFO L125 PetriNetUnfolderBase]: For 546/546 co-relation queries the response was YES. [2023-11-19 08:01:54,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4938 conditions, 2100 events. 1396/2100 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9683 event pairs, 229 based on Foata normal form. 48/2148 useless extension candidates. Maximal degree in co-relation 4930. Up to 1183 conditions per place. [2023-11-19 08:01:54,159 INFO L140 encePairwiseOnDemand]: 249/257 looper letters, 41 selfloop transitions, 7 changer transitions 12/61 dead transitions. [2023-11-19 08:01:54,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 61 transitions, 295 flow [2023-11-19 08:01:54,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:01:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:01:54,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 800 transitions. [2023-11-19 08:01:54,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188067444876784 [2023-11-19 08:01:54,165 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 800 transitions. [2023-11-19 08:01:54,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 800 transitions. [2023-11-19 08:01:54,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:01:54,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 800 transitions. [2023-11-19 08:01:54,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:54,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:54,176 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:54,177 INFO L175 Difference]: Start difference. First operand has 42 places, 23 transitions, 72 flow. Second operand 6 states and 800 transitions. [2023-11-19 08:01:54,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 61 transitions, 295 flow [2023-11-19 08:01:54,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 61 transitions, 281 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-19 08:01:54,182 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 114 flow [2023-11-19 08:01:54,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2023-11-19 08:01:54,184 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2023-11-19 08:01:54,184 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 114 flow [2023-11-19 08:01:54,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 124.875) internal successors, (999), 8 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:54,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:01:54,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:01:54,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:01:54,186 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:01:54,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:54,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1429726327, now seen corresponding path program 2 times [2023-11-19 08:01:54,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:54,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900979219] [2023-11-19 08:01:54,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:54,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:01:55,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:55,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900979219] [2023-11-19 08:01:55,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900979219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:55,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:55,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:01:55,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036917052] [2023-11-19 08:01:55,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:55,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 08:01:55,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:55,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 08:01:55,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:01:55,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 257 [2023-11-19 08:01:55,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 114 flow. Second operand has 8 states, 8 states have (on average 124.875) internal successors, (999), 8 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:55,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:01:55,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 257 [2023-11-19 08:01:55,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:01:56,581 INFO L124 PetriNetUnfolderBase]: 1332/2012 cut-off events. [2023-11-19 08:01:56,582 INFO L125 PetriNetUnfolderBase]: For 829/829 co-relation queries the response was YES. [2023-11-19 08:01:56,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5200 conditions, 2012 events. 1332/2012 cut-off events. For 829/829 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9321 event pairs, 151 based on Foata normal form. 48/2060 useless extension candidates. Maximal degree in co-relation 5190. Up to 1159 conditions per place. [2023-11-19 08:01:56,599 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 43 selfloop transitions, 5 changer transitions 12/61 dead transitions. [2023-11-19 08:01:56,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 328 flow [2023-11-19 08:01:56,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:01:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:01:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 797 transitions. [2023-11-19 08:01:56,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5168612191958496 [2023-11-19 08:01:56,603 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 797 transitions. [2023-11-19 08:01:56,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 797 transitions. [2023-11-19 08:01:56,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:01:56,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 797 transitions. [2023-11-19 08:01:56,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:56,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:56,611 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:56,612 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 114 flow. Second operand 6 states and 797 transitions. [2023-11-19 08:01:56,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 328 flow [2023-11-19 08:01:56,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 319 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-19 08:01:56,616 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 130 flow [2023-11-19 08:01:56,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=130, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2023-11-19 08:01:56,617 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2023-11-19 08:01:56,617 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 130 flow [2023-11-19 08:01:56,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 124.875) internal successors, (999), 8 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:56,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:01:56,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:01:56,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:01:56,619 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:01:56,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:56,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1391184727, now seen corresponding path program 1 times [2023-11-19 08:01:56,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:56,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78189848] [2023-11-19 08:01:56,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:56,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:01:56,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:56,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78189848] [2023-11-19 08:01:56,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78189848] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:56,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:56,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:01:56,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506368632] [2023-11-19 08:01:56,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:56,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:01:56,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:56,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:01:56,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:01:56,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 257 [2023-11-19 08:01:56,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 29 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:56,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:01:56,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 257 [2023-11-19 08:01:56,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:01:57,228 INFO L124 PetriNetUnfolderBase]: 1010/1531 cut-off events. [2023-11-19 08:01:57,229 INFO L125 PetriNetUnfolderBase]: For 1252/1252 co-relation queries the response was YES. [2023-11-19 08:01:57,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4244 conditions, 1531 events. 1010/1531 cut-off events. For 1252/1252 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6526 event pairs, 234 based on Foata normal form. 28/1558 useless extension candidates. Maximal degree in co-relation 4233. Up to 1392 conditions per place. [2023-11-19 08:01:57,242 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 44 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2023-11-19 08:01:57,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 320 flow [2023-11-19 08:01:57,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:01:57,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:01:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-11-19 08:01:57,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5603112840466926 [2023-11-19 08:01:57,249 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-11-19 08:01:57,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-11-19 08:01:57,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:01:57,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-11-19 08:01:57,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:57,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:57,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:57,258 INFO L175 Difference]: Start difference. First operand has 48 places, 29 transitions, 130 flow. Second operand 3 states and 432 transitions. [2023-11-19 08:01:57,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 320 flow [2023-11-19 08:01:57,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 309 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-19 08:01:57,263 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 155 flow [2023-11-19 08:01:57,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-11-19 08:01:57,264 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2023-11-19 08:01:57,265 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 155 flow [2023-11-19 08:01:57,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:57,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:01:57,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:01:57,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:01:57,266 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:01:57,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:57,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1403458832, now seen corresponding path program 1 times [2023-11-19 08:01:57,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:57,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450757280] [2023-11-19 08:01:57,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:57,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:01:57,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:57,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450757280] [2023-11-19 08:01:57,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450757280] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:57,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:57,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:01:57,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807202393] [2023-11-19 08:01:57,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:57,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:01:57,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:57,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:01:57,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:01:57,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 257 [2023-11-19 08:01:57,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:57,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:01:57,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 257 [2023-11-19 08:01:57,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:01:57,908 INFO L124 PetriNetUnfolderBase]: 638/1031 cut-off events. [2023-11-19 08:01:57,908 INFO L125 PetriNetUnfolderBase]: For 1042/1042 co-relation queries the response was YES. [2023-11-19 08:01:57,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 1031 events. 638/1031 cut-off events. For 1042/1042 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4350 event pairs, 87 based on Foata normal form. 52/1082 useless extension candidates. Maximal degree in co-relation 3365. Up to 608 conditions per place. [2023-11-19 08:01:57,928 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 59 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2023-11-19 08:01:57,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 459 flow [2023-11-19 08:01:57,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:01:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:01:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2023-11-19 08:01:57,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.561284046692607 [2023-11-19 08:01:57,935 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 577 transitions. [2023-11-19 08:01:57,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 577 transitions. [2023-11-19 08:01:57,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:01:57,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 577 transitions. [2023-11-19 08:01:57,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.25) internal successors, (577), 4 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:57,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:57,943 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:57,944 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 155 flow. Second operand 4 states and 577 transitions. [2023-11-19 08:01:57,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 459 flow [2023-11-19 08:01:57,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:01:57,948 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 202 flow [2023-11-19 08:01:57,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-11-19 08:01:57,949 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2023-11-19 08:01:57,949 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 202 flow [2023-11-19 08:01:57,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:57,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:01:57,950 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 08:01:57,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 08:01:57,951 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:01:57,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:57,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1748884423, now seen corresponding path program 1 times [2023-11-19 08:01:57,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:57,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435431760] [2023-11-19 08:01:57,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:57,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:01:58,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:58,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435431760] [2023-11-19 08:01:58,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435431760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:58,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:58,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:01:58,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880395219] [2023-11-19 08:01:58,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:58,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 08:01:58,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:58,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 08:01:58,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:01:58,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 257 [2023-11-19 08:01:58,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 202 flow. Second operand has 8 states, 8 states have (on average 126.375) internal successors, (1011), 8 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:58,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:01:58,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 257 [2023-11-19 08:01:58,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:01:59,783 INFO L124 PetriNetUnfolderBase]: 1556/2477 cut-off events. [2023-11-19 08:01:59,783 INFO L125 PetriNetUnfolderBase]: For 3830/3830 co-relation queries the response was YES. [2023-11-19 08:01:59,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8700 conditions, 2477 events. 1556/2477 cut-off events. For 3830/3830 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 12108 event pairs, 208 based on Foata normal form. 30/2507 useless extension candidates. Maximal degree in co-relation 8689. Up to 1187 conditions per place. [2023-11-19 08:01:59,801 INFO L140 encePairwiseOnDemand]: 248/257 looper letters, 73 selfloop transitions, 11 changer transitions 64/148 dead transitions. [2023-11-19 08:01:59,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 148 transitions, 1087 flow [2023-11-19 08:01:59,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 08:01:59,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-19 08:01:59,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1465 transitions. [2023-11-19 08:01:59,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5182171913689423 [2023-11-19 08:01:59,808 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1465 transitions. [2023-11-19 08:01:59,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1465 transitions. [2023-11-19 08:01:59,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:01:59,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1465 transitions. [2023-11-19 08:01:59,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 133.1818181818182) internal successors, (1465), 11 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:59,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 257.0) internal successors, (3084), 12 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:59,823 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 257.0) internal successors, (3084), 12 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:59,823 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 202 flow. Second operand 11 states and 1465 transitions. [2023-11-19 08:01:59,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 148 transitions, 1087 flow [2023-11-19 08:01:59,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 148 transitions, 1009 flow, removed 19 selfloop flow, removed 2 redundant places. [2023-11-19 08:01:59,830 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 303 flow [2023-11-19 08:01:59,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=303, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2023-11-19 08:01:59,831 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 29 predicate places. [2023-11-19 08:01:59,831 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 303 flow [2023-11-19 08:01:59,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 126.375) internal successors, (1011), 8 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:01:59,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:01:59,833 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 08:01:59,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 08:01:59,833 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:01:59,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:59,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1170490841, now seen corresponding path program 2 times [2023-11-19 08:01:59,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:59,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72580391] [2023-11-19 08:01:59,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:59,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:00,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:00,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72580391] [2023-11-19 08:02:00,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72580391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:00,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:00,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:02:00,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231545102] [2023-11-19 08:02:00,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:00,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:02:00,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:00,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:02:00,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:02:00,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 257 [2023-11-19 08:02:00,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 303 flow. Second operand has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:00,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:00,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 257 [2023-11-19 08:02:00,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:00,518 INFO L124 PetriNetUnfolderBase]: 828/1380 cut-off events. [2023-11-19 08:02:00,518 INFO L125 PetriNetUnfolderBase]: For 4571/4633 co-relation queries the response was YES. [2023-11-19 08:02:00,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5773 conditions, 1380 events. 828/1380 cut-off events. For 4571/4633 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6722 event pairs, 67 based on Foata normal form. 127/1491 useless extension candidates. Maximal degree in co-relation 5754. Up to 504 conditions per place. [2023-11-19 08:02:00,532 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 83 selfloop transitions, 13 changer transitions 4/103 dead transitions. [2023-11-19 08:02:00,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 103 transitions, 908 flow [2023-11-19 08:02:00,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:02:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:02:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 719 transitions. [2023-11-19 08:02:00,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5595330739299611 [2023-11-19 08:02:00,537 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 719 transitions. [2023-11-19 08:02:00,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 719 transitions. [2023-11-19 08:02:00,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:00,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 719 transitions. [2023-11-19 08:02:00,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:00,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:00,544 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:00,544 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 303 flow. Second operand 5 states and 719 transitions. [2023-11-19 08:02:00,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 103 transitions, 908 flow [2023-11-19 08:02:00,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 863 flow, removed 22 selfloop flow, removed 4 redundant places. [2023-11-19 08:02:00,554 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 348 flow [2023-11-19 08:02:00,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=348, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2023-11-19 08:02:00,557 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2023-11-19 08:02:00,557 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 348 flow [2023-11-19 08:02:00,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:00,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:00,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:00,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 08:02:00,558 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:02:00,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:00,559 INFO L85 PathProgramCache]: Analyzing trace with hash -2062093960, now seen corresponding path program 1 times [2023-11-19 08:02:00,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:00,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306099958] [2023-11-19 08:02:00,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:00,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:01,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:01,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306099958] [2023-11-19 08:02:01,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306099958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:01,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:01,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:02:01,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873901114] [2023-11-19 08:02:01,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:01,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:02:01,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:01,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:02:01,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:02:01,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 257 [2023-11-19 08:02:01,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 348 flow. Second operand has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:01,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:01,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 257 [2023-11-19 08:02:01,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:01,706 INFO L124 PetriNetUnfolderBase]: 927/1597 cut-off events. [2023-11-19 08:02:01,706 INFO L125 PetriNetUnfolderBase]: For 5331/5372 co-relation queries the response was YES. [2023-11-19 08:02:01,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7195 conditions, 1597 events. 927/1597 cut-off events. For 5331/5372 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8204 event pairs, 348 based on Foata normal form. 29/1612 useless extension candidates. Maximal degree in co-relation 7178. Up to 1172 conditions per place. [2023-11-19 08:02:01,717 INFO L140 encePairwiseOnDemand]: 249/257 looper letters, 51 selfloop transitions, 12 changer transitions 41/107 dead transitions. [2023-11-19 08:02:01,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 107 transitions, 999 flow [2023-11-19 08:02:01,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:02:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:02:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 945 transitions. [2023-11-19 08:02:01,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5252918287937743 [2023-11-19 08:02:01,722 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 945 transitions. [2023-11-19 08:02:01,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 945 transitions. [2023-11-19 08:02:01,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:01,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 945 transitions. [2023-11-19 08:02:01,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.0) internal successors, (945), 7 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:01,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:01,730 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:01,730 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 348 flow. Second operand 7 states and 945 transitions. [2023-11-19 08:02:01,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 107 transitions, 999 flow [2023-11-19 08:02:01,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 107 transitions, 885 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-11-19 08:02:01,746 INFO L231 Difference]: Finished difference. Result has 69 places, 52 transitions, 386 flow [2023-11-19 08:02:01,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=386, PETRI_PLACES=69, PETRI_TRANSITIONS=52} [2023-11-19 08:02:01,747 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2023-11-19 08:02:01,747 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 386 flow [2023-11-19 08:02:01,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:01,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:01,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:01,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 08:02:01,748 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:02:01,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:01,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1064093920, now seen corresponding path program 2 times [2023-11-19 08:02:01,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:01,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654415199] [2023-11-19 08:02:01,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:01,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:01,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:01,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654415199] [2023-11-19 08:02:01,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654415199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:01,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:01,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:02:01,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955768048] [2023-11-19 08:02:01,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:01,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:02:01,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:01,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:02:01,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:02:02,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 257 [2023-11-19 08:02:02,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 52 transitions, 386 flow. Second operand has 6 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:02,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:02,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 257 [2023-11-19 08:02:02,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:02,454 INFO L124 PetriNetUnfolderBase]: 739/1229 cut-off events. [2023-11-19 08:02:02,454 INFO L125 PetriNetUnfolderBase]: For 4772/4842 co-relation queries the response was YES. [2023-11-19 08:02:02,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5424 conditions, 1229 events. 739/1229 cut-off events. For 4772/4842 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6134 event pairs, 57 based on Foata normal form. 78/1292 useless extension candidates. Maximal degree in co-relation 5403. Up to 495 conditions per place. [2023-11-19 08:02:02,462 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 70 selfloop transitions, 17 changer transitions 13/101 dead transitions. [2023-11-19 08:02:02,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 101 transitions, 999 flow [2023-11-19 08:02:02,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:02:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:02:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 850 transitions. [2023-11-19 08:02:02,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5512321660181583 [2023-11-19 08:02:02,468 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 850 transitions. [2023-11-19 08:02:02,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 850 transitions. [2023-11-19 08:02:02,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:02,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 850 transitions. [2023-11-19 08:02:02,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.66666666666666) internal successors, (850), 6 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:02,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:02,477 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:02,477 INFO L175 Difference]: Start difference. First operand has 69 places, 52 transitions, 386 flow. Second operand 6 states and 850 transitions. [2023-11-19 08:02:02,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 101 transitions, 999 flow [2023-11-19 08:02:02,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 101 transitions, 866 flow, removed 35 selfloop flow, removed 8 redundant places. [2023-11-19 08:02:02,500 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 328 flow [2023-11-19 08:02:02,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2023-11-19 08:02:02,502 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 28 predicate places. [2023-11-19 08:02:02,503 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 328 flow [2023-11-19 08:02:02,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:02,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:02,504 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] [2023-11-19 08:02:02,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 08:02:02,504 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:02:02,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:02,505 INFO L85 PathProgramCache]: Analyzing trace with hash 336576150, now seen corresponding path program 1 times [2023-11-19 08:02:02,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:02,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718821766] [2023-11-19 08:02:02,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:02,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:03,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:03,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718821766] [2023-11-19 08:02:03,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718821766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:03,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:03,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:02:03,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69413940] [2023-11-19 08:02:03,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:03,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 08:02:03,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:03,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 08:02:03,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:02:03,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 257 [2023-11-19 08:02:03,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 328 flow. Second operand has 7 states, 7 states have (on average 130.14285714285714) internal successors, (911), 7 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:03,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:03,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 257 [2023-11-19 08:02:03,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:04,262 INFO L124 PetriNetUnfolderBase]: 632/1098 cut-off events. [2023-11-19 08:02:04,263 INFO L125 PetriNetUnfolderBase]: For 3782/3783 co-relation queries the response was YES. [2023-11-19 08:02:04,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4904 conditions, 1098 events. 632/1098 cut-off events. For 3782/3783 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5106 event pairs, 284 based on Foata normal form. 1/1085 useless extension candidates. Maximal degree in co-relation 4888. Up to 731 conditions per place. [2023-11-19 08:02:04,270 INFO L140 encePairwiseOnDemand]: 250/257 looper letters, 54 selfloop transitions, 7 changer transitions 34/96 dead transitions. [2023-11-19 08:02:04,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 96 transitions, 910 flow [2023-11-19 08:02:04,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:02:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:02:04,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 934 transitions. [2023-11-19 08:02:04,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.519177320733741 [2023-11-19 08:02:04,274 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 934 transitions. [2023-11-19 08:02:04,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 934 transitions. [2023-11-19 08:02:04,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:04,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 934 transitions. [2023-11-19 08:02:04,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.42857142857142) internal successors, (934), 7 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:04,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:04,283 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:04,284 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 328 flow. Second operand 7 states and 934 transitions. [2023-11-19 08:02:04,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 96 transitions, 910 flow [2023-11-19 08:02:04,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 96 transitions, 727 flow, removed 47 selfloop flow, removed 7 redundant places. [2023-11-19 08:02:04,300 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 276 flow [2023-11-19 08:02:04,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2023-11-19 08:02:04,301 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 29 predicate places. [2023-11-19 08:02:04,301 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 276 flow [2023-11-19 08:02:04,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 130.14285714285714) internal successors, (911), 7 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:04,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:04,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:04,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 08:02:04,302 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:02:04,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:04,303 INFO L85 PathProgramCache]: Analyzing trace with hash 981917942, now seen corresponding path program 2 times [2023-11-19 08:02:04,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:04,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567118353] [2023-11-19 08:02:04,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:04,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:02:04,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:02:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:02:04,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:02:04,511 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:02:04,513 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-19 08:02:04,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-11-19 08:02:04,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-19 08:02:04,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-19 08:02:04,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-11-19 08:02:04,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 08:02:04,516 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:04,522 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 08:02:04,523 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 08:02:04,597 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated [2023-11-19 08:02:04,606 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated [2023-11-19 08:02:04,608 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre34 could not be translated [2023-11-19 08:02:04,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:02:04 BasicIcfg [2023-11-19 08:02:04,640 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 08:02:04,640 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 08:02:04,641 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 08:02:04,641 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 08:02:04,641 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:01:32" (3/4) ... [2023-11-19 08:02:04,642 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 08:02:04,690 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated [2023-11-19 08:02:04,692 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated [2023-11-19 08:02:04,693 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre34 could not be translated [2023-11-19 08:02:04,797 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d323e-7c32-4287-b3cb-37c59212548b/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 08:02:04,797 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 08:02:04,797 INFO L158 Benchmark]: Toolchain (without parser) took 35243.85ms. Allocated memory was 151.0MB in the beginning and 679.5MB in the end (delta: 528.5MB). Free memory was 106.6MB in the beginning and 401.2MB in the end (delta: -294.5MB). Peak memory consumption was 234.2MB. Max. memory is 16.1GB. [2023-11-19 08:02:04,798 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 109.1MB. Free memory is still 57.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:02:04,798 INFO L158 Benchmark]: CACSL2BoogieTranslator took 924.34ms. Allocated memory is still 151.0MB. Free memory was 106.4MB in the beginning and 81.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-19 08:02:04,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 152.79ms. Allocated memory is still 151.0MB. Free memory was 81.2MB in the beginning and 123.0MB in the end (delta: -41.8MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2023-11-19 08:02:04,799 INFO L158 Benchmark]: Boogie Preprocessor took 97.32ms. Allocated memory is still 151.0MB. Free memory was 123.0MB in the beginning and 120.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:02:04,799 INFO L158 Benchmark]: RCFGBuilder took 1607.77ms. Allocated memory is still 151.0MB. Free memory was 120.2MB in the beginning and 90.8MB in the end (delta: 29.4MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2023-11-19 08:02:04,801 INFO L158 Benchmark]: TraceAbstraction took 32296.51ms. Allocated memory was 151.0MB in the beginning and 679.5MB in the end (delta: 528.5MB). Free memory was 90.0MB in the beginning and 422.1MB in the end (delta: -332.1MB). Peak memory consumption was 195.8MB. Max. memory is 16.1GB. [2023-11-19 08:02:04,802 INFO L158 Benchmark]: Witness Printer took 156.45ms. Allocated memory is still 679.5MB. Free memory was 422.1MB in the beginning and 401.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-19 08:02:04,804 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.32ms. Allocated memory is still 109.1MB. Free memory is still 57.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 924.34ms. Allocated memory is still 151.0MB. Free memory was 106.4MB in the beginning and 81.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 152.79ms. Allocated memory is still 151.0MB. Free memory was 81.2MB in the beginning and 123.0MB in the end (delta: -41.8MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.32ms. Allocated memory is still 151.0MB. Free memory was 123.0MB in the beginning and 120.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1607.77ms. Allocated memory is still 151.0MB. Free memory was 120.2MB in the beginning and 90.8MB in the end (delta: 29.4MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. * TraceAbstraction took 32296.51ms. Allocated memory was 151.0MB in the beginning and 679.5MB in the end (delta: 528.5MB). Free memory was 90.0MB in the beginning and 422.1MB in the end (delta: -332.1MB). Peak memory consumption was 195.8MB. Max. memory is 16.1GB. * Witness Printer took 156.45ms. Allocated memory is still 679.5MB. Free memory was 422.1MB in the beginning and 401.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre34 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre34 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: 12.0s, 140 PlacesBefore, 36 PlacesAfterwards, 128 TransitionsBefore, 24 TransitionsAfterwards, 2002 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 108 TotalNumberOfCompositions, 3962 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2216, independent: 2053, independent conditional: 0, independent unconditional: 2053, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1052, independent: 1010, independent conditional: 0, independent unconditional: 1010, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2216, independent: 1043, independent conditional: 0, independent unconditional: 1043, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 1052, unknown conditional: 0, unknown unconditional: 1052] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L744] 0 _Bool y$flush_delayed; [L745] 0 int y$mem_tmp; [L746] 0 _Bool y$r_buff0_thd0; [L747] 0 _Bool y$r_buff0_thd1; [L748] 0 _Bool y$r_buff0_thd2; [L749] 0 _Bool y$r_buff0_thd3; [L750] 0 _Bool y$r_buff0_thd4; [L751] 0 _Bool y$r_buff1_thd0; [L752] 0 _Bool y$r_buff1_thd1; [L753] 0 _Bool y$r_buff1_thd2; [L754] 0 _Bool y$r_buff1_thd3; [L755] 0 _Bool y$r_buff1_thd4; [L756] 0 _Bool y$read_delayed; [L757] 0 int *y$read_delayed_var; [L758] 0 int y$w_buff0; [L759] 0 _Bool y$w_buff0_used; [L760] 0 int y$w_buff1; [L761] 0 _Bool y$w_buff1_used; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L864] 0 pthread_t t2417; [L865] FCALL, FORK 0 pthread_create(&t2417, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2417={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L866] 0 pthread_t t2418; [L867] FCALL, FORK 0 pthread_create(&t2418, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2417={7:0}, t2418={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L868] 0 pthread_t t2419; [L869] FCALL, FORK 0 pthread_create(&t2419, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2417={7:0}, t2418={8:0}, t2419={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] 0 pthread_t t2420; [L768] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 1 y$flush_delayed = weak$$choice2 [L771] EXPR 1 \read(y) [L771] 1 y$mem_tmp = y [L772] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] EXPR 1 \read(y) [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L774] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L775] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L776] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L777] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L779] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L780] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L781] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L782] EXPR 1 \read(y) [L782] 1 __unbuffered_p0_EAX = y [L783] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L783] 1 y = y$flush_delayed ? y$mem_tmp : y [L784] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L787] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L799] 2 x = 1 [L792] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 1 return 0; [L811] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L871] FCALL, FORK 0 pthread_create(&t2420, ((void *)0), P3, ((void *)0)) [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L814] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 3 y$flush_delayed = weak$$choice2 [L817] EXPR 3 \read(y) [L817] 3 y$mem_tmp = y [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] EXPR 3 \read(y) [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L819] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L820] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L821] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L822] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L824] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 \read(y) [L825] 3 __unbuffered_p2_EBX = y [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] EXPR 3 \read(y) [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] 3 y = y$flush_delayed ? y$mem_tmp : y [L827] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 3 return 0; [L839] 4 y = 1 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 \read(y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L843] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L844] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L845] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L846] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 \read(y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L878] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L879] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L880] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L881] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, main$tmp_guard1=0, t2417={7:0}, t2418={8:0}, t2419={9:0}, t2420={5:0}, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L884] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, 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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 182 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 32.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 913 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 716 mSDsluCounter, 598 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 497 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2279 IncrementalHoareTripleChecker+Invalid, 2437 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 101 mSDtfsCounter, 2279 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred in iteration=11, InterpolantAutomatonStates: 73, 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.9s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 1839 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-19 08:02:04,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d323e-7c32-4287-b3cb-37c59212548b/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE