./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_030b502e-5b34-4de4-8ce9-0c4d18295150/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_030b502e-5b34-4de4-8ce9-0c4d18295150/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_030b502e-5b34-4de4-8ce9-0c4d18295150/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_030b502e-5b34-4de4-8ce9-0c4d18295150/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_030b502e-5b34-4de4-8ce9-0c4d18295150/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_030b502e-5b34-4de4-8ce9-0c4d18295150/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 9ec75f624fee0326f6dc01ebf4c0afe8f65e83cfa5c5726cd79e55765f7366f9 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:35:18,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:35:18,768 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_030b502e-5b34-4de4-8ce9-0c4d18295150/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:35:18,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:35:18,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:35:18,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:35:18,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:35:18,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:35:18,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:35:18,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:35:18,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:35:18,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:35:18,815 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:35:18,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:35:18,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:35:18,818 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:35:18,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:35:18,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:35:18,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:35:18,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:35:18,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:35:18,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:35:18,821 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:35:18,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:35:18,822 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:35:18,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:35:18,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:35:18,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:35:18,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:35:18,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:35:18,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:35:18,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:35:18,827 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:35:18,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:35:18,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:35:18,828 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:35:18,828 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:35:18,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:35:18,829 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:35:18,829 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_030b502e-5b34-4de4-8ce9-0c4d18295150/bin/uautomizer-verify-WvqO1wxjHP/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_030b502e-5b34-4de4-8ce9-0c4d18295150/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 9ec75f624fee0326f6dc01ebf4c0afe8f65e83cfa5c5726cd79e55765f7366f9 [2023-11-06 22:35:19,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:35:19,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:35:19,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:35:19,164 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:35:19,164 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:35:19,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_030b502e-5b34-4de4-8ce9-0c4d18295150/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i [2023-11-06 22:35:22,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:35:22,618 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:35:22,619 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_030b502e-5b34-4de4-8ce9-0c4d18295150/sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i [2023-11-06 22:35:22,641 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_030b502e-5b34-4de4-8ce9-0c4d18295150/bin/uautomizer-verify-WvqO1wxjHP/data/6eee85ea8/2a81acf3f86e40e6b294c2da7f38a793/FLAG14e67b015 [2023-11-06 22:35:22,657 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_030b502e-5b34-4de4-8ce9-0c4d18295150/bin/uautomizer-verify-WvqO1wxjHP/data/6eee85ea8/2a81acf3f86e40e6b294c2da7f38a793 [2023-11-06 22:35:22,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:35:22,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:35:22,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:35:22,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:35:22,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:35:22,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:22" (1/1) ... [2023-11-06 22:35:22,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ecba96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:22, skipping insertion in model container [2023-11-06 22:35:22,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:22" (1/1) ... [2023-11-06 22:35:22,747 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:35:22,932 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_030b502e-5b34-4de4-8ce9-0c4d18295150/sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i[949,962] [2023-11-06 22:35:23,213 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:35:23,231 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:35:23,248 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_030b502e-5b34-4de4-8ce9-0c4d18295150/sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i[949,962] [2023-11-06 22:35:23,349 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:35:23,402 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:35:23,403 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:35:23,410 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:35:23,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23 WrapperNode [2023-11-06 22:35:23,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:35:23,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:35:23,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:35:23,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:35:23,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,505 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2023-11-06 22:35:23,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:35:23,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:35:23,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:35:23,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:35:23,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,549 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:35:23,584 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:35:23,584 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:35:23,585 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:35:23,585 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:35:23,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_030b502e-5b34-4de4-8ce9-0c4d18295150/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:35:23,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_030b502e-5b34-4de4-8ce9-0c4d18295150/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:35:23,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_030b502e-5b34-4de4-8ce9-0c4d18295150/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:35:23,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:35:23,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:35:23,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:35:23,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:35:23,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:35:23,674 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:35:23,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:35:23,675 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:35:23,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:35:23,675 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:35:23,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:35:23,676 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:35:23,676 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:35:23,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:35:23,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:35:23,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:35:23,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:35:23,679 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:35:23,884 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:35:23,886 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:35:24,263 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:35:24,516 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:35:24,516 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:35:24,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:24 BoogieIcfgContainer [2023-11-06 22:35:24,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:35:24,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:35:24,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:35:24,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:35:24,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:35:22" (1/3) ... [2023-11-06 22:35:24,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213560a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:24, skipping insertion in model container [2023-11-06 22:35:24,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (2/3) ... [2023-11-06 22:35:24,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213560a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:24, skipping insertion in model container [2023-11-06 22:35:24,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:24" (3/3) ... [2023-11-06 22:35:24,529 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i [2023-11-06 22:35:24,539 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:35:24,550 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:35:24,551 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:35:24,551 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:35:24,619 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:35:24,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 278 flow [2023-11-06 22:35:24,730 INFO L124 PetriNetUnfolderBase]: 2/127 cut-off events. [2023-11-06 22:35:24,731 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:35:24,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2023-11-06 22:35:24,739 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 278 flow [2023-11-06 22:35:24,745 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2023-11-06 22:35:24,749 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:35:24,760 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2023-11-06 22:35:24,763 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2023-11-06 22:35:24,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2023-11-06 22:35:24,802 INFO L124 PetriNetUnfolderBase]: 2/127 cut-off events. [2023-11-06 22:35:24,802 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:35:24,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2023-11-06 22:35:24,807 INFO L119 LiptonReduction]: Number of co-enabled transitions 3276 [2023-11-06 22:35:29,693 INFO L134 LiptonReduction]: Checked pairs total: 8624 [2023-11-06 22:35:29,693 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-11-06 22:35:29,708 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:35:29,715 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=LoopsAndPotentialCycles, 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;@4a60e6d0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:35:29,716 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-06 22:35:29,720 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:35:29,720 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-06 22:35:29,720 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:35:29,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:35:29,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:35:29,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:35:29,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:29,727 INFO L85 PathProgramCache]: Analyzing trace with hash 529295641, now seen corresponding path program 1 times [2023-11-06 22:35:29,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:29,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913652381] [2023-11-06 22:35:29,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:29,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:30,221 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-06 22:35:30,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:30,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913652381] [2023-11-06 22:35:30,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913652381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:30,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:30,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:35:30,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145712443] [2023-11-06 22:35:30,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:30,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:35:30,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:30,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:35:30,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:35:30,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 240 [2023-11-06 22:35:30,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:30,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:35:30,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 240 [2023-11-06 22:35:30,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:35:31,762 INFO L124 PetriNetUnfolderBase]: 5463/7958 cut-off events. [2023-11-06 22:35:31,763 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-11-06 22:35:31,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15558 conditions, 7958 events. 5463/7958 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 47167 event pairs, 1005 based on Foata normal form. 256/7685 useless extension candidates. Maximal degree in co-relation 15546. Up to 5923 conditions per place. [2023-11-06 22:35:31,837 INFO L140 encePairwiseOnDemand]: 236/240 looper letters, 39 selfloop transitions, 2 changer transitions 4/49 dead transitions. [2023-11-06 22:35:31,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 206 flow [2023-11-06 22:35:31,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:35:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:35:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-11-06 22:35:31,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2023-11-06 22:35:31,861 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-11-06 22:35:31,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-11-06 22:35:31,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:35:31,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-11-06 22:35:31,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:31,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:31,882 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:31,884 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 393 transitions. [2023-11-06 22:35:31,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 206 flow [2023-11-06 22:35:31,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:35:31,894 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-11-06 22:35:31,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-11-06 22:35:31,901 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-11-06 22:35:31,901 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-11-06 22:35:31,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:31,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:35:31,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:31,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:35:31,903 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:35:31,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:31,903 INFO L85 PathProgramCache]: Analyzing trace with hash -925532503, now seen corresponding path program 1 times [2023-11-06 22:35:31,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:31,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366248564] [2023-11-06 22:35:31,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:31,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:32,277 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-06 22:35:32,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:32,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366248564] [2023-11-06 22:35:32,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366248564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:32,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:32,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:35:32,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781987936] [2023-11-06 22:35:32,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:32,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:35:32,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:32,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:35:32,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:35:32,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 240 [2023-11-06 22:35:32,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:32,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:35:32,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 240 [2023-11-06 22:35:32,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:35:33,750 INFO L124 PetriNetUnfolderBase]: 5447/7784 cut-off events. [2023-11-06 22:35:33,750 INFO L125 PetriNetUnfolderBase]: For 509/509 co-relation queries the response was YES. [2023-11-06 22:35:33,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16006 conditions, 7784 events. 5447/7784 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 41891 event pairs, 1399 based on Foata normal form. 320/8100 useless extension candidates. Maximal degree in co-relation 15996. Up to 5953 conditions per place. [2023-11-06 22:35:33,813 INFO L140 encePairwiseOnDemand]: 235/240 looper letters, 35 selfloop transitions, 3 changer transitions 23/64 dead transitions. [2023-11-06 22:35:33,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 270 flow [2023-11-06 22:35:33,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:35:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:35:33,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2023-11-06 22:35:33,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515 [2023-11-06 22:35:33,818 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 618 transitions. [2023-11-06 22:35:33,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 618 transitions. [2023-11-06 22:35:33,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:35:33,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 618 transitions. [2023-11-06 22:35:33,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:33,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:33,830 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:33,831 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 618 transitions. [2023-11-06 22:35:33,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 64 transitions, 270 flow [2023-11-06 22:35:33,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:35:33,836 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 91 flow [2023-11-06 22:35:33,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-11-06 22:35:33,842 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2023-11-06 22:35:33,843 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 91 flow [2023-11-06 22:35:33,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:33,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:35:33,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:33,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:35:33,844 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:35:33,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:33,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1373233302, now seen corresponding path program 1 times [2023-11-06 22:35:33,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:33,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983184959] [2023-11-06 22:35:33,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:33,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:35:34,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:34,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983184959] [2023-11-06 22:35:34,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983184959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:34,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:34,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:35:34,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641121393] [2023-11-06 22:35:34,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:34,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:35:34,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:34,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:35:34,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:35:34,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 240 [2023-11-06 22:35:34,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:34,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:35:34,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 240 [2023-11-06 22:35:34,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:35:36,265 INFO L124 PetriNetUnfolderBase]: 4909/6906 cut-off events. [2023-11-06 22:35:36,266 INFO L125 PetriNetUnfolderBase]: For 2266/2270 co-relation queries the response was YES. [2023-11-06 22:35:36,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15635 conditions, 6906 events. 4909/6906 cut-off events. For 2266/2270 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 35664 event pairs, 2376 based on Foata normal form. 290/7183 useless extension candidates. Maximal degree in co-relation 15622. Up to 5822 conditions per place. [2023-11-06 22:35:36,327 INFO L140 encePairwiseOnDemand]: 233/240 looper letters, 36 selfloop transitions, 5 changer transitions 20/66 dead transitions. [2023-11-06 22:35:36,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 66 transitions, 308 flow [2023-11-06 22:35:36,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:35:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:35:36,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2023-11-06 22:35:36,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216666666666666 [2023-11-06 22:35:36,331 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 626 transitions. [2023-11-06 22:35:36,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 626 transitions. [2023-11-06 22:35:36,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:35:36,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 626 transitions. [2023-11-06 22:35:36,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:36,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:36,339 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:36,339 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 91 flow. Second operand 5 states and 626 transitions. [2023-11-06 22:35:36,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 66 transitions, 308 flow [2023-11-06 22:35:36,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 66 transitions, 302 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:35:36,383 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 131 flow [2023-11-06 22:35:36,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-11-06 22:35:36,384 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2023-11-06 22:35:36,385 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 131 flow [2023-11-06 22:35:36,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:36,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:35:36,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:36,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:35:36,386 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:35:36,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:36,387 INFO L85 PathProgramCache]: Analyzing trace with hash -395577135, now seen corresponding path program 1 times [2023-11-06 22:35:36,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:36,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737268519] [2023-11-06 22:35:36,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:36,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:37,308 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-06 22:35:37,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:37,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737268519] [2023-11-06 22:35:37,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737268519] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:37,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:37,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:35:37,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044155100] [2023-11-06 22:35:37,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:37,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:35:37,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:37,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:35:37,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:35:37,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 240 [2023-11-06 22:35:37,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 131 flow. Second operand has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:37,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:35:37,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 240 [2023-11-06 22:35:37,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:35:38,996 INFO L124 PetriNetUnfolderBase]: 6323/8975 cut-off events. [2023-11-06 22:35:38,996 INFO L125 PetriNetUnfolderBase]: For 7681/7734 co-relation queries the response was YES. [2023-11-06 22:35:39,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24677 conditions, 8975 events. 6323/8975 cut-off events. For 7681/7734 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 47947 event pairs, 2430 based on Foata normal form. 411/9376 useless extension candidates. Maximal degree in co-relation 24661. Up to 6764 conditions per place. [2023-11-06 22:35:39,076 INFO L140 encePairwiseOnDemand]: 232/240 looper letters, 59 selfloop transitions, 8 changer transitions 33/104 dead transitions. [2023-11-06 22:35:39,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 104 transitions, 578 flow [2023-11-06 22:35:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:35:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:35:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 863 transitions. [2023-11-06 22:35:39,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5136904761904761 [2023-11-06 22:35:39,082 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 863 transitions. [2023-11-06 22:35:39,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 863 transitions. [2023-11-06 22:35:39,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:35:39,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 863 transitions. [2023-11-06 22:35:39,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.28571428571429) internal successors, (863), 7 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:39,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:39,094 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:39,094 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 131 flow. Second operand 7 states and 863 transitions. [2023-11-06 22:35:39,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 104 transitions, 578 flow [2023-11-06 22:35:39,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 104 transitions, 568 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:35:39,146 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 208 flow [2023-11-06 22:35:39,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2023-11-06 22:35:39,147 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2023-11-06 22:35:39,147 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 208 flow [2023-11-06 22:35:39,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:39,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:35:39,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:39,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:35:39,149 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:35:39,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:39,150 INFO L85 PathProgramCache]: Analyzing trace with hash -746687337, now seen corresponding path program 1 times [2023-11-06 22:35:39,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:39,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349857039] [2023-11-06 22:35:39,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:39,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:40,262 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-06 22:35:40,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:40,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349857039] [2023-11-06 22:35:40,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349857039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:40,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:40,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:35:40,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535111994] [2023-11-06 22:35:40,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:40,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:35:40,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:40,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:35:40,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:35:40,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 240 [2023-11-06 22:35:40,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:40,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:35:40,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 240 [2023-11-06 22:35:40,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:35:41,669 INFO L124 PetriNetUnfolderBase]: 5828/8384 cut-off events. [2023-11-06 22:35:41,669 INFO L125 PetriNetUnfolderBase]: For 17726/17911 co-relation queries the response was YES. [2023-11-06 22:35:41,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28334 conditions, 8384 events. 5828/8384 cut-off events. For 17726/17911 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 45174 event pairs, 1566 based on Foata normal form. 299/8662 useless extension candidates. Maximal degree in co-relation 28313. Up to 6211 conditions per place. [2023-11-06 22:35:41,738 INFO L140 encePairwiseOnDemand]: 232/240 looper letters, 59 selfloop transitions, 13 changer transitions 29/105 dead transitions. [2023-11-06 22:35:41,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 105 transitions, 720 flow [2023-11-06 22:35:41,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:35:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:35:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2023-11-06 22:35:41,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154761904761904 [2023-11-06 22:35:41,743 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 866 transitions. [2023-11-06 22:35:41,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 866 transitions. [2023-11-06 22:35:41,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:35:41,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 866 transitions. [2023-11-06 22:35:41,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.71428571428571) internal successors, (866), 7 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:41,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:41,751 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:41,752 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 208 flow. Second operand 7 states and 866 transitions. [2023-11-06 22:35:41,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 105 transitions, 720 flow [2023-11-06 22:35:41,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 105 transitions, 700 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-11-06 22:35:41,864 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 308 flow [2023-11-06 22:35:41,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=308, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-11-06 22:35:41,866 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places. [2023-11-06 22:35:41,866 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 308 flow [2023-11-06 22:35:41,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:41,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:35:41,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:41,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:35:41,867 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:35:41,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:41,868 INFO L85 PathProgramCache]: Analyzing trace with hash -746644092, now seen corresponding path program 1 times [2023-11-06 22:35:41,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:41,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496534458] [2023-11-06 22:35:41,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:41,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:42,416 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-06 22:35:42,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:42,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496534458] [2023-11-06 22:35:42,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496534458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:42,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:42,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:35:42,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879631568] [2023-11-06 22:35:42,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:42,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:35:42,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:42,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:35:42,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:35:42,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 240 [2023-11-06 22:35:42,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:42,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:35:42,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 240 [2023-11-06 22:35:42,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:35:43,987 INFO L124 PetriNetUnfolderBase]: 6765/9649 cut-off events. [2023-11-06 22:35:43,987 INFO L125 PetriNetUnfolderBase]: For 40926/41004 co-relation queries the response was YES. [2023-11-06 22:35:44,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38150 conditions, 9649 events. 6765/9649 cut-off events. For 40926/41004 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 52720 event pairs, 4071 based on Foata normal form. 214/9774 useless extension candidates. Maximal degree in co-relation 38124. Up to 7526 conditions per place. [2023-11-06 22:35:44,071 INFO L140 encePairwiseOnDemand]: 230/240 looper letters, 64 selfloop transitions, 22 changer transitions 19/109 dead transitions. [2023-11-06 22:35:44,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 109 transitions, 918 flow [2023-11-06 22:35:44,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:35:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:35:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 850 transitions. [2023-11-06 22:35:44,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5059523809523809 [2023-11-06 22:35:44,075 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 850 transitions. [2023-11-06 22:35:44,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 850 transitions. [2023-11-06 22:35:44,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:35:44,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 850 transitions. [2023-11-06 22:35:44,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:44,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:44,083 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:44,083 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 308 flow. Second operand 7 states and 850 transitions. [2023-11-06 22:35:44,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 109 transitions, 918 flow [2023-11-06 22:35:44,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 109 transitions, 828 flow, removed 41 selfloop flow, removed 4 redundant places. [2023-11-06 22:35:44,237 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 523 flow [2023-11-06 22:35:44,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=523, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-11-06 22:35:44,239 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2023-11-06 22:35:44,240 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 523 flow [2023-11-06 22:35:44,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:44,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:35:44,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:44,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:35:44,241 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:35:44,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:44,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1660765444, now seen corresponding path program 2 times [2023-11-06 22:35:44,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:44,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085419119] [2023-11-06 22:35:44,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:44,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:44,796 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-06 22:35:44,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:44,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085419119] [2023-11-06 22:35:44,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085419119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:44,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:44,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:35:44,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97221254] [2023-11-06 22:35:44,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:44,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:35:44,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:44,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:35:44,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:35:44,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 240 [2023-11-06 22:35:44,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 523 flow. Second operand has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:44,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:35:44,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 240 [2023-11-06 22:35:44,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:35:46,831 INFO L124 PetriNetUnfolderBase]: 6790/9713 cut-off events. [2023-11-06 22:35:46,831 INFO L125 PetriNetUnfolderBase]: For 40389/40772 co-relation queries the response was YES. [2023-11-06 22:35:46,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40849 conditions, 9713 events. 6790/9713 cut-off events. For 40389/40772 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 52851 event pairs, 1794 based on Foata normal form. 393/10085 useless extension candidates. Maximal degree in co-relation 40821. Up to 7420 conditions per place. [2023-11-06 22:35:46,941 INFO L140 encePairwiseOnDemand]: 231/240 looper letters, 76 selfloop transitions, 29 changer transitions 19/128 dead transitions. [2023-11-06 22:35:46,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 128 transitions, 1106 flow [2023-11-06 22:35:46,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:35:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:35:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 855 transitions. [2023-11-06 22:35:46,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2023-11-06 22:35:46,946 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 855 transitions. [2023-11-06 22:35:46,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 855 transitions. [2023-11-06 22:35:46,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:35:46,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 855 transitions. [2023-11-06 22:35:46,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:46,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:46,961 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:46,962 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 523 flow. Second operand 7 states and 855 transitions. [2023-11-06 22:35:46,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 128 transitions, 1106 flow [2023-11-06 22:35:47,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 128 transitions, 1055 flow, removed 25 selfloop flow, removed 3 redundant places. [2023-11-06 22:35:47,188 INFO L231 Difference]: Finished difference. Result has 67 places, 69 transitions, 612 flow [2023-11-06 22:35:47,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=612, PETRI_PLACES=67, PETRI_TRANSITIONS=69} [2023-11-06 22:35:47,189 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2023-11-06 22:35:47,190 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 612 flow [2023-11-06 22:35:47,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:47,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:35:47,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:47,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:35:47,191 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:35:47,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:47,192 INFO L85 PathProgramCache]: Analyzing trace with hash -745317912, now seen corresponding path program 3 times [2023-11-06 22:35:47,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:47,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215100346] [2023-11-06 22:35:47,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:47,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:47,753 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-06 22:35:47,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:47,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215100346] [2023-11-06 22:35:47,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215100346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:47,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:47,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:35:47,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918193810] [2023-11-06 22:35:47,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:47,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:35:47,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:47,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:35:47,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:35:47,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 240 [2023-11-06 22:35:47,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 69 transitions, 612 flow. Second operand has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:47,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:35:47,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 240 [2023-11-06 22:35:47,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:35:49,371 INFO L124 PetriNetUnfolderBase]: 6778/9710 cut-off events. [2023-11-06 22:35:49,371 INFO L125 PetriNetUnfolderBase]: For 52298/52681 co-relation queries the response was YES. [2023-11-06 22:35:49,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44309 conditions, 9710 events. 6778/9710 cut-off events. For 52298/52681 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 53419 event pairs, 1702 based on Foata normal form. 379/10068 useless extension candidates. Maximal degree in co-relation 44279. Up to 6639 conditions per place. [2023-11-06 22:35:49,457 INFO L140 encePairwiseOnDemand]: 230/240 looper letters, 82 selfloop transitions, 28 changer transitions 11/125 dead transitions. [2023-11-06 22:35:49,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 125 transitions, 1141 flow [2023-11-06 22:35:49,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:35:49,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:35:49,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 848 transitions. [2023-11-06 22:35:49,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2023-11-06 22:35:49,462 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 848 transitions. [2023-11-06 22:35:49,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 848 transitions. [2023-11-06 22:35:49,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:35:49,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 848 transitions. [2023-11-06 22:35:49,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:49,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:49,471 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:49,471 INFO L175 Difference]: Start difference. First operand has 67 places, 69 transitions, 612 flow. Second operand 7 states and 848 transitions. [2023-11-06 22:35:49,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 125 transitions, 1141 flow [2023-11-06 22:35:49,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 125 transitions, 1045 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-11-06 22:35:49,699 INFO L231 Difference]: Finished difference. Result has 68 places, 74 transitions, 630 flow [2023-11-06 22:35:49,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=630, PETRI_PLACES=68, PETRI_TRANSITIONS=74} [2023-11-06 22:35:49,700 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 24 predicate places. [2023-11-06 22:35:49,700 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 74 transitions, 630 flow [2023-11-06 22:35:49,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:49,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:35:49,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:49,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:35:49,701 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:35:49,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:49,702 INFO L85 PathProgramCache]: Analyzing trace with hash -781701372, now seen corresponding path program 4 times [2023-11-06 22:35:49,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:49,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813636850] [2023-11-06 22:35:49,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:49,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:50,257 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-06 22:35:50,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:50,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813636850] [2023-11-06 22:35:50,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813636850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:50,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:50,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:35:50,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647835615] [2023-11-06 22:35:50,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:50,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:35:50,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:50,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:35:50,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:35:50,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 240 [2023-11-06 22:35:50,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 74 transitions, 630 flow. Second operand has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:50,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:35:50,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 240 [2023-11-06 22:35:50,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:35:51,973 INFO L124 PetriNetUnfolderBase]: 7501/10833 cut-off events. [2023-11-06 22:35:51,973 INFO L125 PetriNetUnfolderBase]: For 64804/65123 co-relation queries the response was YES. [2023-11-06 22:35:52,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51348 conditions, 10833 events. 7501/10833 cut-off events. For 64804/65123 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 61573 event pairs, 1563 based on Foata normal form. 429/11240 useless extension candidates. Maximal degree in co-relation 51318. Up to 6224 conditions per place. [2023-11-06 22:35:52,049 INFO L140 encePairwiseOnDemand]: 231/240 looper letters, 73 selfloop transitions, 32 changer transitions 21/130 dead transitions. [2023-11-06 22:35:52,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 130 transitions, 1260 flow [2023-11-06 22:35:52,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:35:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:35:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 846 transitions. [2023-11-06 22:35:52,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035714285714286 [2023-11-06 22:35:52,053 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 846 transitions. [2023-11-06 22:35:52,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 846 transitions. [2023-11-06 22:35:52,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:35:52,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 846 transitions. [2023-11-06 22:35:52,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:52,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:52,062 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:52,062 INFO L175 Difference]: Start difference. First operand has 68 places, 74 transitions, 630 flow. Second operand 7 states and 846 transitions. [2023-11-06 22:35:52,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 130 transitions, 1260 flow [2023-11-06 22:35:52,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 130 transitions, 1243 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-06 22:35:52,197 INFO L231 Difference]: Finished difference. Result has 74 places, 78 transitions, 794 flow [2023-11-06 22:35:52,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=794, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2023-11-06 22:35:52,198 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2023-11-06 22:35:52,198 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 794 flow [2023-11-06 22:35:52,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:52,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:35:52,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:52,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:35:52,200 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:35:52,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:52,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2099714290, now seen corresponding path program 1 times [2023-11-06 22:35:52,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:52,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720595413] [2023-11-06 22:35:52,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:52,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:52,373 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-06 22:35:52,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:52,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720595413] [2023-11-06 22:35:52,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720595413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:52,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:52,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:35:52,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685094331] [2023-11-06 22:35:52,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:52,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:35:52,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:52,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:35:52,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:35:52,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 240 [2023-11-06 22:35:52,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:52,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:35:52,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 240 [2023-11-06 22:35:52,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:35:53,448 INFO L124 PetriNetUnfolderBase]: 4274/6269 cut-off events. [2023-11-06 22:35:53,448 INFO L125 PetriNetUnfolderBase]: For 70484/71027 co-relation queries the response was YES. [2023-11-06 22:35:53,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35117 conditions, 6269 events. 4274/6269 cut-off events. For 70484/71027 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 33924 event pairs, 958 based on Foata normal form. 647/6891 useless extension candidates. Maximal degree in co-relation 35084. Up to 5145 conditions per place. [2023-11-06 22:35:53,497 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 101 selfloop transitions, 5 changer transitions 0/113 dead transitions. [2023-11-06 22:35:53,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 113 transitions, 1369 flow [2023-11-06 22:35:53,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:35:53,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:35:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-11-06 22:35:53,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2023-11-06 22:35:53,500 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-11-06 22:35:53,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-11-06 22:35:53,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:35:53,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-11-06 22:35:53,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:53,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:53,505 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:53,505 INFO L175 Difference]: Start difference. First operand has 74 places, 78 transitions, 794 flow. Second operand 3 states and 376 transitions. [2023-11-06 22:35:53,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 113 transitions, 1369 flow [2023-11-06 22:35:53,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 113 transitions, 1245 flow, removed 39 selfloop flow, removed 6 redundant places. [2023-11-06 22:35:53,560 INFO L231 Difference]: Finished difference. Result has 69 places, 78 transitions, 708 flow [2023-11-06 22:35:53,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=69, PETRI_TRANSITIONS=78} [2023-11-06 22:35:53,561 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2023-11-06 22:35:53,561 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 78 transitions, 708 flow [2023-11-06 22:35:53,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:53,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:35:53,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:53,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:35:53,563 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:35:53,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:53,563 INFO L85 PathProgramCache]: Analyzing trace with hash -588147797, now seen corresponding path program 1 times [2023-11-06 22:35:53,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:53,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270078194] [2023-11-06 22:35:53,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:53,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:53,738 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-06 22:35:53,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:53,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270078194] [2023-11-06 22:35:53,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270078194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:53,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:53,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:35:53,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000288799] [2023-11-06 22:35:53,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:53,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:35:53,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:53,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:35:53,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:35:53,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 240 [2023-11-06 22:35:53,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 78 transitions, 708 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:53,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:35:53,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 240 [2023-11-06 22:35:53,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:35:54,364 INFO L124 PetriNetUnfolderBase]: 2191/3419 cut-off events. [2023-11-06 22:35:54,364 INFO L125 PetriNetUnfolderBase]: For 25923/26259 co-relation queries the response was YES. [2023-11-06 22:35:54,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17288 conditions, 3419 events. 2191/3419 cut-off events. For 25923/26259 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 18179 event pairs, 345 based on Foata normal form. 493/3887 useless extension candidates. Maximal degree in co-relation 17257. Up to 1428 conditions per place. [2023-11-06 22:35:54,390 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 122 selfloop transitions, 9 changer transitions 0/138 dead transitions. [2023-11-06 22:35:54,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 138 transitions, 1558 flow [2023-11-06 22:35:54,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:35:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:35:54,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2023-11-06 22:35:54,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5239583333333333 [2023-11-06 22:35:54,393 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 503 transitions. [2023-11-06 22:35:54,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 503 transitions. [2023-11-06 22:35:54,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:35:54,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 503 transitions. [2023-11-06 22:35:54,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.75) internal successors, (503), 4 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-06 22:35:54,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:54,397 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:54,397 INFO L175 Difference]: Start difference. First operand has 69 places, 78 transitions, 708 flow. Second operand 4 states and 503 transitions. [2023-11-06 22:35:54,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 138 transitions, 1558 flow [2023-11-06 22:35:54,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 138 transitions, 1553 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:35:54,428 INFO L231 Difference]: Finished difference. Result has 72 places, 76 transitions, 695 flow [2023-11-06 22:35:54,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=695, PETRI_PLACES=72, PETRI_TRANSITIONS=76} [2023-11-06 22:35:54,429 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2023-11-06 22:35:54,429 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 76 transitions, 695 flow [2023-11-06 22:35:54,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:54,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:35:54,430 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-06 22:35:54,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:35:54,431 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:35:54,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:54,431 INFO L85 PathProgramCache]: Analyzing trace with hash -517524186, now seen corresponding path program 1 times [2023-11-06 22:35:54,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:54,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210229252] [2023-11-06 22:35:54,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:54,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:54,627 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-06 22:35:54,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:54,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210229252] [2023-11-06 22:35:54,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210229252] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:54,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:54,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:35:54,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956235815] [2023-11-06 22:35:54,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:54,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:35:54,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:54,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:35:54,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:35:54,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 240 [2023-11-06 22:35:54,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 76 transitions, 695 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:54,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:35:54,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 240 [2023-11-06 22:35:54,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:35:55,639 INFO L124 PetriNetUnfolderBase]: 3300/5218 cut-off events. [2023-11-06 22:35:55,639 INFO L125 PetriNetUnfolderBase]: For 41233/41655 co-relation queries the response was YES. [2023-11-06 22:35:55,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27932 conditions, 5218 events. 3300/5218 cut-off events. For 41233/41655 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 30621 event pairs, 851 based on Foata normal form. 466/5663 useless extension candidates. Maximal degree in co-relation 27899. Up to 2605 conditions per place. [2023-11-06 22:35:55,675 INFO L140 encePairwiseOnDemand]: 236/240 looper letters, 109 selfloop transitions, 3 changer transitions 44/161 dead transitions. [2023-11-06 22:35:55,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 161 transitions, 1860 flow [2023-11-06 22:35:55,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:35:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:35:55,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2023-11-06 22:35:55,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515 [2023-11-06 22:35:55,679 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 618 transitions. [2023-11-06 22:35:55,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 618 transitions. [2023-11-06 22:35:55,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:35:55,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 618 transitions. [2023-11-06 22:35:55,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:55,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:55,686 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:55,686 INFO L175 Difference]: Start difference. First operand has 72 places, 76 transitions, 695 flow. Second operand 5 states and 618 transitions. [2023-11-06 22:35:55,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 161 transitions, 1860 flow [2023-11-06 22:35:55,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 161 transitions, 1822 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-11-06 22:35:55,742 INFO L231 Difference]: Finished difference. Result has 77 places, 76 transitions, 690 flow [2023-11-06 22:35:55,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=690, PETRI_PLACES=77, PETRI_TRANSITIONS=76} [2023-11-06 22:35:55,743 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2023-11-06 22:35:55,743 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 76 transitions, 690 flow [2023-11-06 22:35:55,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:55,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:35:55,744 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-06 22:35:55,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:35:55,744 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:35:55,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:55,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1757903840, now seen corresponding path program 1 times [2023-11-06 22:35:55,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:55,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427980276] [2023-11-06 22:35:55,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:55,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,010 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-06 22:35:56,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:56,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427980276] [2023-11-06 22:35:56,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427980276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:56,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:56,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:35:56,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806646271] [2023-11-06 22:35:56,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:56,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:35:56,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:56,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:35:56,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:35:56,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 240 [2023-11-06 22:35:56,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 76 transitions, 690 flow. Second operand has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:56,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:35:56,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 240 [2023-11-06 22:35:56,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:35:56,747 INFO L124 PetriNetUnfolderBase]: 1992/3125 cut-off events. [2023-11-06 22:35:56,748 INFO L125 PetriNetUnfolderBase]: For 26340/26652 co-relation queries the response was YES. [2023-11-06 22:35:56,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16435 conditions, 3125 events. 1992/3125 cut-off events. For 26340/26652 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16880 event pairs, 302 based on Foata normal form. 394/3493 useless extension candidates. Maximal degree in co-relation 16400. Up to 1223 conditions per place. [2023-11-06 22:35:56,770 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 127 selfloop transitions, 13 changer transitions 0/147 dead transitions. [2023-11-06 22:35:56,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 147 transitions, 1678 flow [2023-11-06 22:35:56,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:35:56,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:35:56,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 628 transitions. [2023-11-06 22:35:56,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233333333333333 [2023-11-06 22:35:56,774 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 628 transitions. [2023-11-06 22:35:56,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 628 transitions. [2023-11-06 22:35:56,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:35:56,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 628 transitions. [2023-11-06 22:35:56,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:56,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:56,781 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:56,781 INFO L175 Difference]: Start difference. First operand has 77 places, 76 transitions, 690 flow. Second operand 5 states and 628 transitions. [2023-11-06 22:35:56,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 147 transitions, 1678 flow [2023-11-06 22:35:56,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 147 transitions, 1569 flow, removed 20 selfloop flow, removed 7 redundant places. [2023-11-06 22:35:56,834 INFO L231 Difference]: Finished difference. Result has 73 places, 72 transitions, 633 flow [2023-11-06 22:35:56,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=633, PETRI_PLACES=73, PETRI_TRANSITIONS=72} [2023-11-06 22:35:56,835 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2023-11-06 22:35:56,835 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 633 flow [2023-11-06 22:35:56,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:56,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:35:56,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:56,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:35:56,836 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:35:56,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:56,836 INFO L85 PathProgramCache]: Analyzing trace with hash 340900879, now seen corresponding path program 1 times [2023-11-06 22:35:56,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:56,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541637811] [2023-11-06 22:35:56,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:56,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:57,293 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-06 22:35:57,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:57,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541637811] [2023-11-06 22:35:57,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541637811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:57,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:57,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:35:57,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314872900] [2023-11-06 22:35:57,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:57,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:35:57,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:57,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:35:57,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:35:57,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 240 [2023-11-06 22:35:57,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 633 flow. Second operand has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:57,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:35:57,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 240 [2023-11-06 22:35:57,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:35:58,967 INFO L124 PetriNetUnfolderBase]: 5991/8968 cut-off events. [2023-11-06 22:35:58,967 INFO L125 PetriNetUnfolderBase]: For 59811/60265 co-relation queries the response was YES. [2023-11-06 22:35:58,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47456 conditions, 8968 events. 5991/8968 cut-off events. For 59811/60265 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 51365 event pairs, 949 based on Foata normal form. 470/9419 useless extension candidates. Maximal degree in co-relation 47423. Up to 4886 conditions per place. [2023-11-06 22:35:59,018 INFO L140 encePairwiseOnDemand]: 226/240 looper letters, 124 selfloop transitions, 36 changer transitions 93/256 dead transitions. [2023-11-06 22:35:59,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 256 transitions, 2707 flow [2023-11-06 22:35:59,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:35:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:35:59,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 822 transitions. [2023-11-06 22:35:59,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48928571428571427 [2023-11-06 22:35:59,022 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 822 transitions. [2023-11-06 22:35:59,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 822 transitions. [2023-11-06 22:35:59,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:35:59,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 822 transitions. [2023-11-06 22:35:59,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:59,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:59,030 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:59,030 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 633 flow. Second operand 7 states and 822 transitions. [2023-11-06 22:35:59,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 256 transitions, 2707 flow [2023-11-06 22:35:59,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 256 transitions, 2587 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-11-06 22:35:59,683 INFO L231 Difference]: Finished difference. Result has 82 places, 105 transitions, 1145 flow [2023-11-06 22:35:59,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1145, PETRI_PLACES=82, PETRI_TRANSITIONS=105} [2023-11-06 22:35:59,684 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 38 predicate places. [2023-11-06 22:35:59,684 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 105 transitions, 1145 flow [2023-11-06 22:35:59,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:59,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:35:59,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:59,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:35:59,685 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:35:59,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:59,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1987122157, now seen corresponding path program 2 times [2023-11-06 22:35:59,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:59,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722525031] [2023-11-06 22:35:59,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:59,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:59,925 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-06 22:35:59,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:59,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722525031] [2023-11-06 22:35:59,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722525031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:59,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:59,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:35:59,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091162472] [2023-11-06 22:35:59,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:59,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:35:59,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:59,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:35:59,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:35:59,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 240 [2023-11-06 22:35:59,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 105 transitions, 1145 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:59,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:35:59,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 240 [2023-11-06 22:35:59,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:36:00,978 INFO L124 PetriNetUnfolderBase]: 4107/6240 cut-off events. [2023-11-06 22:36:00,978 INFO L125 PetriNetUnfolderBase]: For 76043/77155 co-relation queries the response was YES. [2023-11-06 22:36:01,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40509 conditions, 6240 events. 4107/6240 cut-off events. For 76043/77155 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 37217 event pairs, 465 based on Foata normal form. 533/6497 useless extension candidates. Maximal degree in co-relation 40477. Up to 3643 conditions per place. [2023-11-06 22:36:01,014 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 117 selfloop transitions, 17 changer transitions 64/206 dead transitions. [2023-11-06 22:36:01,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 206 transitions, 2800 flow [2023-11-06 22:36:01,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:36:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:36:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 739 transitions. [2023-11-06 22:36:01,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5131944444444444 [2023-11-06 22:36:01,017 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 739 transitions. [2023-11-06 22:36:01,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 739 transitions. [2023-11-06 22:36:01,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:36:01,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 739 transitions. [2023-11-06 22:36:01,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:36:01,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:36:01,023 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:36:01,023 INFO L175 Difference]: Start difference. First operand has 82 places, 105 transitions, 1145 flow. Second operand 6 states and 739 transitions. [2023-11-06 22:36:01,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 206 transitions, 2800 flow [2023-11-06 22:36:01,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 206 transitions, 2428 flow, removed 130 selfloop flow, removed 5 redundant places. [2023-11-06 22:36:01,556 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 719 flow [2023-11-06 22:36:01,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=719, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2023-11-06 22:36:01,557 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 38 predicate places. [2023-11-06 22:36:01,557 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 719 flow [2023-11-06 22:36:01,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:36:01,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:36:01,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:01,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:36:01,558 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:36:01,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:01,559 INFO L85 PathProgramCache]: Analyzing trace with hash 279898969, now seen corresponding path program 1 times [2023-11-06 22:36:01,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:01,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789953925] [2023-11-06 22:36:01,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:01,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:01,837 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-06 22:36:01,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:01,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789953925] [2023-11-06 22:36:01,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789953925] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:01,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:01,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:36:01,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499165800] [2023-11-06 22:36:01,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:01,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:36:01,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:01,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:36:01,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:36:01,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 240 [2023-11-06 22:36:01,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 719 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:36:01,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:36:01,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 240 [2023-11-06 22:36:01,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:36:02,458 INFO L124 PetriNetUnfolderBase]: 2333/3620 cut-off events. [2023-11-06 22:36:02,459 INFO L125 PetriNetUnfolderBase]: For 27606/27906 co-relation queries the response was YES. [2023-11-06 22:36:02,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20768 conditions, 3620 events. 2333/3620 cut-off events. For 27606/27906 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19362 event pairs, 445 based on Foata normal form. 239/3835 useless extension candidates. Maximal degree in co-relation 20736. Up to 1757 conditions per place. [2023-11-06 22:36:02,475 INFO L140 encePairwiseOnDemand]: 236/240 looper letters, 51 selfloop transitions, 1 changer transitions 79/135 dead transitions. [2023-11-06 22:36:02,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 135 transitions, 1521 flow [2023-11-06 22:36:02,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:36:02,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:36:02,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2023-11-06 22:36:02,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-06 22:36:02,482 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 600 transitions. [2023-11-06 22:36:02,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 600 transitions. [2023-11-06 22:36:02,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:36:02,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 600 transitions. [2023-11-06 22:36:02,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:36:02,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:36:02,488 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:36:02,489 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 719 flow. Second operand 5 states and 600 transitions. [2023-11-06 22:36:02,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 135 transitions, 1521 flow [2023-11-06 22:36:02,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 135 transitions, 1343 flow, removed 54 selfloop flow, removed 11 redundant places. [2023-11-06 22:36:02,619 INFO L231 Difference]: Finished difference. Result has 76 places, 52 transitions, 377 flow [2023-11-06 22:36:02,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=377, PETRI_PLACES=76, PETRI_TRANSITIONS=52} [2023-11-06 22:36:02,619 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places. [2023-11-06 22:36:02,620 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 52 transitions, 377 flow [2023-11-06 22:36:02,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:36:02,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:36:02,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:02,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:36:02,622 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:36:02,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:02,622 INFO L85 PathProgramCache]: Analyzing trace with hash 658098403, now seen corresponding path program 2 times [2023-11-06 22:36:02,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:02,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743707462] [2023-11-06 22:36:02,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:02,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:36:02,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:36:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:36:02,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:36:02,811 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:36:02,813 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-06 22:36:02,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-06 22:36:02,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-06 22:36:02,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-06 22:36:02,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-06 22:36:02,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-06 22:36:02,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-06 22:36:02,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:36:02,821 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:02,828 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:36:02,828 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:36:02,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:36:02 BasicIcfg [2023-11-06 22:36:02,944 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:36:02,945 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:36:02,945 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:36:02,945 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:36:02,945 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:24" (3/4) ... [2023-11-06 22:36:02,946 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:36:03,082 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_030b502e-5b34-4de4-8ce9-0c4d18295150/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:36:03,082 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:36:03,083 INFO L158 Benchmark]: Toolchain (without parser) took 40421.25ms. Allocated memory was 132.1MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 86.0MB in the beginning and 791.0MB in the end (delta: -705.0MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-11-06 22:36:03,083 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 132.1MB. Free memory was 103.1MB in the beginning and 102.9MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:36:03,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 748.90ms. Allocated memory is still 132.1MB. Free memory was 86.0MB in the beginning and 61.8MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:36:03,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.07ms. Allocated memory is still 132.1MB. Free memory was 61.8MB in the beginning and 58.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:36:03,084 INFO L158 Benchmark]: Boogie Preprocessor took 77.12ms. Allocated memory is still 132.1MB. Free memory was 58.8MB in the beginning and 56.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:36:03,085 INFO L158 Benchmark]: RCFGBuilder took 935.15ms. Allocated memory was 132.1MB in the beginning and 186.6MB in the end (delta: 54.5MB). Free memory was 56.7MB in the beginning and 125.2MB in the end (delta: -68.5MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2023-11-06 22:36:03,085 INFO L158 Benchmark]: TraceAbstraction took 38422.22ms. Allocated memory was 186.6MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 124.1MB in the beginning and 805.7MB in the end (delta: -681.6MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-11-06 22:36:03,085 INFO L158 Benchmark]: Witness Printer took 137.42ms. Allocated memory is still 2.1GB. Free memory was 805.7MB in the beginning and 791.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:36:03,089 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.30ms. Allocated memory is still 132.1MB. Free memory was 103.1MB in the beginning and 102.9MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 748.90ms. Allocated memory is still 132.1MB. Free memory was 86.0MB in the beginning and 61.8MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.07ms. Allocated memory is still 132.1MB. Free memory was 61.8MB in the beginning and 58.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.12ms. Allocated memory is still 132.1MB. Free memory was 58.8MB in the beginning and 56.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 935.15ms. Allocated memory was 132.1MB in the beginning and 186.6MB in the end (delta: 54.5MB). Free memory was 56.7MB in the beginning and 125.2MB in the end (delta: -68.5MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * TraceAbstraction took 38422.22ms. Allocated memory was 186.6MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 124.1MB in the beginning and 805.7MB in the end (delta: -681.6MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 137.42ms. Allocated memory is still 2.1GB. Free memory was 805.7MB in the beginning and 791.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 138 PlacesBefore, 44 PlacesAfterwards, 127 TransitionsBefore, 32 TransitionsAfterwards, 3276 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 8624 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3472, independent: 3266, independent conditional: 0, independent unconditional: 3266, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1722, independent: 1686, independent conditional: 0, independent unconditional: 1686, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3472, independent: 1580, independent conditional: 0, independent unconditional: 1580, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 1722, unknown conditional: 0, unknown unconditional: 1722] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff0_thd4; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$r_buff1_thd4; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1481; [L847] FCALL, FORK 0 pthread_create(&t1481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1481, ((void *)0), P0, ((void *)0))=-3, t1481={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L848] 0 pthread_t t1482; [L849] FCALL, FORK 0 pthread_create(&t1482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1482, ((void *)0), P1, ((void *)0))=-2, t1481={5:0}, t1482={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L850] 0 pthread_t t1483; [L768] 2 x$w_buff1 = x$w_buff0 [L769] 2 x$w_buff0 = 2 [L770] 2 x$w_buff1_used = x$w_buff0_used [L771] 2 x$w_buff0_used = (_Bool)1 [L772] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L772] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L773] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L774] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L775] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L776] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L777] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t1483, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1483, ((void *)0), P2, ((void *)0))=-1, t1481={5:0}, t1482={6:0}, t1483={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L852] 0 pthread_t t1484; [L853] FCALL, FORK 0 pthread_create(&t1484, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1484, ((void *)0), P3, ((void *)0))=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L784] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L785] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L786] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L788] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L804] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L805] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L807] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L808] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L824] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 x$flush_delayed = weak$$choice2 [L869] 0 x$mem_tmp = x [L870] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L878] 0 x = x$flush_delayed ? x$mem_tmp : x [L879] 0 x$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 851]: 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: 849]: 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 167 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 38.2s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 25.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 980 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 822 mSDsluCounter, 506 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 389 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2832 IncrementalHoareTripleChecker+Invalid, 3021 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 117 mSDtfsCounter, 2832 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1145occurred in iteration=14, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 1630 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-06 22:36:03,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_030b502e-5b34-4de4-8ce9-0c4d18295150/bin/uautomizer-verify-WvqO1wxjHP/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