./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62300706-bafb-45cb-b323-a9bf440e19b4/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62300706-bafb-45cb-b323-a9bf440e19b4/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_62300706-bafb-45cb-b323-a9bf440e19b4/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62300706-bafb-45cb-b323-a9bf440e19b4/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62300706-bafb-45cb-b323-a9bf440e19b4/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_62300706-bafb-45cb-b323-a9bf440e19b4/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 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:02:48,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:02:48,233 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62300706-bafb-45cb-b323-a9bf440e19b4/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 08:02:48,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:02:48,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:02:48,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:02:48,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:02:48,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:02:48,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:02:48,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:02:48,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:02:48,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:02:48,275 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:02:48,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:02:48,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:02:48,277 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:02:48,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:02:48,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:02:48,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:02:48,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:02:48,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:02:48,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:02:48,282 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:02:48,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:02:48,283 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:02:48,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:02:48,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:02:48,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:02:48,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:02:48,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:02:48,288 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:02:48,288 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:02:48,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:02:48,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:02:48,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:02:48,290 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:02:48,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:02:48,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:02:48,292 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:02:48,293 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_62300706-bafb-45cb-b323-a9bf440e19b4/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_62300706-bafb-45cb-b323-a9bf440e19b4/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 -> 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a [2023-11-19 08:02:48,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:02:48,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:02:48,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:02:48,660 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:02:48,661 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:02:48,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62300706-bafb-45cb-b323-a9bf440e19b4/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix038.opt.i [2023-11-19 08:02:52,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:02:52,486 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:02:52,487 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62300706-bafb-45cb-b323-a9bf440e19b4/sv-benchmarks/c/pthread-wmm/mix038.opt.i [2023-11-19 08:02:52,518 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62300706-bafb-45cb-b323-a9bf440e19b4/bin/uautomizer-verify-uCwYo4JHxu/data/a263158ef/badd2691e4e248e985b5088d55082138/FLAG069a6205c [2023-11-19 08:02:52,536 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62300706-bafb-45cb-b323-a9bf440e19b4/bin/uautomizer-verify-uCwYo4JHxu/data/a263158ef/badd2691e4e248e985b5088d55082138 [2023-11-19 08:02:52,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:02:52,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:02:52,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:02:52,549 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:02:52,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:02:52,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:02:52" (1/1) ... [2023-11-19 08:02:52,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22bc05e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:52, skipping insertion in model container [2023-11-19 08:02:52,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:02:52" (1/1) ... [2023-11-19 08:02:52,644 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:02:52,888 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_62300706-bafb-45cb-b323-a9bf440e19b4/sv-benchmarks/c/pthread-wmm/mix038.opt.i[944,957] [2023-11-19 08:02:53,262 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:02:53,279 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:02:53,301 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_62300706-bafb-45cb-b323-a9bf440e19b4/sv-benchmarks/c/pthread-wmm/mix038.opt.i[944,957] [2023-11-19 08:02:53,380 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:02:53,439 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:02:53,439 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:02:53,449 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:02:53,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:53 WrapperNode [2023-11-19 08:02:53,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:02:53,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:02:53,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:02:53,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:02:53,463 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:02:53" (1/1) ... [2023-11-19 08:02:53,500 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:02:53" (1/1) ... [2023-11-19 08:02:53,568 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2023-11-19 08:02:53,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:02:53,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:02:53,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:02:53,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:02:53,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:53" (1/1) ... [2023-11-19 08:02:53,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:53" (1/1) ... [2023-11-19 08:02:53,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:53" (1/1) ... [2023-11-19 08:02:53,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:53" (1/1) ... [2023-11-19 08:02:53,628 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:53" (1/1) ... [2023-11-19 08:02:53,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:53" (1/1) ... [2023-11-19 08:02:53,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:53" (1/1) ... [2023-11-19 08:02:53,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:53" (1/1) ... [2023-11-19 08:02:53,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:02:53,669 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:02:53,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:02:53,670 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:02:53,671 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:53" (1/1) ... [2023-11-19 08:02:53,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:02:53,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62300706-bafb-45cb-b323-a9bf440e19b4/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:02:53,722 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62300706-bafb-45cb-b323-a9bf440e19b4/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:02:53,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62300706-bafb-45cb-b323-a9bf440e19b4/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:02:53,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:02:53,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 08:02:53,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:02:53,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:02:53,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:02:53,782 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 08:02:53,782 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 08:02:53,782 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 08:02:53,783 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 08:02:53,783 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 08:02:53,785 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 08:02:53,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:02:53,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 08:02:53,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:02:53,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:02:53,789 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:02:53,987 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:02:53,990 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:02:54,538 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:02:54,727 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:02:54,727 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:02:54,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:02:54 BoogieIcfgContainer [2023-11-19 08:02:54,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:02:54,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:02:54,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:02:54,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:02:54,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:02:52" (1/3) ... [2023-11-19 08:02:54,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84c901b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:02:54, skipping insertion in model container [2023-11-19 08:02:54,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:53" (2/3) ... [2023-11-19 08:02:54,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84c901b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:02:54, skipping insertion in model container [2023-11-19 08:02:54,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:02:54" (3/3) ... [2023-11-19 08:02:54,749 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038.opt.i [2023-11-19 08:02:54,760 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 08:02:54,771 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:02:54,772 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 08:02:54,772 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:02:54,853 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:02:54,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 242 flow [2023-11-19 08:02:55,012 INFO L124 PetriNetUnfolderBase]: 2/112 cut-off events. [2023-11-19 08:02:55,012 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:55,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-19 08:02:55,020 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 242 flow [2023-11-19 08:02:55,026 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2023-11-19 08:02:55,031 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:02:55,044 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2023-11-19 08:02:55,048 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2023-11-19 08:02:55,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2023-11-19 08:02:55,087 INFO L124 PetriNetUnfolderBase]: 2/112 cut-off events. [2023-11-19 08:02:55,088 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:55,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-19 08:02:55,092 INFO L119 LiptonReduction]: Number of co-enabled transitions 2256 [2023-11-19 08:03:00,069 INFO L134 LiptonReduction]: Checked pairs total: 4177 [2023-11-19 08:03:00,070 INFO L136 LiptonReduction]: Total number of compositions: 103 [2023-11-19 08:03:00,100 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:03:00,109 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;@301c0ae6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:03:00,109 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 08:03:00,119 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:03:00,120 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-19 08:03:00,120 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:03:00,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:00,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:00,122 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:03:00,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:00,128 INFO L85 PathProgramCache]: Analyzing trace with hash -278073125, now seen corresponding path program 1 times [2023-11-19 08:03:00,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:00,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405537138] [2023-11-19 08:03:00,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:00,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:00,817 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:03:00,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:00,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405537138] [2023-11-19 08:03:00,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405537138] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:00,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:00,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:03:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850483262] [2023-11-19 08:03:00,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:00,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:03:00,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:00,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:03:00,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:03:00,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 218 [2023-11-19 08:03:00,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states 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:03:00,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:00,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 218 [2023-11-19 08:03:00,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:01,176 INFO L124 PetriNetUnfolderBase]: 511/903 cut-off events. [2023-11-19 08:03:01,177 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-19 08:03:01,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1722 conditions, 903 events. 511/903 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4510 event pairs, 112 based on Foata normal form. 0/854 useless extension candidates. Maximal degree in co-relation 1711. Up to 580 conditions per place. [2023-11-19 08:03:01,195 INFO L140 encePairwiseOnDemand]: 214/218 looper letters, 23 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2023-11-19 08:03:01,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 123 flow [2023-11-19 08:03:01,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:03:01,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:03:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-11-19 08:03:01,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518348623853211 [2023-11-19 08:03:01,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-11-19 08:03:01,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-11-19 08:03:01,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:01,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-11-19 08:03:01,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states 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:03:01,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states 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:03:01,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states 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:03:01,250 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 55 flow. Second operand 3 states and 339 transitions. [2023-11-19 08:03:01,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 123 flow [2023-11-19 08:03:01,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 08:03:01,257 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-11-19 08:03:01,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-11-19 08:03:01,264 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-19 08:03:01,265 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-11-19 08:03:01,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states 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:03:01,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:01,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:01,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:03:01,267 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:03:01,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:01,268 INFO L85 PathProgramCache]: Analyzing trace with hash -940259005, now seen corresponding path program 1 times [2023-11-19 08:03:01,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:01,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682313715] [2023-11-19 08:03:01,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:01,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:01,672 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:03:01,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:01,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682313715] [2023-11-19 08:03:01,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682313715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:01,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:01,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:03:01,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183577330] [2023-11-19 08:03:01,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:01,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:03:01,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:01,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:03:01,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:03:01,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 218 [2023-11-19 08:03:01,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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:03:01,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:01,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 218 [2023-11-19 08:03:01,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:02,122 INFO L124 PetriNetUnfolderBase]: 1119/1724 cut-off events. [2023-11-19 08:03:02,123 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-19 08:03:02,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3590 conditions, 1724 events. 1119/1724 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7728 event pairs, 363 based on Foata normal form. 52/1776 useless extension candidates. Maximal degree in co-relation 3580. Up to 1221 conditions per place. [2023-11-19 08:03:02,141 INFO L140 encePairwiseOnDemand]: 211/218 looper letters, 29 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2023-11-19 08:03:02,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 154 flow [2023-11-19 08:03:02,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:03:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:03:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-11-19 08:03:02,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954128440366973 [2023-11-19 08:03:02,146 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-11-19 08:03:02,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-11-19 08:03:02,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:02,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-11-19 08:03:02,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:02,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states 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:03:02,161 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states 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:03:02,161 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 324 transitions. [2023-11-19 08:03:02,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 35 transitions, 154 flow [2023-11-19 08:03:02,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 35 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:03:02,169 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 92 flow [2023-11-19 08:03:02,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2023-11-19 08:03:02,170 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-11-19 08:03:02,178 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 92 flow [2023-11-19 08:03:02,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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:03:02,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:02,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:02,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:03:02,180 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:03:02,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:02,181 INFO L85 PathProgramCache]: Analyzing trace with hash 916740781, now seen corresponding path program 1 times [2023-11-19 08:03:02,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:02,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261218896] [2023-11-19 08:03:02,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:02,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:02,443 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:03:02,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:02,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261218896] [2023-11-19 08:03:02,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261218896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:02,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:02,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:03:02,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379796562] [2023-11-19 08:03:02,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:02,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:03:02,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:02,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:03:02,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:03:02,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 218 [2023-11-19 08:03:02,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:02,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:02,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 218 [2023-11-19 08:03:02,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:02,834 INFO L124 PetriNetUnfolderBase]: 1047/1616 cut-off events. [2023-11-19 08:03:02,834 INFO L125 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2023-11-19 08:03:02,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 1616 events. 1047/1616 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6905 event pairs, 309 based on Foata normal form. 24/1640 useless extension candidates. Maximal degree in co-relation 4138. Up to 867 conditions per place. [2023-11-19 08:03:02,852 INFO L140 encePairwiseOnDemand]: 211/218 looper letters, 33 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2023-11-19 08:03:02,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 216 flow [2023-11-19 08:03:02,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:03:02,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:03:02,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 422 transitions. [2023-11-19 08:03:02,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48394495412844035 [2023-11-19 08:03:02,856 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 422 transitions. [2023-11-19 08:03:02,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 422 transitions. [2023-11-19 08:03:02,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:02,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 422 transitions. [2023-11-19 08:03:02,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states 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:03:02,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states 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:03:02,863 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states 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:03:02,863 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 92 flow. Second operand 4 states and 422 transitions. [2023-11-19 08:03:02,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 216 flow [2023-11-19 08:03:02,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:03:02,869 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 128 flow [2023-11-19 08:03:02,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2023-11-19 08:03:02,871 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-11-19 08:03:02,871 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 128 flow [2023-11-19 08:03:02,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:02,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:02,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:02,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:03:02,872 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:03:02,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:02,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1655423329, now seen corresponding path program 1 times [2023-11-19 08:03:02,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:02,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850476495] [2023-11-19 08:03:02,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:02,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:03,089 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:03:03,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:03,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850476495] [2023-11-19 08:03:03,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850476495] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:03,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:03,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:03:03,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752436746] [2023-11-19 08:03:03,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:03,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:03:03,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:03,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:03:03,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:03:03,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 218 [2023-11-19 08:03:03,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:03,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:03,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 218 [2023-11-19 08:03:03,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:03,523 INFO L124 PetriNetUnfolderBase]: 1015/1568 cut-off events. [2023-11-19 08:03:03,523 INFO L125 PetriNetUnfolderBase]: For 1093/1093 co-relation queries the response was YES. [2023-11-19 08:03:03,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4315 conditions, 1568 events. 1015/1568 cut-off events. For 1093/1093 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6978 event pairs, 211 based on Foata normal form. 8/1576 useless extension candidates. Maximal degree in co-relation 4300. Up to 1047 conditions per place. [2023-11-19 08:03:03,540 INFO L140 encePairwiseOnDemand]: 211/218 looper letters, 39 selfloop transitions, 13 changer transitions 0/52 dead transitions. [2023-11-19 08:03:03,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 52 transitions, 306 flow [2023-11-19 08:03:03,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:03:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:03:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 432 transitions. [2023-11-19 08:03:03,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954128440366973 [2023-11-19 08:03:03,544 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 432 transitions. [2023-11-19 08:03:03,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 432 transitions. [2023-11-19 08:03:03,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:03,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 432 transitions. [2023-11-19 08:03:03,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.0) internal successors, (432), 4 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:03:03,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states 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:03:03,550 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states 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:03:03,551 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 128 flow. Second operand 4 states and 432 transitions. [2023-11-19 08:03:03,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 52 transitions, 306 flow [2023-11-19 08:03:03,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 52 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:03:03,557 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 197 flow [2023-11-19 08:03:03,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-11-19 08:03:03,559 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2023-11-19 08:03:03,560 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 197 flow [2023-11-19 08:03:03,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:03,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:03,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:03,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:03:03,562 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:03:03,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:03,563 INFO L85 PathProgramCache]: Analyzing trace with hash 221527857, now seen corresponding path program 1 times [2023-11-19 08:03:03,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:03,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941536729] [2023-11-19 08:03:03,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:03,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:03,742 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:03:03,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:03,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941536729] [2023-11-19 08:03:03,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941536729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:03,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:03,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:03:03,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118747264] [2023-11-19 08:03:03,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:03,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:03:03,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:03,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:03:03,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:03:03,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 218 [2023-11-19 08:03:03,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:03,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:03,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 218 [2023-11-19 08:03:03,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:04,077 INFO L124 PetriNetUnfolderBase]: 634/1079 cut-off events. [2023-11-19 08:03:04,077 INFO L125 PetriNetUnfolderBase]: For 1315/1367 co-relation queries the response was YES. [2023-11-19 08:03:04,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3125 conditions, 1079 events. 634/1079 cut-off events. For 1315/1367 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5502 event pairs, 127 based on Foata normal form. 128/1171 useless extension candidates. Maximal degree in co-relation 3107. Up to 640 conditions per place. [2023-11-19 08:03:04,087 INFO L140 encePairwiseOnDemand]: 212/218 looper letters, 45 selfloop transitions, 7 changer transitions 16/77 dead transitions. [2023-11-19 08:03:04,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 77 transitions, 563 flow [2023-11-19 08:03:04,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:03:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:03:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2023-11-19 08:03:04,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4935779816513762 [2023-11-19 08:03:04,091 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2023-11-19 08:03:04,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2023-11-19 08:03:04,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:04,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2023-11-19 08:03:04,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states 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:03:04,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states 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:03:04,098 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states 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:03:04,099 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 197 flow. Second operand 5 states and 538 transitions. [2023-11-19 08:03:04,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 77 transitions, 563 flow [2023-11-19 08:03:04,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 77 transitions, 559 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-11-19 08:03:04,105 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 249 flow [2023-11-19 08:03:04,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-11-19 08:03:04,106 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2023-11-19 08:03:04,106 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 249 flow [2023-11-19 08:03:04,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:04,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:04,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:04,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:03:04,108 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:03:04,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:04,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1083815616, now seen corresponding path program 1 times [2023-11-19 08:03:04,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:04,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168661637] [2023-11-19 08:03:04,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:04,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:04,290 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:03:04,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:04,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168661637] [2023-11-19 08:03:04,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168661637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:04,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:04,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:03:04,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434824205] [2023-11-19 08:03:04,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:04,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:03:04,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:04,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:03:04,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:03:04,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 218 [2023-11-19 08:03:04,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states 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:03:04,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:04,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 218 [2023-11-19 08:03:04,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:04,638 INFO L124 PetriNetUnfolderBase]: 463/840 cut-off events. [2023-11-19 08:03:04,638 INFO L125 PetriNetUnfolderBase]: For 1401/1512 co-relation queries the response was YES. [2023-11-19 08:03:04,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3056 conditions, 840 events. 463/840 cut-off events. For 1401/1512 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4299 event pairs, 57 based on Foata normal form. 118/935 useless extension candidates. Maximal degree in co-relation 3033. Up to 290 conditions per place. [2023-11-19 08:03:04,647 INFO L140 encePairwiseOnDemand]: 212/218 looper letters, 55 selfloop transitions, 13 changer transitions 22/99 dead transitions. [2023-11-19 08:03:04,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 99 transitions, 777 flow [2023-11-19 08:03:04,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:03:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:03:04,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 752 transitions. [2023-11-19 08:03:04,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927916120576671 [2023-11-19 08:03:04,653 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 752 transitions. [2023-11-19 08:03:04,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 752 transitions. [2023-11-19 08:03:04,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:04,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 752 transitions. [2023-11-19 08:03:04,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.42857142857143) internal successors, (752), 7 states have internal predecessors, (752), 0 states have call successors, (0), 0 states 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:03:04,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states 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:03:04,662 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states 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:03:04,662 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 249 flow. Second operand 7 states and 752 transitions. [2023-11-19 08:03:04,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 99 transitions, 777 flow [2023-11-19 08:03:04,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 99 transitions, 773 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:03:04,670 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 333 flow [2023-11-19 08:03:04,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=333, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2023-11-19 08:03:04,671 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2023-11-19 08:03:04,671 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 333 flow [2023-11-19 08:03:04,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states 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:03:04,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:04,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:04,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:03:04,673 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:03:04,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:04,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1843260920, now seen corresponding path program 1 times [2023-11-19 08:03:04,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:04,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801044310] [2023-11-19 08:03:04,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:04,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:04,905 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:03:04,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:04,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801044310] [2023-11-19 08:03:04,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801044310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:04,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:04,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:03:04,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591327545] [2023-11-19 08:03:04,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:04,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:03:04,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:04,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:03:04,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:03:04,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 218 [2023-11-19 08:03:04,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 333 flow. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:04,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:04,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 218 [2023-11-19 08:03:04,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:05,296 INFO L124 PetriNetUnfolderBase]: 682/1218 cut-off events. [2023-11-19 08:03:05,296 INFO L125 PetriNetUnfolderBase]: For 4164/4164 co-relation queries the response was YES. [2023-11-19 08:03:05,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5406 conditions, 1218 events. 682/1218 cut-off events. For 4164/4164 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6191 event pairs, 96 based on Foata normal form. 8/1226 useless extension candidates. Maximal degree in co-relation 5379. Up to 555 conditions per place. [2023-11-19 08:03:05,308 INFO L140 encePairwiseOnDemand]: 210/218 looper letters, 61 selfloop transitions, 19 changer transitions 18/98 dead transitions. [2023-11-19 08:03:05,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 98 transitions, 886 flow [2023-11-19 08:03:05,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:03:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:03:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 527 transitions. [2023-11-19 08:03:05,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4834862385321101 [2023-11-19 08:03:05,312 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 527 transitions. [2023-11-19 08:03:05,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 527 transitions. [2023-11-19 08:03:05,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:05,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 527 transitions. [2023-11-19 08:03:05,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states 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:03:05,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states 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:03:05,318 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states 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:03:05,318 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 333 flow. Second operand 5 states and 527 transitions. [2023-11-19 08:03:05,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 98 transitions, 886 flow [2023-11-19 08:03:05,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 98 transitions, 806 flow, removed 29 selfloop flow, removed 2 redundant places. [2023-11-19 08:03:05,350 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 407 flow [2023-11-19 08:03:05,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=407, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2023-11-19 08:03:05,351 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2023-11-19 08:03:05,351 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 407 flow [2023-11-19 08:03:05,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:05,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:05,352 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:03:05,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:03:05,352 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:03:05,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:05,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1159089599, now seen corresponding path program 1 times [2023-11-19 08:03:05,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:05,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738136763] [2023-11-19 08:03:05,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:05,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:05,582 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:03:05,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:05,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738136763] [2023-11-19 08:03:05,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738136763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:05,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:05,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:03:05,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994366799] [2023-11-19 08:03:05,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:05,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:03:05,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:05,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:03:05,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:03:05,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 218 [2023-11-19 08:03:05,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 407 flow. Second operand has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states 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:03:05,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:05,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 218 [2023-11-19 08:03:05,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:05,836 INFO L124 PetriNetUnfolderBase]: 238/466 cut-off events. [2023-11-19 08:03:05,836 INFO L125 PetriNetUnfolderBase]: For 1624/1661 co-relation queries the response was YES. [2023-11-19 08:03:05,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 466 events. 238/466 cut-off events. For 1624/1661 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2078 event pairs, 33 based on Foata normal form. 42/498 useless extension candidates. Maximal degree in co-relation 1999. Up to 163 conditions per place. [2023-11-19 08:03:05,845 INFO L140 encePairwiseOnDemand]: 212/218 looper letters, 45 selfloop transitions, 10 changer transitions 18/86 dead transitions. [2023-11-19 08:03:05,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 86 transitions, 846 flow [2023-11-19 08:03:05,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:03:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:03:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 736 transitions. [2023-11-19 08:03:05,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48230668414154654 [2023-11-19 08:03:05,850 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 736 transitions. [2023-11-19 08:03:05,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 736 transitions. [2023-11-19 08:03:05,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:05,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 736 transitions. [2023-11-19 08:03:05,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.14285714285714) internal successors, (736), 7 states have internal predecessors, (736), 0 states have call successors, (0), 0 states 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:03:05,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states 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:03:05,858 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states 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:03:05,858 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 407 flow. Second operand 7 states and 736 transitions. [2023-11-19 08:03:05,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 86 transitions, 846 flow [2023-11-19 08:03:05,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 813 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-19 08:03:05,868 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 401 flow [2023-11-19 08:03:05,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2023-11-19 08:03:05,872 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 27 predicate places. [2023-11-19 08:03:05,872 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 401 flow [2023-11-19 08:03:05,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states 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:03:05,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:05,873 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] [2023-11-19 08:03:05,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 08:03:05,873 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:03:05,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:05,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1108275004, now seen corresponding path program 1 times [2023-11-19 08:03:05,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:05,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824256995] [2023-11-19 08:03:05,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:05,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:06,644 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:03:06,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:06,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824256995] [2023-11-19 08:03:06,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824256995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:06,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:06,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:03:06,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493501761] [2023-11-19 08:03:06,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:06,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:03:06,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:06,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:03:06,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:03:06,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 218 [2023-11-19 08:03:06,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 401 flow. Second operand has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 states 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:03:06,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:06,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 218 [2023-11-19 08:03:06,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:07,107 INFO L124 PetriNetUnfolderBase]: 284/541 cut-off events. [2023-11-19 08:03:07,107 INFO L125 PetriNetUnfolderBase]: For 2312/2312 co-relation queries the response was YES. [2023-11-19 08:03:07,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2621 conditions, 541 events. 284/541 cut-off events. For 2312/2312 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2258 event pairs, 37 based on Foata normal form. 1/542 useless extension candidates. Maximal degree in co-relation 2590. Up to 192 conditions per place. [2023-11-19 08:03:07,113 INFO L140 encePairwiseOnDemand]: 208/218 looper letters, 37 selfloop transitions, 23 changer transitions 59/119 dead transitions. [2023-11-19 08:03:07,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 119 transitions, 1232 flow [2023-11-19 08:03:07,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 08:03:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-19 08:03:07,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 903 transitions. [2023-11-19 08:03:07,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602446483180428 [2023-11-19 08:03:07,120 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 903 transitions. [2023-11-19 08:03:07,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 903 transitions. [2023-11-19 08:03:07,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:07,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 903 transitions. [2023-11-19 08:03:07,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.33333333333333) internal successors, (903), 9 states have internal predecessors, (903), 0 states have call successors, (0), 0 states 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:03:07,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 218.0) internal successors, (2180), 10 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states 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:03:07,133 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 218.0) internal successors, (2180), 10 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states 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:03:07,134 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 401 flow. Second operand 9 states and 903 transitions. [2023-11-19 08:03:07,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 119 transitions, 1232 flow [2023-11-19 08:03:07,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 119 transitions, 1114 flow, removed 27 selfloop flow, removed 7 redundant places. [2023-11-19 08:03:07,148 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 498 flow [2023-11-19 08:03:07,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=498, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-19 08:03:07,149 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 30 predicate places. [2023-11-19 08:03:07,150 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 498 flow [2023-11-19 08:03:07,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 states 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:03:07,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:07,151 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] [2023-11-19 08:03:07,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 08:03:07,151 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:03:07,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:07,152 INFO L85 PathProgramCache]: Analyzing trace with hash -970209796, now seen corresponding path program 2 times [2023-11-19 08:03:07,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:07,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797387681] [2023-11-19 08:03:07,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:07,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:07,397 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:03:07,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:07,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797387681] [2023-11-19 08:03:07,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797387681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:07,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:07,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:03:07,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088302116] [2023-11-19 08:03:07,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:07,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:03:07,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:07,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:03:07,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:03:07,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 218 [2023-11-19 08:03:07,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 498 flow. Second operand has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states 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:03:07,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:07,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 218 [2023-11-19 08:03:07,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:07,645 INFO L124 PetriNetUnfolderBase]: 140/307 cut-off events. [2023-11-19 08:03:07,645 INFO L125 PetriNetUnfolderBase]: For 1156/1156 co-relation queries the response was YES. [2023-11-19 08:03:07,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1523 conditions, 307 events. 140/307 cut-off events. For 1156/1156 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1212 event pairs, 17 based on Foata normal form. 1/308 useless extension candidates. Maximal degree in co-relation 1499. Up to 121 conditions per place. [2023-11-19 08:03:07,648 INFO L140 encePairwiseOnDemand]: 210/218 looper letters, 28 selfloop transitions, 9 changer transitions 49/86 dead transitions. [2023-11-19 08:03:07,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 895 flow [2023-11-19 08:03:07,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:03:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:03:07,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 621 transitions. [2023-11-19 08:03:07,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47477064220183485 [2023-11-19 08:03:07,652 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 621 transitions. [2023-11-19 08:03:07,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 621 transitions. [2023-11-19 08:03:07,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:07,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 621 transitions. [2023-11-19 08:03:07,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:07,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states 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:03:07,659 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states 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:03:07,660 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 498 flow. Second operand 6 states and 621 transitions. [2023-11-19 08:03:07,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 895 flow [2023-11-19 08:03:07,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 876 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-19 08:03:07,669 INFO L231 Difference]: Finished difference. Result has 62 places, 33 transitions, 273 flow [2023-11-19 08:03:07,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=273, PETRI_PLACES=62, PETRI_TRANSITIONS=33} [2023-11-19 08:03:07,670 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 30 predicate places. [2023-11-19 08:03:07,670 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 33 transitions, 273 flow [2023-11-19 08:03:07,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states 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:03:07,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:07,671 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] [2023-11-19 08:03:07,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 08:03:07,672 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:03:07,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:07,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1620581180, now seen corresponding path program 3 times [2023-11-19 08:03:07,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:07,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869184690] [2023-11-19 08:03:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:07,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:07,913 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:03:07,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:07,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869184690] [2023-11-19 08:03:07,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869184690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:07,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:07,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:03:07,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687201206] [2023-11-19 08:03:07,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:07,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:03:07,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:07,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:03:07,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:03:07,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 218 [2023-11-19 08:03:07,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 33 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states 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:03:07,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:07,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 218 [2023-11-19 08:03:07,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:08,023 INFO L124 PetriNetUnfolderBase]: 57/149 cut-off events. [2023-11-19 08:03:08,024 INFO L125 PetriNetUnfolderBase]: For 608/608 co-relation queries the response was YES. [2023-11-19 08:03:08,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 149 events. 57/149 cut-off events. For 608/608 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 488 event pairs, 27 based on Foata normal form. 1/150 useless extension candidates. Maximal degree in co-relation 707. Up to 105 conditions per place. [2023-11-19 08:03:08,025 INFO L140 encePairwiseOnDemand]: 213/218 looper letters, 23 selfloop transitions, 4 changer transitions 20/47 dead transitions. [2023-11-19 08:03:08,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 47 transitions, 437 flow [2023-11-19 08:03:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:03:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:03:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 418 transitions. [2023-11-19 08:03:08,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793577981651376 [2023-11-19 08:03:08,029 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 418 transitions. [2023-11-19 08:03:08,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 418 transitions. [2023-11-19 08:03:08,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:08,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 418 transitions. [2023-11-19 08:03:08,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states 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:03:08,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states 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:03:08,034 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states 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:03:08,035 INFO L175 Difference]: Start difference. First operand has 62 places, 33 transitions, 273 flow. Second operand 4 states and 418 transitions. [2023-11-19 08:03:08,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 47 transitions, 437 flow [2023-11-19 08:03:08,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 47 transitions, 372 flow, removed 3 selfloop flow, removed 13 redundant places. [2023-11-19 08:03:08,040 INFO L231 Difference]: Finished difference. Result has 52 places, 26 transitions, 162 flow [2023-11-19 08:03:08,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=52, PETRI_TRANSITIONS=26} [2023-11-19 08:03:08,041 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2023-11-19 08:03:08,041 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 26 transitions, 162 flow [2023-11-19 08:03:08,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states 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:03:08,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:08,042 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] [2023-11-19 08:03:08,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 08:03:08,042 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:03:08,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:08,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1165237284, now seen corresponding path program 4 times [2023-11-19 08:03:08,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:08,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362002002] [2023-11-19 08:03:08,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:08,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:08,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:03:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:08,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:03:08,232 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:03:08,233 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-19 08:03:08,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-19 08:03:08,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-19 08:03:08,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-19 08:03:08,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-19 08:03:08,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-19 08:03:08,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 08:03:08,241 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:08,249 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 08:03:08,250 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 08:03:08,312 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 08:03:08,316 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 08:03:08,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 08:03:08,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:03:08 BasicIcfg [2023-11-19 08:03:08,359 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 08:03:08,359 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 08:03:08,359 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 08:03:08,360 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 08:03:08,360 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:02:54" (3/4) ... [2023-11-19 08:03:08,361 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 08:03:08,397 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 08:03:08,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 08:03:08,402 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 08:03:08,487 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62300706-bafb-45cb-b323-a9bf440e19b4/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 08:03:08,488 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 08:03:08,488 INFO L158 Benchmark]: Toolchain (without parser) took 15940.83ms. Allocated memory was 138.4MB in the beginning and 255.9MB in the end (delta: 117.4MB). Free memory was 108.2MB in the beginning and 104.3MB in the end (delta: 3.9MB). Peak memory consumption was 122.8MB. Max. memory is 16.1GB. [2023-11-19 08:03:08,489 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 109.1MB. Free memory is still 58.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:03:08,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 902.42ms. Allocated memory is still 138.4MB. Free memory was 107.8MB in the beginning and 85.1MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-19 08:03:08,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.10ms. Allocated memory is still 138.4MB. Free memory was 85.1MB in the beginning and 82.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 08:03:08,490 INFO L158 Benchmark]: Boogie Preprocessor took 95.79ms. Allocated memory is still 138.4MB. Free memory was 82.6MB in the beginning and 80.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:03:08,492 INFO L158 Benchmark]: RCFGBuilder took 1065.47ms. Allocated memory is still 138.4MB. Free memory was 80.5MB in the beginning and 89.7MB in the end (delta: -9.1MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2023-11-19 08:03:08,492 INFO L158 Benchmark]: TraceAbstraction took 13622.24ms. Allocated memory was 138.4MB in the beginning and 255.9MB in the end (delta: 117.4MB). Free memory was 88.9MB in the beginning and 113.7MB in the end (delta: -24.8MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. [2023-11-19 08:03:08,493 INFO L158 Benchmark]: Witness Printer took 128.40ms. Allocated memory is still 255.9MB. Free memory was 113.7MB in the beginning and 104.3MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 08:03:08,495 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.39ms. Allocated memory is still 109.1MB. Free memory is still 58.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 902.42ms. Allocated memory is still 138.4MB. Free memory was 107.8MB in the beginning and 85.1MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.10ms. Allocated memory is still 138.4MB. Free memory was 85.1MB in the beginning and 82.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.79ms. Allocated memory is still 138.4MB. Free memory was 82.6MB in the beginning and 80.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1065.47ms. Allocated memory is still 138.4MB. Free memory was 80.5MB in the beginning and 89.7MB in the end (delta: -9.1MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13622.24ms. Allocated memory was 138.4MB in the beginning and 255.9MB in the end (delta: 117.4MB). Free memory was 88.9MB in the beginning and 113.7MB in the end (delta: -24.8MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. * Witness Printer took 128.40ms. Allocated memory is still 255.9MB. Free memory was 113.7MB in the beginning and 104.3MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 120 PlacesBefore, 32 PlacesAfterwards, 112 TransitionsBefore, 23 TransitionsAfterwards, 2256 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 103 TotalNumberOfCompositions, 4177 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2259, independent: 2138, independent conditional: 0, independent unconditional: 2138, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1262, independent: 1230, independent conditional: 0, independent unconditional: 1230, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2259, independent: 908, independent conditional: 0, independent unconditional: 908, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 1262, unknown conditional: 0, unknown unconditional: 1262] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1004; [L834] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1004={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t1005; [L836] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t1006; [L838] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L808] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 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) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 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 [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 836]: 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 390 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 153 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 930 IncrementalHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 55 mSDtfsCounter, 930 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=498occurred in iteration=9, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 868 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-19 08:03:08,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62300706-bafb-45cb-b323-a9bf440e19b4/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