./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix001.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_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/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_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix001.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/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_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/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 54b7204af3591799bdde98d626e5c17b99e9c1ebc668ecbb3e0b1bb3bb8aa3c2 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:05:07,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:05:07,750 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:05:07,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:05:07,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:05:07,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:05:07,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:05:07,825 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:05:07,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:05:07,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:05:07,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:05:07,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:05:07,835 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:05:07,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:05:07,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:05:07,838 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:05:07,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:05:07,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:05:07,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:05:07,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:05:07,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:05:07,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:05:07,841 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:05:07,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:05:07,842 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:05:07,843 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:05:07,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:05:07,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:05:07,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:05:07,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:05:07,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:05:07,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:05:07,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:05:07,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:05:07,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:05:07,848 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:05:07,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:05:07,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:05:07,849 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:05:07,850 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_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/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_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/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 -> 54b7204af3591799bdde98d626e5c17b99e9c1ebc668ecbb3e0b1bb3bb8aa3c2 [2023-11-06 22:05:08,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:05:08,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:05:08,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:05:08,189 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:05:08,191 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:05:08,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix001.oepc.i [2023-11-06 22:05:11,288 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:05:11,640 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:05:11,641 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/sv-benchmarks/c/pthread-wmm/mix001.oepc.i [2023-11-06 22:05:11,664 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/bin/uautomizer-verify-WvqO1wxjHP/data/191022668/a538574e279a4908bf524346d848c96d/FLAG9e88cd046 [2023-11-06 22:05:11,689 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/bin/uautomizer-verify-WvqO1wxjHP/data/191022668/a538574e279a4908bf524346d848c96d [2023-11-06 22:05:11,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:05:11,703 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:05:11,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:05:11,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:05:11,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:05:11,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:05:11" (1/1) ... [2023-11-06 22:05:11,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41e9374f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:11, skipping insertion in model container [2023-11-06 22:05:11,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:05:11" (1/1) ... [2023-11-06 22:05:11,786 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:05:11,979 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_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/sv-benchmarks/c/pthread-wmm/mix001.oepc.i[988,1001] [2023-11-06 22:05:12,299 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:05:12,316 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:05:12,330 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_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/sv-benchmarks/c/pthread-wmm/mix001.oepc.i[988,1001] [2023-11-06 22:05:12,434 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:05:12,473 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:05:12,474 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:05:12,482 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:05:12,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:12 WrapperNode [2023-11-06 22:05:12,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:05:12,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:05:12,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:05:12,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:05:12,493 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:05:12" (1/1) ... [2023-11-06 22:05:12,518 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:05:12" (1/1) ... [2023-11-06 22:05:12,576 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2023-11-06 22:05:12,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:05:12,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:05:12,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:05:12,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:05:12,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:12" (1/1) ... [2023-11-06 22:05:12,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:12" (1/1) ... [2023-11-06 22:05:12,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:12" (1/1) ... [2023-11-06 22:05:12,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:12" (1/1) ... [2023-11-06 22:05:12,615 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:12" (1/1) ... [2023-11-06 22:05:12,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:12" (1/1) ... [2023-11-06 22:05:12,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:12" (1/1) ... [2023-11-06 22:05:12,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:12" (1/1) ... [2023-11-06 22:05:12,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:05:12,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:05:12,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:05:12,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:05:12,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:12" (1/1) ... [2023-11-06 22:05:12,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:05:12,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:05:12,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/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:05:12,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/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:05:12,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:05:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:05:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:05:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:05:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:05:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:05:12,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:05:12,731 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:05:12,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:05:12,731 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:05:12,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:05:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:05:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:05:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:05:12,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:05:12,734 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:05:12,928 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:05:12,930 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:05:13,352 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:05:13,611 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:05:13,612 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:05:13,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:05:13 BoogieIcfgContainer [2023-11-06 22:05:13,615 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:05:13,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:05:13,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:05:13,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:05:13,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:05:11" (1/3) ... [2023-11-06 22:05:13,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4b95c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:05:13, skipping insertion in model container [2023-11-06 22:05:13,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:12" (2/3) ... [2023-11-06 22:05:13,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4b95c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:05:13, skipping insertion in model container [2023-11-06 22:05:13,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:05:13" (3/3) ... [2023-11-06 22:05:13,630 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.oepc.i [2023-11-06 22:05:13,640 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:05:13,650 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:05:13,651 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:05:13,651 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:05:13,719 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:05:13,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 248 flow [2023-11-06 22:05:13,870 INFO L124 PetriNetUnfolderBase]: 2/115 cut-off events. [2023-11-06 22:05:13,870 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:05:13,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-11-06 22:05:13,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 248 flow [2023-11-06 22:05:13,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow [2023-11-06 22:05:13,895 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:05:13,912 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 239 flow [2023-11-06 22:05:13,918 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 239 flow [2023-11-06 22:05:13,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 239 flow [2023-11-06 22:05:13,953 INFO L124 PetriNetUnfolderBase]: 2/115 cut-off events. [2023-11-06 22:05:13,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:05:13,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-11-06 22:05:13,957 INFO L119 LiptonReduction]: Number of co-enabled transitions 2430 [2023-11-06 22:05:18,761 INFO L134 LiptonReduction]: Checked pairs total: 7264 [2023-11-06 22:05:18,761 INFO L136 LiptonReduction]: Total number of compositions: 100 [2023-11-06 22:05:18,778 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:05:18,784 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;@60a741a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:05:18,785 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-06 22:05:18,788 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:05:18,788 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-11-06 22:05:18,788 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:05:18,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:05:18,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:05:18,789 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:05:18,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:18,795 INFO L85 PathProgramCache]: Analyzing trace with hash 537025, now seen corresponding path program 1 times [2023-11-06 22:05:18,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:18,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329806689] [2023-11-06 22:05:18,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:18,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:19,329 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:05:19,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:19,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329806689] [2023-11-06 22:05:19,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329806689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:19,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:19,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:05:19,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006260863] [2023-11-06 22:05:19,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:19,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:05:19,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:19,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:05:19,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:05:19,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 218 [2023-11-06 22:05:19,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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:05:19,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:05:19,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 218 [2023-11-06 22:05:19,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:05:19,902 INFO L124 PetriNetUnfolderBase]: 1146/1817 cut-off events. [2023-11-06 22:05:19,902 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-06 22:05:19,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3571 conditions, 1817 events. 1146/1817 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10114 event pairs, 142 based on Foata normal form. 0/1708 useless extension candidates. Maximal degree in co-relation 3560. Up to 1445 conditions per place. [2023-11-06 22:05:19,927 INFO L140 encePairwiseOnDemand]: 214/218 looper letters, 32 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-11-06 22:05:19,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 40 transitions, 167 flow [2023-11-06 22:05:19,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:05:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:05:19,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-11-06 22:05:19,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321100917431193 [2023-11-06 22:05:19,952 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-11-06 22:05:19,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-11-06 22:05:19,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:05:19,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-11-06 22:05:19,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:05:19,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:19,972 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:19,974 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 348 transitions. [2023-11-06 22:05:19,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 40 transitions, 167 flow [2023-11-06 22:05:19,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:05:19,982 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 58 flow [2023-11-06 22:05:19,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-11-06 22:05:19,990 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2023-11-06 22:05:19,991 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 58 flow [2023-11-06 22:05:19,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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:05:19,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:05:19,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:05:19,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:05:19,993 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:05:20,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:20,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1135372368, now seen corresponding path program 1 times [2023-11-06 22:05:20,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:20,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279468172] [2023-11-06 22:05:20,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:20,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,393 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:05:20,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:20,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279468172] [2023-11-06 22:05:20,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279468172] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:20,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:20,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:05:20,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604568557] [2023-11-06 22:05:20,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:20,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:05:20,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:20,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:05:20,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:05:20,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 218 [2023-11-06 22:05:20,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states 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:05:20,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:05:20,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 218 [2023-11-06 22:05:20,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:05:20,737 INFO L124 PetriNetUnfolderBase]: 993/1503 cut-off events. [2023-11-06 22:05:20,738 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2023-11-06 22:05:20,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3141 conditions, 1503 events. 993/1503 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6818 event pairs, 337 based on Foata normal form. 40/1526 useless extension candidates. Maximal degree in co-relation 3131. Up to 1037 conditions per place. [2023-11-06 22:05:20,751 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 28 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-11-06 22:05:20,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 138 flow [2023-11-06 22:05:20,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:05:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:05:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2023-11-06 22:05:20,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152905198776758 [2023-11-06 22:05:20,754 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2023-11-06 22:05:20,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2023-11-06 22:05:20,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:05:20,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2023-11-06 22:05:20,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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:05:20,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:20,760 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:20,760 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 58 flow. Second operand 3 states and 337 transitions. [2023-11-06 22:05:20,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 138 flow [2023-11-06 22:05:20,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:05:20,762 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 62 flow [2023-11-06 22:05:20,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-11-06 22:05:20,764 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2023-11-06 22:05:20,764 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 62 flow [2023-11-06 22:05:20,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states 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:05:20,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:05:20,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:05:20,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:05:20,765 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:05:20,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:20,766 INFO L85 PathProgramCache]: Analyzing trace with hash -172660733, now seen corresponding path program 1 times [2023-11-06 22:05:20,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:20,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036477358] [2023-11-06 22:05:20,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:20,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:21,012 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:05:21,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:21,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036477358] [2023-11-06 22:05:21,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036477358] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:21,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:21,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:05:21,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776550281] [2023-11-06 22:05:21,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:21,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:05:21,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:21,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:05:21,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:05:21,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 218 [2023-11-06 22:05:21,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states 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:05:21,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:05:21,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 218 [2023-11-06 22:05:21,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:05:21,530 INFO L124 PetriNetUnfolderBase]: 1759/2588 cut-off events. [2023-11-06 22:05:21,531 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2023-11-06 22:05:21,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5579 conditions, 2588 events. 1759/2588 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 11683 event pairs, 503 based on Foata normal form. 48/2636 useless extension candidates. Maximal degree in co-relation 5568. Up to 1913 conditions per place. [2023-11-06 22:05:21,550 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 38 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-11-06 22:05:21,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 181 flow [2023-11-06 22:05:21,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:05:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:05:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-11-06 22:05:21,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4938837920489297 [2023-11-06 22:05:21,553 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-11-06 22:05:21,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-11-06 22:05:21,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:05:21,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-11-06 22:05:21,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states 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:05:21,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:21,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:21,558 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 62 flow. Second operand 3 states and 323 transitions. [2023-11-06 22:05:21,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 181 flow [2023-11-06 22:05:21,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 175 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:05:21,562 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 66 flow [2023-11-06 22:05:21,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-11-06 22:05:21,564 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2023-11-06 22:05:21,568 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 66 flow [2023-11-06 22:05:21,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states 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:05:21,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:05:21,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:05:21,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:05:21,570 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:05:21,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:21,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1047538017, now seen corresponding path program 1 times [2023-11-06 22:05:21,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:21,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548483863] [2023-11-06 22:05:21,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:21,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:21,908 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:05:21,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:21,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548483863] [2023-11-06 22:05:21,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548483863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:21,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:21,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:05:21,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978381976] [2023-11-06 22:05:21,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:21,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:05:21,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:21,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:05:21,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:05:21,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 218 [2023-11-06 22:05:21,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states 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:05:21,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:05:21,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 218 [2023-11-06 22:05:21,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:05:22,241 INFO L124 PetriNetUnfolderBase]: 939/1515 cut-off events. [2023-11-06 22:05:22,241 INFO L125 PetriNetUnfolderBase]: For 257/265 co-relation queries the response was YES. [2023-11-06 22:05:22,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3256 conditions, 1515 events. 939/1515 cut-off events. For 257/265 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7367 event pairs, 324 based on Foata normal form. 26/1527 useless extension candidates. Maximal degree in co-relation 3244. Up to 931 conditions per place. [2023-11-06 22:05:22,253 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 31 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2023-11-06 22:05:22,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 36 transitions, 161 flow [2023-11-06 22:05:22,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:05:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:05:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-11-06 22:05:22,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5198776758409785 [2023-11-06 22:05:22,255 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-11-06 22:05:22,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-11-06 22:05:22,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:05:22,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-11-06 22:05:22,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states 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:05:22,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:22,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:22,261 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 66 flow. Second operand 3 states and 340 transitions. [2023-11-06 22:05:22,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 36 transitions, 161 flow [2023-11-06 22:05:22,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 155 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:05:22,263 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 70 flow [2023-11-06 22:05:22,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-11-06 22:05:22,264 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2023-11-06 22:05:22,264 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 70 flow [2023-11-06 22:05:22,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states 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:05:22,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:05:22,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:05:22,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:05:22,266 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:05:22,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:22,266 INFO L85 PathProgramCache]: Analyzing trace with hash -27530189, now seen corresponding path program 1 times [2023-11-06 22:05:22,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:22,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082370976] [2023-11-06 22:05:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:22,468 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:05:22,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:22,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082370976] [2023-11-06 22:05:22,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082370976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:22,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:22,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:05:22,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271203410] [2023-11-06 22:05:22,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:22,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:05:22,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:22,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:05:22,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:05:22,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 218 [2023-11-06 22:05:22,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states 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:05:22,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:05:22,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 218 [2023-11-06 22:05:22,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:05:22,831 INFO L124 PetriNetUnfolderBase]: 610/1020 cut-off events. [2023-11-06 22:05:22,831 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2023-11-06 22:05:22,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2234 conditions, 1020 events. 610/1020 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4926 event pairs, 134 based on Foata normal form. 100/1109 useless extension candidates. Maximal degree in co-relation 2221. Up to 529 conditions per place. [2023-11-06 22:05:22,838 INFO L140 encePairwiseOnDemand]: 212/218 looper letters, 31 selfloop transitions, 4 changer transitions 23/62 dead transitions. [2023-11-06 22:05:22,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 62 transitions, 269 flow [2023-11-06 22:05:22,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:05:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:05:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 550 transitions. [2023-11-06 22:05:22,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045871559633027 [2023-11-06 22:05:22,843 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 550 transitions. [2023-11-06 22:05:22,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 550 transitions. [2023-11-06 22:05:22,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:05:22,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 550 transitions. [2023-11-06 22:05:22,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:22,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:22,851 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:22,851 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 70 flow. Second operand 5 states and 550 transitions. [2023-11-06 22:05:22,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 62 transitions, 269 flow [2023-11-06 22:05:22,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 62 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:05:22,854 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 102 flow [2023-11-06 22:05:22,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-11-06 22:05:22,855 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2023-11-06 22:05:22,856 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 102 flow [2023-11-06 22:05:22,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states 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:05:22,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:05:22,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:05:22,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:05:22,857 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:05:22,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:22,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1912624416, now seen corresponding path program 1 times [2023-11-06 22:05:22,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:22,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991452058] [2023-11-06 22:05:22,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:22,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:23,119 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:05:23,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:23,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991452058] [2023-11-06 22:05:23,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991452058] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:23,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:23,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:05:23,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288749950] [2023-11-06 22:05:23,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:23,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:05:23,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:23,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:05:23,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:05:23,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 218 [2023-11-06 22:05:23,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states 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:05:23,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:05:23,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 218 [2023-11-06 22:05:23,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:05:23,446 INFO L124 PetriNetUnfolderBase]: 314/580 cut-off events. [2023-11-06 22:05:23,446 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2023-11-06 22:05:23,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1589 conditions, 580 events. 314/580 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2636 event pairs, 100 based on Foata normal form. 52/621 useless extension candidates. Maximal degree in co-relation 1573. Up to 178 conditions per place. [2023-11-06 22:05:23,451 INFO L140 encePairwiseOnDemand]: 212/218 looper letters, 41 selfloop transitions, 7 changer transitions 23/75 dead transitions. [2023-11-06 22:05:23,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 75 transitions, 388 flow [2023-11-06 22:05:23,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:05:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:05:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 661 transitions. [2023-11-06 22:05:23,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053516819571865 [2023-11-06 22:05:23,455 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 661 transitions. [2023-11-06 22:05:23,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 661 transitions. [2023-11-06 22:05:23,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:05:23,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 661 transitions. [2023-11-06 22:05:23,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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:05:23,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:23,463 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:23,463 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 102 flow. Second operand 6 states and 661 transitions. [2023-11-06 22:05:23,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 75 transitions, 388 flow [2023-11-06 22:05:23,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 75 transitions, 382 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:05:23,469 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 152 flow [2023-11-06 22:05:23,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2023-11-06 22:05:23,470 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2023-11-06 22:05:23,470 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 152 flow [2023-11-06 22:05:23,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states 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:05:23,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:05:23,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:05:23,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:05:23,472 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:05:23,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:23,472 INFO L85 PathProgramCache]: Analyzing trace with hash 439981646, now seen corresponding path program 1 times [2023-11-06 22:05:23,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:23,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400403458] [2023-11-06 22:05:23,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:23,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:23,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:05:23,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:23,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400403458] [2023-11-06 22:05:23,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400403458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:23,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:23,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:05:23,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212086853] [2023-11-06 22:05:23,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:23,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:05:23,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:23,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:05:23,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:05:23,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 218 [2023-11-06 22:05:23,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states 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:05:23,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:05:23,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 218 [2023-11-06 22:05:23,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:05:24,027 INFO L124 PetriNetUnfolderBase]: 216/413 cut-off events. [2023-11-06 22:05:24,027 INFO L125 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2023-11-06 22:05:24,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 413 events. 216/413 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1764 event pairs, 97 based on Foata normal form. 12/414 useless extension candidates. Maximal degree in co-relation 1162. Up to 178 conditions per place. [2023-11-06 22:05:24,031 INFO L140 encePairwiseOnDemand]: 212/218 looper letters, 38 selfloop transitions, 10 changer transitions 12/64 dead transitions. [2023-11-06 22:05:24,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 64 transitions, 377 flow [2023-11-06 22:05:24,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:05:24,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:05:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 748 transitions. [2023-11-06 22:05:24,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49017038007863695 [2023-11-06 22:05:24,035 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 748 transitions. [2023-11-06 22:05:24,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 748 transitions. [2023-11-06 22:05:24,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:05:24,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 748 transitions. [2023-11-06 22:05:24,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 0 states have call successors, (0), 0 states 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:05:24,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:24,043 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:24,043 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 152 flow. Second operand 7 states and 748 transitions. [2023-11-06 22:05:24,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 64 transitions, 377 flow [2023-11-06 22:05:24,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 64 transitions, 326 flow, removed 17 selfloop flow, removed 7 redundant places. [2023-11-06 22:05:24,049 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 142 flow [2023-11-06 22:05:24,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2023-11-06 22:05:24,050 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2023-11-06 22:05:24,050 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 142 flow [2023-11-06 22:05:24,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states 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:05:24,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:05:24,051 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:05:24,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:05:24,052 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:05:24,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:24,052 INFO L85 PathProgramCache]: Analyzing trace with hash 43394691, now seen corresponding path program 1 times [2023-11-06 22:05:24,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:24,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186652365] [2023-11-06 22:05:24,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:24,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:26,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:05:26,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:26,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186652365] [2023-11-06 22:05:26,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186652365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:26,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:26,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:05:26,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633886051] [2023-11-06 22:05:26,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:26,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:05:26,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:26,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:05:26,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:05:26,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 218 [2023-11-06 22:05:26,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 142 flow. Second operand has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 0 states have call successors, (0), 0 states 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:05:26,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:05:26,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 218 [2023-11-06 22:05:26,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:05:27,357 INFO L124 PetriNetUnfolderBase]: 291/565 cut-off events. [2023-11-06 22:05:27,357 INFO L125 PetriNetUnfolderBase]: For 612/612 co-relation queries the response was YES. [2023-11-06 22:05:27,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1633 conditions, 565 events. 291/565 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2743 event pairs, 24 based on Foata normal form. 1/563 useless extension candidates. Maximal degree in co-relation 1616. Up to 147 conditions per place. [2023-11-06 22:05:27,362 INFO L140 encePairwiseOnDemand]: 210/218 looper letters, 78 selfloop transitions, 8 changer transitions 20/110 dead transitions. [2023-11-06 22:05:27,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 110 transitions, 762 flow [2023-11-06 22:05:27,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:05:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:05:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 945 transitions. [2023-11-06 22:05:27,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.481651376146789 [2023-11-06 22:05:27,367 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 945 transitions. [2023-11-06 22:05:27,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 945 transitions. [2023-11-06 22:05:27,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:05:27,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 945 transitions. [2023-11-06 22:05:27,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.0) internal successors, (945), 9 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:27,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 218.0) internal successors, (2180), 10 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:27,376 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 218.0) internal successors, (2180), 10 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:27,376 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 142 flow. Second operand 9 states and 945 transitions. [2023-11-06 22:05:27,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 110 transitions, 762 flow [2023-11-06 22:05:27,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 110 transitions, 628 flow, removed 36 selfloop flow, removed 6 redundant places. [2023-11-06 22:05:27,383 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 152 flow [2023-11-06 22:05:27,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=152, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2023-11-06 22:05:27,385 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2023-11-06 22:05:27,385 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 152 flow [2023-11-06 22:05:27,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 0 states have call successors, (0), 0 states 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:05:27,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:05:27,386 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:05:27,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:05:27,386 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:05:27,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:27,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1125047217, now seen corresponding path program 2 times [2023-11-06 22:05:27,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:27,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303181234] [2023-11-06 22:05:27,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:27,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:27,675 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:05:27,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:27,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303181234] [2023-11-06 22:05:27,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303181234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:27,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:27,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:05:27,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138208994] [2023-11-06 22:05:27,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:27,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:05:27,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:27,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:05:27,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:05:27,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 218 [2023-11-06 22:05:27,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states 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:05:27,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:05:27,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 218 [2023-11-06 22:05:27,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:05:27,956 INFO L124 PetriNetUnfolderBase]: 421/835 cut-off events. [2023-11-06 22:05:27,956 INFO L125 PetriNetUnfolderBase]: For 793/793 co-relation queries the response was YES. [2023-11-06 22:05:27,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2576 conditions, 835 events. 421/835 cut-off events. For 793/793 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4352 event pairs, 104 based on Foata normal form. 1/836 useless extension candidates. Maximal degree in co-relation 2562. Up to 421 conditions per place. [2023-11-06 22:05:27,961 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 39 selfloop transitions, 1 changer transitions 26/69 dead transitions. [2023-11-06 22:05:27,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 443 flow [2023-11-06 22:05:27,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:05:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:05:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 445 transitions. [2023-11-06 22:05:27,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5103211009174312 [2023-11-06 22:05:27,964 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 445 transitions. [2023-11-06 22:05:27,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 445 transitions. [2023-11-06 22:05:27,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:05:27,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 445 transitions. [2023-11-06 22:05:27,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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:05:27,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:27,969 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:27,969 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 152 flow. Second operand 4 states and 445 transitions. [2023-11-06 22:05:27,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 443 flow [2023-11-06 22:05:27,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 69 transitions, 423 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-11-06 22:05:27,978 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 139 flow [2023-11-06 22:05:27,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2023-11-06 22:05:27,980 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2023-11-06 22:05:27,980 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 139 flow [2023-11-06 22:05:27,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states 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:05:27,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:05:27,981 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:05:27,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:05:27,981 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:05:27,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:27,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1967989893, now seen corresponding path program 3 times [2023-11-06 22:05:27,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:27,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679248135] [2023-11-06 22:05:27,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:27,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,303 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:05:28,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:28,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679248135] [2023-11-06 22:05:28,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679248135] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:28,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:28,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:05:28,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848652418] [2023-11-06 22:05:28,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:28,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:05:28,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:28,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:05:28,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:05:28,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 218 [2023-11-06 22:05:28,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:05:28,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:05:28,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 218 [2023-11-06 22:05:28,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:05:28,672 INFO L124 PetriNetUnfolderBase]: 538/1004 cut-off events. [2023-11-06 22:05:28,673 INFO L125 PetriNetUnfolderBase]: For 954/954 co-relation queries the response was YES. [2023-11-06 22:05:28,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3099 conditions, 1004 events. 538/1004 cut-off events. For 954/954 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4836 event pairs, 71 based on Foata normal form. 1/1005 useless extension candidates. Maximal degree in co-relation 3085. Up to 513 conditions per place. [2023-11-06 22:05:28,678 INFO L140 encePairwiseOnDemand]: 210/218 looper letters, 52 selfloop transitions, 8 changer transitions 19/79 dead transitions. [2023-11-06 22:05:28,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 498 flow [2023-11-06 22:05:28,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:05:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:05:28,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2023-11-06 22:05:28,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47522935779816516 [2023-11-06 22:05:28,682 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2023-11-06 22:05:28,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2023-11-06 22:05:28,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:05:28,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2023-11-06 22:05:28,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states 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:05:28,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:28,690 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:28,690 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 139 flow. Second operand 5 states and 518 transitions. [2023-11-06 22:05:28,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 498 flow [2023-11-06 22:05:28,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 79 transitions, 492 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:05:28,702 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 199 flow [2023-11-06 22:05:28,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-11-06 22:05:28,705 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2023-11-06 22:05:28,705 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 199 flow [2023-11-06 22:05:28,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:05:28,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:05:28,707 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:05:28,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:05:28,707 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:05:28,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:28,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1851921051, now seen corresponding path program 4 times [2023-11-06 22:05:28,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:28,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232994] [2023-11-06 22:05:28,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:28,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:30,595 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:05:30,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:30,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232994] [2023-11-06 22:05:30,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:30,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:30,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:05:30,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921342298] [2023-11-06 22:05:30,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:30,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:05:30,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:30,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:05:30,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:05:30,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 218 [2023-11-06 22:05:30,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 199 flow. Second operand has 8 states, 8 states have (on average 100.5) internal successors, (804), 8 states have internal predecessors, (804), 0 states have call successors, (0), 0 states 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:05:30,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:05:30,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 218 [2023-11-06 22:05:30,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:05:31,424 INFO L124 PetriNetUnfolderBase]: 373/801 cut-off events. [2023-11-06 22:05:31,425 INFO L125 PetriNetUnfolderBase]: For 1147/1189 co-relation queries the response was YES. [2023-11-06 22:05:31,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2819 conditions, 801 events. 373/801 cut-off events. For 1147/1189 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4393 event pairs, 51 based on Foata normal form. 29/818 useless extension candidates. Maximal degree in co-relation 2798. Up to 207 conditions per place. [2023-11-06 22:05:31,430 INFO L140 encePairwiseOnDemand]: 209/218 looper letters, 58 selfloop transitions, 9 changer transitions 47/120 dead transitions. [2023-11-06 22:05:31,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 120 transitions, 825 flow [2023-11-06 22:05:31,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:05:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:05:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1060 transitions. [2023-11-06 22:05:31,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48623853211009177 [2023-11-06 22:05:31,436 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1060 transitions. [2023-11-06 22:05:31,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1060 transitions. [2023-11-06 22:05:31,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:05:31,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1060 transitions. [2023-11-06 22:05:31,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:05:31,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 218.0) internal successors, (2398), 11 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states 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:05:31,446 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 218.0) internal successors, (2398), 11 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states 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:05:31,446 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 199 flow. Second operand 10 states and 1060 transitions. [2023-11-06 22:05:31,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 120 transitions, 825 flow [2023-11-06 22:05:31,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 120 transitions, 825 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:05:31,455 INFO L231 Difference]: Finished difference. Result has 63 places, 39 transitions, 231 flow [2023-11-06 22:05:31,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=231, PETRI_PLACES=63, PETRI_TRANSITIONS=39} [2023-11-06 22:05:31,456 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2023-11-06 22:05:31,456 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 39 transitions, 231 flow [2023-11-06 22:05:31,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.5) internal successors, (804), 8 states have internal predecessors, (804), 0 states have call successors, (0), 0 states 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:05:31,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:05:31,457 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:05:31,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:05:31,458 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:05:31,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:31,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1544196783, now seen corresponding path program 5 times [2023-11-06 22:05:31,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:31,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875273300] [2023-11-06 22:05:31,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:31,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,721 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:05:31,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:31,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875273300] [2023-11-06 22:05:31,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875273300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:31,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:31,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:05:31,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915285817] [2023-11-06 22:05:31,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:31,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:05:31,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:31,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:05:31,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:05:31,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 218 [2023-11-06 22:05:31,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 39 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states 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:05:31,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:05:31,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 218 [2023-11-06 22:05:31,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:05:31,970 INFO L124 PetriNetUnfolderBase]: 343/746 cut-off events. [2023-11-06 22:05:31,970 INFO L125 PetriNetUnfolderBase]: For 1564/1572 co-relation queries the response was YES. [2023-11-06 22:05:31,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2879 conditions, 746 events. 343/746 cut-off events. For 1564/1572 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3964 event pairs, 152 based on Foata normal form. 5/737 useless extension candidates. Maximal degree in co-relation 2858. Up to 270 conditions per place. [2023-11-06 22:05:31,975 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 31 selfloop transitions, 1 changer transitions 35/70 dead transitions. [2023-11-06 22:05:31,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 70 transitions, 560 flow [2023-11-06 22:05:31,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:05:31,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:05:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 441 transitions. [2023-11-06 22:05:31,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057339449541285 [2023-11-06 22:05:31,978 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 441 transitions. [2023-11-06 22:05:31,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 441 transitions. [2023-11-06 22:05:31,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:05:31,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 441 transitions. [2023-11-06 22:05:31,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:05:31,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:31,983 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:31,983 INFO L175 Difference]: Start difference. First operand has 63 places, 39 transitions, 231 flow. Second operand 4 states and 441 transitions. [2023-11-06 22:05:31,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 70 transitions, 560 flow [2023-11-06 22:05:31,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 70 transitions, 509 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-11-06 22:05:31,991 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 169 flow [2023-11-06 22:05:31,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=57, PETRI_TRANSITIONS=33} [2023-11-06 22:05:31,993 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-11-06 22:05:31,994 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 33 transitions, 169 flow [2023-11-06 22:05:31,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states 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:05:31,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:05:31,995 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:05:31,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:05:31,996 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:05:31,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:31,997 INFO L85 PathProgramCache]: Analyzing trace with hash 627734151, now seen corresponding path program 6 times [2023-11-06 22:05:31,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:31,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778943348] [2023-11-06 22:05:31,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:31,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:05:32,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:05:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:05:32,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:05:32,238 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:05:32,239 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-06 22:05:32,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-06 22:05:32,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-06 22:05:32,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-06 22:05:32,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-06 22:05:32,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-06 22:05:32,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:05:32,243 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:05:32,250 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:05:32,250 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:05:32,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:05:32 BasicIcfg [2023-11-06 22:05:32,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:05:32,375 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:05:32,375 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:05:32,375 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:05:32,376 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:05:13" (3/4) ... [2023-11-06 22:05:32,376 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:05:32,492 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:05:32,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:05:32,493 INFO L158 Benchmark]: Toolchain (without parser) took 20790.13ms. Allocated memory was 161.5MB in the beginning and 358.6MB in the end (delta: 197.1MB). Free memory was 125.7MB in the beginning and 295.3MB in the end (delta: -169.6MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2023-11-06 22:05:32,493 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:05:32,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 776.44ms. Allocated memory is still 161.5MB. Free memory was 125.1MB in the beginning and 100.1MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:05:32,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.87ms. Allocated memory is still 161.5MB. Free memory was 100.1MB in the beginning and 97.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:05:32,494 INFO L158 Benchmark]: Boogie Preprocessor took 65.13ms. Allocated memory is still 161.5MB. Free memory was 97.7MB in the beginning and 95.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:05:32,495 INFO L158 Benchmark]: RCFGBuilder took 972.78ms. Allocated memory is still 161.5MB. Free memory was 95.6MB in the beginning and 126.5MB in the end (delta: -30.8MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2023-11-06 22:05:32,495 INFO L158 Benchmark]: TraceAbstraction took 18755.04ms. Allocated memory was 161.5MB in the beginning and 358.6MB in the end (delta: 197.1MB). Free memory was 126.1MB in the beginning and 306.8MB in the end (delta: -180.7MB). Peak memory consumption was 212.6MB. Max. memory is 16.1GB. [2023-11-06 22:05:32,495 INFO L158 Benchmark]: Witness Printer took 117.40ms. Allocated memory is still 358.6MB. Free memory was 306.8MB in the beginning and 295.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:05:32,497 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.29ms. Allocated memory is still 117.4MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 776.44ms. Allocated memory is still 161.5MB. Free memory was 125.1MB in the beginning and 100.1MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.87ms. Allocated memory is still 161.5MB. Free memory was 100.1MB in the beginning and 97.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.13ms. Allocated memory is still 161.5MB. Free memory was 97.7MB in the beginning and 95.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 972.78ms. Allocated memory is still 161.5MB. Free memory was 95.6MB in the beginning and 126.5MB in the end (delta: -30.8MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18755.04ms. Allocated memory was 161.5MB in the beginning and 358.6MB in the end (delta: 197.1MB). Free memory was 126.1MB in the beginning and 306.8MB in the end (delta: -180.7MB). Peak memory consumption was 212.6MB. Max. memory is 16.1GB. * Witness Printer took 117.40ms. Allocated memory is still 358.6MB. Free memory was 306.8MB in the beginning and 295.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 123 PlacesBefore, 36 PlacesAfterwards, 115 TransitionsBefore, 27 TransitionsAfterwards, 2430 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 100 TotalNumberOfCompositions, 7264 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3022, independent: 2788, independent conditional: 0, independent unconditional: 2788, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1328, independent: 1282, independent conditional: 0, independent unconditional: 1282, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3022, independent: 1506, independent conditional: 0, independent unconditional: 1506, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 1328, unknown conditional: 0, unknown unconditional: 1328] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 106, Positive conditional cache size: 0, Positive unconditional cache size: 106, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: 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_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L720] 0 int __unbuffered_p2_EAX = 0; [L722] 0 int __unbuffered_p2_EBX = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff1_thd0; [L738] 0 _Bool z$r_buff1_thd1; [L739] 0 _Bool z$r_buff1_thd2; [L740] 0 _Bool z$r_buff1_thd3; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t14; [L865] FCALL, FORK 0 pthread_create(&t14, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t14, ((void *)0), P0, ((void *)0))=-1, t14={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L866] 0 pthread_t t15; [L752] 1 z$w_buff1 = z$w_buff0 [L753] 1 z$w_buff0 = 1 [L754] 1 z$w_buff1_used = z$w_buff0_used [L755] 1 z$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L757] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L758] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L759] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L760] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L761] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L867] FCALL, FORK 0 pthread_create(&t15, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t15, ((void *)0), P1, ((void *)0))=0, t14={5:0}, t15={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 z$flush_delayed = weak$$choice2 [L767] 1 z$mem_tmp = z [L768] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX = z [L776] 1 z = z$flush_delayed ? z$mem_tmp : z [L777] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L797] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L803] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L868] 0 pthread_t t16; [L869] FCALL, FORK 0 pthread_create(&t16, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t16, ((void *)0), P2, ((void *)0))=1, t14={5:0}, t15={6:0}, t16={3:0}, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 3 z$flush_delayed = weak$$choice2 [L829] 3 z$mem_tmp = z [L830] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L831] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L832] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L833] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L834] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L835] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L836] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L837] 3 __unbuffered_p2_EBX = z [L838] 3 z = z$flush_delayed ? z$mem_tmp : z [L839] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L784] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L785] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L786] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L787] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L842] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L843] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L844] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L845] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L846] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 1 return 0; [L806] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L807] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L808] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L809] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 3 return 0; [L813] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 2 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L876] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L877] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L878] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L879] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t14={5:0}, t15={6:0}, t16={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 19]: 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: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 602 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 456 mSDsluCounter, 410 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 298 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1489 IncrementalHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 112 mSDtfsCounter, 1489 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=231occurred in iteration=11, InterpolantAutomatonStates: 62, 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, 6.6s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 1787 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:05:32,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b265f5-8167-4ea0-9c46-65f02f6a9cb8/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