./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_179da14f-c785-466a-a5a5-b60af6bf1cff/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_179da14f-c785-466a-a5a5-b60af6bf1cff/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_179da14f-c785-466a-a5a5-b60af6bf1cff/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_179da14f-c785-466a-a5a5-b60af6bf1cff/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_179da14f-c785-466a-a5a5-b60af6bf1cff/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_179da14f-c785-466a-a5a5-b60af6bf1cff/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 e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:56:42,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:56:42,973 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_179da14f-c785-466a-a5a5-b60af6bf1cff/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:56:42,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:56:42,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:56:43,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:56:43,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:56:43,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:56:43,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:56:43,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:56:43,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:56:43,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:56:43,037 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:56:43,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:56:43,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:56:43,040 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:56:43,040 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:56:43,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:56:43,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:56:43,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:56:43,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:56:43,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:56:43,043 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:56:43,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:56:43,044 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:56:43,045 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:56:43,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:56:43,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:56:43,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:56:43,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:56:43,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:56:43,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:56:43,049 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:56:43,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:56:43,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:56:43,049 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:56:43,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:56:43,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:56:43,050 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:56:43,050 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_179da14f-c785-466a-a5a5-b60af6bf1cff/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_179da14f-c785-466a-a5a5-b60af6bf1cff/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 -> e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da [2023-11-06 22:56:43,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:56:43,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:56:43,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:56:43,360 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:56:43,361 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:56:43,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_179da14f-c785-466a-a5a5-b60af6bf1cff/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2023-11-06 22:56:46,462 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:56:46,832 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:56:46,834 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_179da14f-c785-466a-a5a5-b60af6bf1cff/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2023-11-06 22:56:46,866 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_179da14f-c785-466a-a5a5-b60af6bf1cff/bin/uautomizer-verify-WvqO1wxjHP/data/3b2969965/9f4af965a10343328af360240dccccba/FLAG72027e752 [2023-11-06 22:56:46,887 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_179da14f-c785-466a-a5a5-b60af6bf1cff/bin/uautomizer-verify-WvqO1wxjHP/data/3b2969965/9f4af965a10343328af360240dccccba [2023-11-06 22:56:46,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:56:46,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:56:46,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:56:46,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:56:46,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:56:46,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:56:46" (1/1) ... [2023-11-06 22:56:46,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789e00f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:46, skipping insertion in model container [2023-11-06 22:56:46,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:56:46" (1/1) ... [2023-11-06 22:56:46,982 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:56:47,209 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_179da14f-c785-466a-a5a5-b60af6bf1cff/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i[949,962] [2023-11-06 22:56:47,462 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:56:47,486 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:56:47,503 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_179da14f-c785-466a-a5a5-b60af6bf1cff/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i[949,962] [2023-11-06 22:56:47,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:56:47,629 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:56:47,629 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:56:47,637 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:56:47,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:47 WrapperNode [2023-11-06 22:56:47,638 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:56:47,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:56:47,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:56:47,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:56:47,649 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:56:47" (1/1) ... [2023-11-06 22:56:47,690 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:56:47" (1/1) ... [2023-11-06 22:56:47,738 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 154 [2023-11-06 22:56:47,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:56:47,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:56:47,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:56:47,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:56:47,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:47" (1/1) ... [2023-11-06 22:56:47,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:47" (1/1) ... [2023-11-06 22:56:47,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:47" (1/1) ... [2023-11-06 22:56:47,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:47" (1/1) ... [2023-11-06 22:56:47,784 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:47" (1/1) ... [2023-11-06 22:56:47,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:47" (1/1) ... [2023-11-06 22:56:47,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:47" (1/1) ... [2023-11-06 22:56:47,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:47" (1/1) ... [2023-11-06 22:56:47,809 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:56:47,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:56:47,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:56:47,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:56:47,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:47" (1/1) ... [2023-11-06 22:56:47,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:56:47,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_179da14f-c785-466a-a5a5-b60af6bf1cff/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:56:47,859 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_179da14f-c785-466a-a5a5-b60af6bf1cff/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:56:47,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_179da14f-c785-466a-a5a5-b60af6bf1cff/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:56:47,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:56:47,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:56:47,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:56:47,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:56:47,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:56:47,917 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:56:47,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:56:47,918 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:56:47,918 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:56:47,918 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:56:47,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:56:47,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:56:47,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:56:47,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:56:47,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:56:47,924 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:56:48,132 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:56:48,134 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:56:48,464 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:56:48,735 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:56:48,736 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:56:48,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:56:48 BoogieIcfgContainer [2023-11-06 22:56:48,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:56:48,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:56:48,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:56:48,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:56:48,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:56:46" (1/3) ... [2023-11-06 22:56:48,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19aba058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:56:48, skipping insertion in model container [2023-11-06 22:56:48,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:47" (2/3) ... [2023-11-06 22:56:48,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19aba058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:56:48, skipping insertion in model container [2023-11-06 22:56:48,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:56:48" (3/3) ... [2023-11-06 22:56:48,749 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2023-11-06 22:56:48,758 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:56:48,769 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:56:48,770 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:56:48,770 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:56:48,828 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:56:48,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 250 flow [2023-11-06 22:56:48,928 INFO L124 PetriNetUnfolderBase]: 2/116 cut-off events. [2023-11-06 22:56:48,928 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:56:48,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-11-06 22:56:48,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 250 flow [2023-11-06 22:56:48,940 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2023-11-06 22:56:48,944 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:56:48,954 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 241 flow [2023-11-06 22:56:48,956 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 241 flow [2023-11-06 22:56:48,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 241 flow [2023-11-06 22:56:48,989 INFO L124 PetriNetUnfolderBase]: 2/116 cut-off events. [2023-11-06 22:56:48,990 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:56:48,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-11-06 22:56:48,994 INFO L119 LiptonReduction]: Number of co-enabled transitions 2498 [2023-11-06 22:56:54,056 INFO L134 LiptonReduction]: Checked pairs total: 6160 [2023-11-06 22:56:54,057 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-11-06 22:56:54,086 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:56:54,099 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;@7e859e5e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:56:54,100 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-06 22:56:54,107 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:56:54,107 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-06 22:56:54,107 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:56:54,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:54,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:56:54,109 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:54,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:54,115 INFO L85 PathProgramCache]: Analyzing trace with hash 486529155, now seen corresponding path program 1 times [2023-11-06 22:56:54,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:54,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087655321] [2023-11-06 22:56:54,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:54,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:54,679 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:56:54,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:54,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087655321] [2023-11-06 22:56:54,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087655321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:54,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:54,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:56:54,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331029950] [2023-11-06 22:56:54,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:54,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:56:54,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:54,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:56:54,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:56:54,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 218 [2023-11-06 22:56:54,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states 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:56:54,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:54,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 218 [2023-11-06 22:56:54,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:55,231 INFO L124 PetriNetUnfolderBase]: 1277/1964 cut-off events. [2023-11-06 22:56:55,232 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-06 22:56:55,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3905 conditions, 1964 events. 1277/1964 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9852 event pairs, 333 based on Foata normal form. 80/1859 useless extension candidates. Maximal degree in co-relation 3894. Up to 1593 conditions per place. [2023-11-06 22:56:55,257 INFO L140 encePairwiseOnDemand]: 214/218 looper letters, 30 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2023-11-06 22:56:55,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 164 flow [2023-11-06 22:56:55,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:56:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:56:55,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-11-06 22:56:55,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5412844036697247 [2023-11-06 22:56:55,281 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-11-06 22:56:55,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-11-06 22:56:55,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:55,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-11-06 22:56:55,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states 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:56:55,301 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:56:55,302 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:56:55,305 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 354 transitions. [2023-11-06 22:56:55,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 164 flow [2023-11-06 22:56:55,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:56:55,311 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2023-11-06 22:56:55,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-11-06 22:56:55,318 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2023-11-06 22:56:55,319 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2023-11-06 22:56:55,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states 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:56:55,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:55,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:55,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:56:55,321 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:55,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:55,331 INFO L85 PathProgramCache]: Analyzing trace with hash -59662372, now seen corresponding path program 1 times [2023-11-06 22:56:55,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:55,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921334210] [2023-11-06 22:56:55,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:55,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:56,096 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:56:56,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:56,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921334210] [2023-11-06 22:56:56,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921334210] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:56,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:56,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:56:56,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153189355] [2023-11-06 22:56:56,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:56,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:56:56,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:56,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:56:56,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:56:56,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 218 [2023-11-06 22:56:56,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:56,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:56,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 218 [2023-11-06 22:56:56,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:56,802 INFO L124 PetriNetUnfolderBase]: 1683/2510 cut-off events. [2023-11-06 22:56:56,803 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2023-11-06 22:56:56,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5216 conditions, 2510 events. 1683/2510 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11574 event pairs, 479 based on Foata normal form. 144/2653 useless extension candidates. Maximal degree in co-relation 5206. Up to 1577 conditions per place. [2023-11-06 22:56:56,823 INFO L140 encePairwiseOnDemand]: 214/218 looper letters, 31 selfloop transitions, 2 changer transitions 22/56 dead transitions. [2023-11-06 22:56:56,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 56 transitions, 238 flow [2023-11-06 22:56:56,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:56:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:56:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-11-06 22:56:56,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4651376146788991 [2023-11-06 22:56:56,827 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-11-06 22:56:56,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-11-06 22:56:56,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:56,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-11-06 22:56:56,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states 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:56:56,834 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:56:56,835 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:56:56,835 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 507 transitions. [2023-11-06 22:56:56,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 56 transitions, 238 flow [2023-11-06 22:56:56,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 56 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:56:56,839 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 66 flow [2023-11-06 22:56:56,839 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=5, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2023-11-06 22:56:56,840 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2023-11-06 22:56:56,840 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 66 flow [2023-11-06 22:56:56,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:56,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:56,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:56,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:56:56,842 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:56,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:56,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1714774640, now seen corresponding path program 1 times [2023-11-06 22:56:56,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:56,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736817829] [2023-11-06 22:56:56,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:56,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:57,359 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:56:57,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:57,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736817829] [2023-11-06 22:56:57,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736817829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:57,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:57,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:56:57,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761997902] [2023-11-06 22:56:57,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:57,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:56:57,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:57,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:56:57,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:56:57,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 218 [2023-11-06 22:56:57,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states 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:56:57,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:57,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 218 [2023-11-06 22:56:57,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:57,963 INFO L124 PetriNetUnfolderBase]: 1431/2146 cut-off events. [2023-11-06 22:56:57,963 INFO L125 PetriNetUnfolderBase]: For 440/440 co-relation queries the response was YES. [2023-11-06 22:56:57,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4723 conditions, 2146 events. 1431/2146 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9896 event pairs, 375 based on Foata normal form. 96/2241 useless extension candidates. Maximal degree in co-relation 4710. Up to 1441 conditions per place. [2023-11-06 22:56:57,980 INFO L140 encePairwiseOnDemand]: 214/218 looper letters, 33 selfloop transitions, 2 changer transitions 18/54 dead transitions. [2023-11-06 22:56:57,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 239 flow [2023-11-06 22:56:57,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:56:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:56:57,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2023-11-06 22:56:57,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.463302752293578 [2023-11-06 22:56:57,983 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2023-11-06 22:56:57,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2023-11-06 22:56:57,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:57,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2023-11-06 22:56:57,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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:56:57,989 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:56:57,990 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:56:57,990 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 66 flow. Second operand 5 states and 505 transitions. [2023-11-06 22:56:57,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 239 flow [2023-11-06 22:56:58,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 54 transitions, 229 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-06 22:56:58,002 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 70 flow [2023-11-06 22:56:58,002 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=5, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2023-11-06 22:56:58,003 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2023-11-06 22:56:58,003 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 70 flow [2023-11-06 22:56:58,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states 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:56:58,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:58,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:58,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:56:58,005 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:58,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:58,006 INFO L85 PathProgramCache]: Analyzing trace with hash 522892480, now seen corresponding path program 1 times [2023-11-06 22:56:58,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:58,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202162043] [2023-11-06 22:56:58,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:58,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:59,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:59,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202162043] [2023-11-06 22:56:59,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202162043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:59,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:59,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:56:59,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493590773] [2023-11-06 22:56:59,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:59,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:56:59,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:59,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:56:59,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:56:59,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 218 [2023-11-06 22:56:59,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 70 flow. Second operand has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states 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:56:59,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:59,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 218 [2023-11-06 22:56:59,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:59,565 INFO L124 PetriNetUnfolderBase]: 989/1583 cut-off events. [2023-11-06 22:56:59,566 INFO L125 PetriNetUnfolderBase]: For 307/307 co-relation queries the response was YES. [2023-11-06 22:56:59,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3512 conditions, 1583 events. 989/1583 cut-off events. For 307/307 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7794 event pairs, 236 based on Foata normal form. 49/1621 useless extension candidates. Maximal degree in co-relation 3498. Up to 1190 conditions per place. [2023-11-06 22:56:59,579 INFO L140 encePairwiseOnDemand]: 211/218 looper letters, 38 selfloop transitions, 6 changer transitions 14/61 dead transitions. [2023-11-06 22:56:59,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 61 transitions, 273 flow [2023-11-06 22:56:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:56:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:56:59,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 666 transitions. [2023-11-06 22:56:59,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5091743119266054 [2023-11-06 22:56:59,583 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 666 transitions. [2023-11-06 22:56:59,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 666 transitions. [2023-11-06 22:56:59,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:59,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 666 transitions. [2023-11-06 22:56:59,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states 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:56:59,590 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:56:59,591 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:56:59,591 INFO L175 Difference]: Start difference. First operand has 39 places, 24 transitions, 70 flow. Second operand 6 states and 666 transitions. [2023-11-06 22:56:59,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 61 transitions, 273 flow [2023-11-06 22:56:59,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 61 transitions, 263 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-06 22:56:59,600 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 109 flow [2023-11-06 22:56:59,601 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=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=109, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-06 22:56:59,602 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2023-11-06 22:56:59,603 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 109 flow [2023-11-06 22:56:59,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states 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:56:59,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:59,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:59,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:56:59,605 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:56:59,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:59,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1346382060, now seen corresponding path program 1 times [2023-11-06 22:56:59,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:59,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304862997] [2023-11-06 22:56:59,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:59,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:00,168 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:57:00,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:57:00,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304862997] [2023-11-06 22:57:00,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304862997] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:00,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:00,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:57:00,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835801570] [2023-11-06 22:57:00,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:00,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:57:00,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:57:00,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:57:00,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:57:00,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 218 [2023-11-06 22:57:00,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 109 flow. Second operand has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:57:00,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:57:00,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 218 [2023-11-06 22:57:00,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:57:00,734 INFO L124 PetriNetUnfolderBase]: 1165/1824 cut-off events. [2023-11-06 22:57:00,734 INFO L125 PetriNetUnfolderBase]: For 1181/1212 co-relation queries the response was YES. [2023-11-06 22:57:00,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4845 conditions, 1824 events. 1165/1824 cut-off events. For 1181/1212 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8733 event pairs, 697 based on Foata normal form. 41/1821 useless extension candidates. Maximal degree in co-relation 4829. Up to 1429 conditions per place. [2023-11-06 22:57:00,752 INFO L140 encePairwiseOnDemand]: 209/218 looper letters, 39 selfloop transitions, 13 changer transitions 11/66 dead transitions. [2023-11-06 22:57:00,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 66 transitions, 367 flow [2023-11-06 22:57:00,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:57:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:57:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 746 transitions. [2023-11-06 22:57:00,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888597640891219 [2023-11-06 22:57:00,756 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 746 transitions. [2023-11-06 22:57:00,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 746 transitions. [2023-11-06 22:57:00,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:57:00,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 746 transitions. [2023-11-06 22:57:00,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 0 states have call successors, (0), 0 states 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:57:00,763 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:57:00,764 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:57:00,764 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 109 flow. Second operand 7 states and 746 transitions. [2023-11-06 22:57:00,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 66 transitions, 367 flow [2023-11-06 22:57:00,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 363 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-06 22:57:00,770 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 206 flow [2023-11-06 22:57:00,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=206, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-11-06 22:57:00,773 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2023-11-06 22:57:00,773 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 206 flow [2023-11-06 22:57:00,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:57:00,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:57:00,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:00,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:57:00,774 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:57:00,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:00,775 INFO L85 PathProgramCache]: Analyzing trace with hash -811381026, now seen corresponding path program 2 times [2023-11-06 22:57:00,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:57:00,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293436721] [2023-11-06 22:57:00,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:00,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:57:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:01,665 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:57:01,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:57:01,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293436721] [2023-11-06 22:57:01,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293436721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:01,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:01,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:57:01,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907934813] [2023-11-06 22:57:01,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:01,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:57:01,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:57:01,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:57:01,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:57:01,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 218 [2023-11-06 22:57:01,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 206 flow. Second operand has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:57:01,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:57:01,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 218 [2023-11-06 22:57:01,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:57:02,653 INFO L124 PetriNetUnfolderBase]: 2427/3600 cut-off events. [2023-11-06 22:57:02,653 INFO L125 PetriNetUnfolderBase]: For 4549/4549 co-relation queries the response was YES. [2023-11-06 22:57:02,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11288 conditions, 3600 events. 2427/3600 cut-off events. For 4549/4549 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 17084 event pairs, 268 based on Foata normal form. 68/3668 useless extension candidates. Maximal degree in co-relation 11267. Up to 2100 conditions per place. [2023-11-06 22:57:02,688 INFO L140 encePairwiseOnDemand]: 210/218 looper letters, 63 selfloop transitions, 21 changer transitions 17/101 dead transitions. [2023-11-06 22:57:02,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 101 transitions, 664 flow [2023-11-06 22:57:02,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:57:02,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:57:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 728 transitions. [2023-11-06 22:57:02,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47706422018348627 [2023-11-06 22:57:02,692 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 728 transitions. [2023-11-06 22:57:02,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 728 transitions. [2023-11-06 22:57:02,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:57:02,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 728 transitions. [2023-11-06 22:57:02,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 0 states 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:57:02,699 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:57:02,700 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:57:02,700 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 206 flow. Second operand 7 states and 728 transitions. [2023-11-06 22:57:02,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 101 transitions, 664 flow [2023-11-06 22:57:02,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 101 transitions, 635 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-11-06 22:57:02,727 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 348 flow [2023-11-06 22:57:02,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=348, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2023-11-06 22:57:02,728 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2023-11-06 22:57:02,728 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 348 flow [2023-11-06 22:57:02,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:57:02,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:57:02,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:02,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:57:02,729 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:57:02,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:02,730 INFO L85 PathProgramCache]: Analyzing trace with hash -940871611, now seen corresponding path program 1 times [2023-11-06 22:57:02,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:57:02,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788927077] [2023-11-06 22:57:02,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:02,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:57:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:03,236 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:57:03,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:57:03,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788927077] [2023-11-06 22:57:03,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788927077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:03,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:03,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:57:03,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120981871] [2023-11-06 22:57:03,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:03,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:57:03,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:57:03,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:57:03,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:57:03,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 218 [2023-11-06 22:57:03,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 348 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states 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:57:03,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:57:03,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 218 [2023-11-06 22:57:03,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:57:04,372 INFO L124 PetriNetUnfolderBase]: 2848/4253 cut-off events. [2023-11-06 22:57:04,372 INFO L125 PetriNetUnfolderBase]: For 11522/11739 co-relation queries the response was YES. [2023-11-06 22:57:04,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15907 conditions, 4253 events. 2848/4253 cut-off events. For 11522/11739 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 21646 event pairs, 251 based on Foata normal form. 270/4511 useless extension candidates. Maximal degree in co-relation 15883. Up to 2265 conditions per place. [2023-11-06 22:57:04,416 INFO L140 encePairwiseOnDemand]: 209/218 looper letters, 86 selfloop transitions, 15 changer transitions 29/133 dead transitions. [2023-11-06 22:57:04,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 133 transitions, 1155 flow [2023-11-06 22:57:04,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:57:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:57:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 687 transitions. [2023-11-06 22:57:04,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45019659239842724 [2023-11-06 22:57:04,420 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 687 transitions. [2023-11-06 22:57:04,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 687 transitions. [2023-11-06 22:57:04,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:57:04,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 687 transitions. [2023-11-06 22:57:04,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.14285714285714) internal successors, (687), 7 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:57:04,426 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:57:04,427 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:57:04,427 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 348 flow. Second operand 7 states and 687 transitions. [2023-11-06 22:57:04,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 133 transitions, 1155 flow [2023-11-06 22:57:04,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 133 transitions, 1105 flow, removed 19 selfloop flow, removed 2 redundant places. [2023-11-06 22:57:04,468 INFO L231 Difference]: Finished difference. Result has 61 places, 62 transitions, 484 flow [2023-11-06 22:57:04,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=484, PETRI_PLACES=61, PETRI_TRANSITIONS=62} [2023-11-06 22:57:04,469 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2023-11-06 22:57:04,470 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 484 flow [2023-11-06 22:57:04,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states 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:57:04,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:57:04,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:04,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:57:04,471 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:57:04,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:04,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2080990499, now seen corresponding path program 2 times [2023-11-06 22:57:04,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:57:04,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845805270] [2023-11-06 22:57:04,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:04,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:57:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:04,689 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:57:04,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:57:04,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845805270] [2023-11-06 22:57:04,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845805270] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:04,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:04,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:57:04,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137372810] [2023-11-06 22:57:04,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:04,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:57:04,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:57:04,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:57:04,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:57:04,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 218 [2023-11-06 22:57:04,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states 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:57:04,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:57:04,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 218 [2023-11-06 22:57:04,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:57:05,033 INFO L124 PetriNetUnfolderBase]: 922/1600 cut-off events. [2023-11-06 22:57:05,034 INFO L125 PetriNetUnfolderBase]: For 6267/6432 co-relation queries the response was YES. [2023-11-06 22:57:05,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6622 conditions, 1600 events. 922/1600 cut-off events. For 6267/6432 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8636 event pairs, 203 based on Foata normal form. 158/1717 useless extension candidates. Maximal degree in co-relation 6593. Up to 1192 conditions per place. [2023-11-06 22:57:05,065 INFO L140 encePairwiseOnDemand]: 213/218 looper letters, 68 selfloop transitions, 4 changer transitions 5/85 dead transitions. [2023-11-06 22:57:05,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 85 transitions, 798 flow [2023-11-06 22:57:05,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:57:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:57:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-11-06 22:57:05,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5214067278287462 [2023-11-06 22:57:05,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-11-06 22:57:05,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-11-06 22:57:05,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:57:05,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-11-06 22:57:05,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states 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:57:05,072 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:57:05,073 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:57:05,073 INFO L175 Difference]: Start difference. First operand has 61 places, 62 transitions, 484 flow. Second operand 3 states and 341 transitions. [2023-11-06 22:57:05,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 85 transitions, 798 flow [2023-11-06 22:57:05,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 786 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-06 22:57:05,085 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 456 flow [2023-11-06 22:57:05,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2023-11-06 22:57:05,086 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 25 predicate places. [2023-11-06 22:57:05,086 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 456 flow [2023-11-06 22:57:05,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states 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:57:05,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:57:05,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:05,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:57:05,087 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:57:05,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:05,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2131096751, now seen corresponding path program 1 times [2023-11-06 22:57:05,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:57:05,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950240462] [2023-11-06 22:57:05,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:05,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:57:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:05,305 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:57:05,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:57:05,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950240462] [2023-11-06 22:57:05,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950240462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:05,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:05,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:57:05,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342093677] [2023-11-06 22:57:05,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:05,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:57:05,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:57:05,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:57:05,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:57:05,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 218 [2023-11-06 22:57:05,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 456 flow. Second operand has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states 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:57:05,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:57:05,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 218 [2023-11-06 22:57:05,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:57:05,544 INFO L124 PetriNetUnfolderBase]: 425/817 cut-off events. [2023-11-06 22:57:05,544 INFO L125 PetriNetUnfolderBase]: For 2514/2634 co-relation queries the response was YES. [2023-11-06 22:57:05,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3464 conditions, 817 events. 425/817 cut-off events. For 2514/2634 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4078 event pairs, 89 based on Foata normal form. 126/933 useless extension candidates. Maximal degree in co-relation 3433. Up to 276 conditions per place. [2023-11-06 22:57:05,552 INFO L140 encePairwiseOnDemand]: 213/218 looper letters, 76 selfloop transitions, 7 changer transitions 6/97 dead transitions. [2023-11-06 22:57:05,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 97 transitions, 900 flow [2023-11-06 22:57:05,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:57:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:57:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 455 transitions. [2023-11-06 22:57:05,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217889908256881 [2023-11-06 22:57:05,555 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 455 transitions. [2023-11-06 22:57:05,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 455 transitions. [2023-11-06 22:57:05,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:57:05,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 455 transitions. [2023-11-06 22:57:05,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states 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:57:05,560 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:57:05,561 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:57:05,561 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 456 flow. Second operand 4 states and 455 transitions. [2023-11-06 22:57:05,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 97 transitions, 900 flow [2023-11-06 22:57:05,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 870 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-06 22:57:05,572 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 468 flow [2023-11-06 22:57:05,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=468, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2023-11-06 22:57:05,573 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 27 predicate places. [2023-11-06 22:57:05,573 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 468 flow [2023-11-06 22:57:05,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states 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:57:05,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:57:05,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:05,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:57:05,574 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:57:05,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:05,575 INFO L85 PathProgramCache]: Analyzing trace with hash 422503794, now seen corresponding path program 1 times [2023-11-06 22:57:05,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:57:05,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367004866] [2023-11-06 22:57:05,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:05,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:57:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:05,807 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:57:05,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:57:05,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367004866] [2023-11-06 22:57:05,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367004866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:05,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:05,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:57:05,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278385065] [2023-11-06 22:57:05,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:05,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:57:05,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:57:05,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:57:05,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:57:05,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 218 [2023-11-06 22:57:05,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 468 flow. Second operand has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:57:05,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:57:05,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 218 [2023-11-06 22:57:05,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:57:06,034 INFO L124 PetriNetUnfolderBase]: 360/680 cut-off events. [2023-11-06 22:57:06,034 INFO L125 PetriNetUnfolderBase]: For 2189/2288 co-relation queries the response was YES. [2023-11-06 22:57:06,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2897 conditions, 680 events. 360/680 cut-off events. For 2189/2288 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3346 event pairs, 79 based on Foata normal form. 63/735 useless extension candidates. Maximal degree in co-relation 2865. Up to 276 conditions per place. [2023-11-06 22:57:06,040 INFO L140 encePairwiseOnDemand]: 213/218 looper letters, 56 selfloop transitions, 10 changer transitions 23/95 dead transitions. [2023-11-06 22:57:06,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 874 flow [2023-11-06 22:57:06,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:57:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:57:06,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 557 transitions. [2023-11-06 22:57:06,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5110091743119266 [2023-11-06 22:57:06,046 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 557 transitions. [2023-11-06 22:57:06,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 557 transitions. [2023-11-06 22:57:06,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:57:06,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 557 transitions. [2023-11-06 22:57:06,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states 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:57:06,052 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:57:06,052 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:57:06,053 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 468 flow. Second operand 5 states and 557 transitions. [2023-11-06 22:57:06,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 874 flow [2023-11-06 22:57:06,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 95 transitions, 799 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-11-06 22:57:06,065 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 320 flow [2023-11-06 22:57:06,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2023-11-06 22:57:06,067 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 27 predicate places. [2023-11-06 22:57:06,068 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 320 flow [2023-11-06 22:57:06,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:57:06,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:57:06,068 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:57:06,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:57:06,069 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:57:06,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:06,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1643997900, now seen corresponding path program 1 times [2023-11-06 22:57:06,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:57:06,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133562772] [2023-11-06 22:57:06,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:06,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:57:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:06,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:57:06,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:57:06,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133562772] [2023-11-06 22:57:06,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133562772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:06,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:06,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:57:06,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305122215] [2023-11-06 22:57:06,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:06,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:57:06,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:57:06,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:57:06,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:57:06,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 218 [2023-11-06 22:57:06,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 320 flow. Second operand has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states 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:57:06,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:57:06,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 218 [2023-11-06 22:57:06,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:57:06,660 INFO L124 PetriNetUnfolderBase]: 366/716 cut-off events. [2023-11-06 22:57:06,661 INFO L125 PetriNetUnfolderBase]: For 1772/1785 co-relation queries the response was YES. [2023-11-06 22:57:06,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2883 conditions, 716 events. 366/716 cut-off events. For 1772/1785 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3482 event pairs, 73 based on Foata normal form. 14/720 useless extension candidates. Maximal degree in co-relation 2857. Up to 395 conditions per place. [2023-11-06 22:57:06,666 INFO L140 encePairwiseOnDemand]: 214/218 looper letters, 42 selfloop transitions, 1 changer transitions 45/92 dead transitions. [2023-11-06 22:57:06,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 92 transitions, 794 flow [2023-11-06 22:57:06,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:57:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:57:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2023-11-06 22:57:06,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4908256880733945 [2023-11-06 22:57:06,669 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 535 transitions. [2023-11-06 22:57:06,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 535 transitions. [2023-11-06 22:57:06,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:57:06,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 535 transitions. [2023-11-06 22:57:06,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states 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:57:06,674 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:57:06,675 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:57:06,675 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 320 flow. Second operand 5 states and 535 transitions. [2023-11-06 22:57:06,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 92 transitions, 794 flow [2023-11-06 22:57:06,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 694 flow, removed 29 selfloop flow, removed 9 redundant places. [2023-11-06 22:57:06,689 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 211 flow [2023-11-06 22:57:06,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2023-11-06 22:57:06,690 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 23 predicate places. [2023-11-06 22:57:06,691 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 211 flow [2023-11-06 22:57:06,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states 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:57:06,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:57:06,691 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:57:06,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:57:06,692 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:57:06,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:06,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1152524228, now seen corresponding path program 2 times [2023-11-06 22:57:06,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:57:06,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102256418] [2023-11-06 22:57:06,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:06,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:57:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:57:06,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:57:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:57:06,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:57:06,892 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:57:06,893 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-06 22:57:06,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-06 22:57:06,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-06 22:57:06,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-06 22:57:06,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-06 22:57:06,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-06 22:57:06,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:57:06,899 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:06,905 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:57:06,905 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:57:07,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:57:07 BasicIcfg [2023-11-06 22:57:07,022 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:57:07,022 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:57:07,023 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:57:07,023 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:57:07,023 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:56:48" (3/4) ... [2023-11-06 22:57:07,024 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:57:07,146 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_179da14f-c785-466a-a5a5-b60af6bf1cff/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:57:07,146 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:57:07,147 INFO L158 Benchmark]: Toolchain (without parser) took 20251.31ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 126.4MB in the beginning and 179.4MB in the end (delta: -53.0MB). Peak memory consumption was 137.8MB. Max. memory is 16.1GB. [2023-11-06 22:57:07,147 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 132.1MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:57:07,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 739.12ms. Allocated memory is still 174.1MB. Free memory was 125.7MB in the beginning and 102.1MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:57:07,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.19ms. Allocated memory is still 174.1MB. Free memory was 102.1MB in the beginning and 99.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:57:07,148 INFO L158 Benchmark]: Boogie Preprocessor took 77.48ms. Allocated memory is still 174.1MB. Free memory was 99.3MB in the beginning and 97.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:57:07,149 INFO L158 Benchmark]: RCFGBuilder took 919.93ms. Allocated memory is still 174.1MB. Free memory was 97.2MB in the beginning and 130.1MB in the end (delta: -32.9MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2023-11-06 22:57:07,149 INFO L158 Benchmark]: TraceAbstraction took 18280.95ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 130.1MB in the beginning and 189.9MB in the end (delta: -59.7MB). Peak memory consumption was 127.9MB. Max. memory is 16.1GB. [2023-11-06 22:57:07,150 INFO L158 Benchmark]: Witness Printer took 124.06ms. Allocated memory is still 362.8MB. Free memory was 189.9MB in the beginning and 179.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:57:07,152 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.28ms. Allocated memory is still 132.1MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 739.12ms. Allocated memory is still 174.1MB. Free memory was 125.7MB in the beginning and 102.1MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.19ms. Allocated memory is still 174.1MB. Free memory was 102.1MB in the beginning and 99.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.48ms. Allocated memory is still 174.1MB. Free memory was 99.3MB in the beginning and 97.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 919.93ms. Allocated memory is still 174.1MB. Free memory was 97.2MB in the beginning and 130.1MB in the end (delta: -32.9MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * TraceAbstraction took 18280.95ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 130.1MB in the beginning and 189.9MB in the end (delta: -59.7MB). Peak memory consumption was 127.9MB. Max. memory is 16.1GB. * Witness Printer took 124.06ms. Allocated memory is still 362.8MB. Free memory was 189.9MB in the beginning and 179.4MB in the end (delta: 10.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: 5.1s, 124 PlacesBefore, 37 PlacesAfterwards, 116 TransitionsBefore, 28 TransitionsAfterwards, 2498 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, 6160 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2983, independent: 2799, independent conditional: 0, independent unconditional: 2799, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1423, independent: 1388, independent conditional: 0, independent unconditional: 1388, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2983, independent: 1411, independent conditional: 0, independent unconditional: 1411, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 1423, unknown conditional: 0, unknown unconditional: 1423] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891; [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t891, ((void *)0), P0, ((void *)0))=-3, t891={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L842] 0 pthread_t t892; [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t892, ((void *)0), P1, ((void *)0))=-2, t891={5:0}, t892={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L844] 0 pthread_t t893; [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t893, ((void *)0), P2, ((void *)0))=-1, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 y = 1 [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 [L809] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 841]: 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: 843]: 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, 150 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.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 678 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 542 mSDsluCounter, 500 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 383 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1352 IncrementalHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 117 mSDtfsCounter, 1352 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=484occurred in iteration=7, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 1274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-06 22:57:07,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_179da14f-c785-466a-a5a5-b60af6bf1cff/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