./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83f146e-f34a-40a7-bed5-4b929fe2ead5/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83f146e-f34a-40a7-bed5-4b929fe2ead5/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_d83f146e-f34a-40a7-bed5-4b929fe2ead5/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83f146e-f34a-40a7-bed5-4b929fe2ead5/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83f146e-f34a-40a7-bed5-4b929fe2ead5/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_d83f146e-f34a-40a7-bed5-4b929fe2ead5/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 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:12:25,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:12:25,915 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83f146e-f34a-40a7-bed5-4b929fe2ead5/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:12:25,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:12:25,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:12:25,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:12:25,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:12:25,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:12:25,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:12:25,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:12:25,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:12:25,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:12:25,971 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:12:25,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:12:25,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:12:25,974 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:12:25,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:12:25,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:12:25,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:12:25,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:12:25,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:12:25,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:12:25,977 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:12:25,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:12:25,978 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:12:25,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:12:25,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:12:25,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:12:25,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:12:25,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:12:25,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:12:25,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:12:25,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:12:25,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:12:25,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:12:25,983 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:12:25,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:12:25,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:12:25,984 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:12:25,984 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_d83f146e-f34a-40a7-bed5-4b929fe2ead5/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_d83f146e-f34a-40a7-bed5-4b929fe2ead5/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 -> 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 [2023-11-06 23:12:26,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:12:26,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:12:26,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:12:26,342 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:12:26,343 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:12:26,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83f146e-f34a-40a7-bed5-4b929fe2ead5/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-06 23:12:29,559 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:12:29,844 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:12:29,845 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83f146e-f34a-40a7-bed5-4b929fe2ead5/sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-06 23:12:29,870 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83f146e-f34a-40a7-bed5-4b929fe2ead5/bin/uautomizer-verify-WvqO1wxjHP/data/5d10df0fe/4143fc00cf4c4e838ec98427fc9336cb/FLAG9d61bdf62 [2023-11-06 23:12:29,886 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83f146e-f34a-40a7-bed5-4b929fe2ead5/bin/uautomizer-verify-WvqO1wxjHP/data/5d10df0fe/4143fc00cf4c4e838ec98427fc9336cb [2023-11-06 23:12:29,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:12:29,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:12:29,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:12:29,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:12:29,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:12:29,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:12:29" (1/1) ... [2023-11-06 23:12:29,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb963c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:29, skipping insertion in model container [2023-11-06 23:12:29,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:12:29" (1/1) ... [2023-11-06 23:12:29,953 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:12:30,128 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_d83f146e-f34a-40a7-bed5-4b929fe2ead5/sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2023-11-06 23:12:30,338 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:12:30,356 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:12:30,373 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_d83f146e-f34a-40a7-bed5-4b929fe2ead5/sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2023-11-06 23:12:30,453 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:12:30,489 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:12:30,490 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:12:30,498 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:12:30,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:30 WrapperNode [2023-11-06 23:12:30,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:12:30,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:12:30,500 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:12:30,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:12:30,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:30" (1/1) ... [2023-11-06 23:12:30,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:30" (1/1) ... [2023-11-06 23:12:30,563 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-11-06 23:12:30,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:12:30,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:12:30,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:12:30,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:12:30,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:30" (1/1) ... [2023-11-06 23:12:30,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:30" (1/1) ... [2023-11-06 23:12:30,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:30" (1/1) ... [2023-11-06 23:12:30,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:30" (1/1) ... [2023-11-06 23:12:30,615 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:30" (1/1) ... [2023-11-06 23:12:30,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:30" (1/1) ... [2023-11-06 23:12:30,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:30" (1/1) ... [2023-11-06 23:12:30,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:30" (1/1) ... [2023-11-06 23:12:30,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:12:30,642 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:12:30,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:12:30,643 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:12:30,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:30" (1/1) ... [2023-11-06 23:12:30,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:12:30,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83f146e-f34a-40a7-bed5-4b929fe2ead5/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:12:30,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83f146e-f34a-40a7-bed5-4b929fe2ead5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:12:30,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83f146e-f34a-40a7-bed5-4b929fe2ead5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:12:30,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:12:30,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:12:30,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:12:30,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:12:30,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:12:30,737 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:12:30,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:12:30,737 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:12:30,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:12:30,737 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:12:30,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:12:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:12:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:12:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:12:30,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:12:30,740 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 23:12:30,909 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:12:30,911 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:12:31,359 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:12:31,508 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:12:31,509 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:12:31,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:12:31 BoogieIcfgContainer [2023-11-06 23:12:31,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:12:31,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:12:31,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:12:31,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:12:31,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:12:29" (1/3) ... [2023-11-06 23:12:31,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14780105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:12:31, skipping insertion in model container [2023-11-06 23:12:31,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:30" (2/3) ... [2023-11-06 23:12:31,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14780105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:12:31, skipping insertion in model container [2023-11-06 23:12:31,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:12:31" (3/3) ... [2023-11-06 23:12:31,521 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-06 23:12:31,529 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 23:12:31,540 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:12:31,541 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 23:12:31,541 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:12:31,635 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:12:31,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 234 flow [2023-11-06 23:12:31,777 INFO L124 PetriNetUnfolderBase]: 2/108 cut-off events. [2023-11-06 23:12:31,777 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:12:31,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-11-06 23:12:31,785 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 234 flow [2023-11-06 23:12:31,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2023-11-06 23:12:31,796 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:12:31,820 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 225 flow [2023-11-06 23:12:31,826 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 225 flow [2023-11-06 23:12:31,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 225 flow [2023-11-06 23:12:31,885 INFO L124 PetriNetUnfolderBase]: 2/108 cut-off events. [2023-11-06 23:12:31,886 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:12:31,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-11-06 23:12:31,892 INFO L119 LiptonReduction]: Number of co-enabled transitions 1958 [2023-11-06 23:12:36,394 INFO L134 LiptonReduction]: Checked pairs total: 4936 [2023-11-06 23:12:36,394 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-11-06 23:12:36,428 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:12:36,447 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;@327dcc14, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:12:36,447 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-06 23:12:36,452 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:12:36,453 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-06 23:12:36,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:12:36,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:36,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:12:36,455 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 23:12:36,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:36,462 INFO L85 PathProgramCache]: Analyzing trace with hash 454267293, now seen corresponding path program 1 times [2023-11-06 23:12:36,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:12:36,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143212] [2023-11-06 23:12:36,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:36,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:12:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:37,146 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 23:12:37,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:12:37,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143212] [2023-11-06 23:12:37,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:37,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:37,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:12:37,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113081894] [2023-11-06 23:12:37,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:37,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:12:37,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:12:37,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:12:37,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:12:37,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 206 [2023-11-06 23:12:37,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states 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 23:12:37,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:37,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 206 [2023-11-06 23:12:37,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:37,708 INFO L124 PetriNetUnfolderBase]: 999/1612 cut-off events. [2023-11-06 23:12:37,708 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-06 23:12:37,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3147 conditions, 1612 events. 999/1612 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8267 event pairs, 165 based on Foata normal form. 64/1540 useless extension candidates. Maximal degree in co-relation 3136. Up to 1195 conditions per place. [2023-11-06 23:12:37,733 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 29 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2023-11-06 23:12:37,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 156 flow [2023-11-06 23:12:37,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:12:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:12:37,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-11-06 23:12:37,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5372168284789643 [2023-11-06 23:12:37,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-11-06 23:12:37,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-11-06 23:12:37,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:37,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-11-06 23:12:37,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states 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 23:12:37,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states 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 23:12:37,790 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states 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 23:12:37,793 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 332 transitions. [2023-11-06 23:12:37,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 156 flow [2023-11-06 23:12:37,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:12:37,801 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-11-06 23:12:37,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-11-06 23:12:37,809 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-06 23:12:37,809 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-11-06 23:12:37,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states 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 23:12:37,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:37,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:37,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:12:37,811 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 23:12:37,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:37,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1440573302, now seen corresponding path program 1 times [2023-11-06 23:12:37,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:12:37,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189998412] [2023-11-06 23:12:37,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:37,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:12:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:38,222 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 23:12:38,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:12:38,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189998412] [2023-11-06 23:12:38,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189998412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:38,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:38,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:12:38,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973303615] [2023-11-06 23:12:38,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:38,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:12:38,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:12:38,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:12:38,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:12:38,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 206 [2023-11-06 23:12:38,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states 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 23:12:38,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:38,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 206 [2023-11-06 23:12:38,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:38,687 INFO L124 PetriNetUnfolderBase]: 773/1244 cut-off events. [2023-11-06 23:12:38,687 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2023-11-06 23:12:38,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2582 conditions, 1244 events. 773/1244 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6016 event pairs, 260 based on Foata normal form. 64/1307 useless extension candidates. Maximal degree in co-relation 2572. Up to 1008 conditions per place. [2023-11-06 23:12:38,700 INFO L140 encePairwiseOnDemand]: 201/206 looper letters, 27 selfloop transitions, 3 changer transitions 15/47 dead transitions. [2023-11-06 23:12:38,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 204 flow [2023-11-06 23:12:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:12:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:12:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-11-06 23:12:38,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49223300970873785 [2023-11-06 23:12:38,705 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-11-06 23:12:38,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-11-06 23:12:38,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:38,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-11-06 23:12:38,713 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 23:12:38,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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 23:12:38,721 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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 23:12:38,721 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 5 states and 507 transitions. [2023-11-06 23:12:38,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 204 flow [2023-11-06 23:12:38,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 47 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:12:38,726 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 75 flow [2023-11-06 23:12:38,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-11-06 23:12:38,727 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2023-11-06 23:12:38,735 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 75 flow [2023-11-06 23:12:38,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states 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 23:12:38,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:38,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:38,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:12:38,737 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 23:12:38,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:38,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1708106872, now seen corresponding path program 1 times [2023-11-06 23:12:38,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:12:38,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906792170] [2023-11-06 23:12:38,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:38,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:12:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:39,087 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 23:12:39,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:12:39,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906792170] [2023-11-06 23:12:39,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906792170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:39,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:39,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:12:39,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582917517] [2023-11-06 23:12:39,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:39,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:12:39,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:12:39,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:12:39,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:12:39,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 206 [2023-11-06 23:12:39,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 0 states 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 23:12:39,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:39,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 206 [2023-11-06 23:12:39,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:39,515 INFO L124 PetriNetUnfolderBase]: 699/1144 cut-off events. [2023-11-06 23:12:39,516 INFO L125 PetriNetUnfolderBase]: For 459/459 co-relation queries the response was YES. [2023-11-06 23:12:39,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2709 conditions, 1144 events. 699/1144 cut-off events. For 459/459 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5337 event pairs, 175 based on Foata normal form. 48/1188 useless extension candidates. Maximal degree in co-relation 2696. Up to 761 conditions per place. [2023-11-06 23:12:39,528 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 25 selfloop transitions, 3 changer transitions 14/44 dead transitions. [2023-11-06 23:12:39,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 207 flow [2023-11-06 23:12:39,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:12:39,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:12:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-11-06 23:12:39,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883495145631068 [2023-11-06 23:12:39,533 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-11-06 23:12:39,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-11-06 23:12:39,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:39,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-11-06 23:12:39,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:12:39,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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 23:12:39,542 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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 23:12:39,542 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 75 flow. Second operand 5 states and 503 transitions. [2023-11-06 23:12:39,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 207 flow [2023-11-06 23:12:39,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 198 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-06 23:12:39,552 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 83 flow [2023-11-06 23:12:39,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=83, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2023-11-06 23:12:39,555 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-11-06 23:12:39,559 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 83 flow [2023-11-06 23:12:39,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 0 states 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 23:12:39,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:39,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:39,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:12:39,561 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 23:12:39,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:39,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1708105911, now seen corresponding path program 1 times [2023-11-06 23:12:39,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:12:39,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920734066] [2023-11-06 23:12:39,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:39,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:12:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:39,806 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 23:12:39,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:12:39,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920734066] [2023-11-06 23:12:39,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920734066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:39,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:39,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:12:39,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753129377] [2023-11-06 23:12:39,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:39,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:12:39,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:12:39,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:12:39,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:12:39,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 206 [2023-11-06 23:12:39,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states 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 23:12:39,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:39,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 206 [2023-11-06 23:12:39,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:40,491 INFO L124 PetriNetUnfolderBase]: 1256/1964 cut-off events. [2023-11-06 23:12:40,491 INFO L125 PetriNetUnfolderBase]: For 1288/1288 co-relation queries the response was YES. [2023-11-06 23:12:40,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4751 conditions, 1964 events. 1256/1964 cut-off events. For 1288/1288 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 9856 event pairs, 238 based on Foata normal form. 105/2061 useless extension candidates. Maximal degree in co-relation 4735. Up to 781 conditions per place. [2023-11-06 23:12:40,509 INFO L140 encePairwiseOnDemand]: 199/206 looper letters, 46 selfloop transitions, 11 changer transitions 30/88 dead transitions. [2023-11-06 23:12:40,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 88 transitions, 441 flow [2023-11-06 23:12:40,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:12:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 23:12:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 899 transitions. [2023-11-06 23:12:40,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4848975188781014 [2023-11-06 23:12:40,515 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 899 transitions. [2023-11-06 23:12:40,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 899 transitions. [2023-11-06 23:12:40,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:40,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 899 transitions. [2023-11-06 23:12:40,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.88888888888889) internal successors, (899), 9 states have internal predecessors, (899), 0 states have call successors, (0), 0 states 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 23:12:40,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 206.0) internal successors, (2060), 10 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states 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 23:12:40,529 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 206.0) internal successors, (2060), 10 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states 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 23:12:40,529 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 83 flow. Second operand 9 states and 899 transitions. [2023-11-06 23:12:40,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 88 transitions, 441 flow [2023-11-06 23:12:40,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 88 transitions, 423 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-06 23:12:40,538 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 169 flow [2023-11-06 23:12:40,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=169, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2023-11-06 23:12:40,540 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2023-11-06 23:12:40,540 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 169 flow [2023-11-06 23:12:40,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states 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 23:12:40,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:40,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:40,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:12:40,542 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 23:12:40,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:40,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1560563737, now seen corresponding path program 1 times [2023-11-06 23:12:40,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:12:40,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52218167] [2023-11-06 23:12:40,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:40,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:12:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:12:40,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:12:40,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52218167] [2023-11-06 23:12:40,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52218167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:40,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:40,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:12:40,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717544431] [2023-11-06 23:12:40,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:40,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:12:40,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:12:40,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:12:40,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:12:40,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 206 [2023-11-06 23:12:40,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states 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 23:12:40,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:40,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 206 [2023-11-06 23:12:40,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:41,470 INFO L124 PetriNetUnfolderBase]: 1219/1918 cut-off events. [2023-11-06 23:12:41,471 INFO L125 PetriNetUnfolderBase]: For 3296/3296 co-relation queries the response was YES. [2023-11-06 23:12:41,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5760 conditions, 1918 events. 1219/1918 cut-off events. For 3296/3296 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 9552 event pairs, 334 based on Foata normal form. 45/1959 useless extension candidates. Maximal degree in co-relation 5739. Up to 729 conditions per place. [2023-11-06 23:12:41,490 INFO L140 encePairwiseOnDemand]: 201/206 looper letters, 31 selfloop transitions, 5 changer transitions 24/61 dead transitions. [2023-11-06 23:12:41,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 402 flow [2023-11-06 23:12:41,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:12:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:12:41,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 595 transitions. [2023-11-06 23:12:41,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4813915857605178 [2023-11-06 23:12:41,495 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 595 transitions. [2023-11-06 23:12:41,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 595 transitions. [2023-11-06 23:12:41,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:41,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 595 transitions. [2023-11-06 23:12:41,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states 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 23:12:41,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states 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 23:12:41,503 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states 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 23:12:41,504 INFO L175 Difference]: Start difference. First operand has 47 places, 31 transitions, 169 flow. Second operand 6 states and 595 transitions. [2023-11-06 23:12:41,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 402 flow [2023-11-06 23:12:41,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 382 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-11-06 23:12:41,518 INFO L231 Difference]: Finished difference. Result has 49 places, 25 transitions, 140 flow [2023-11-06 23:12:41,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=49, PETRI_TRANSITIONS=25} [2023-11-06 23:12:41,520 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-11-06 23:12:41,520 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 25 transitions, 140 flow [2023-11-06 23:12:41,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states 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 23:12:41,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:41,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:41,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:12:41,522 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 23:12:41,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:41,522 INFO L85 PathProgramCache]: Analyzing trace with hash -680875329, now seen corresponding path program 1 times [2023-11-06 23:12:41,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:12:41,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585535309] [2023-11-06 23:12:41,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:41,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:12:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:41,960 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 23:12:41,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:12:41,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585535309] [2023-11-06 23:12:41,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585535309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:41,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:41,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:12:41,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126464546] [2023-11-06 23:12:41,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:41,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:12:41,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:12:41,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:12:41,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:12:42,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 206 [2023-11-06 23:12:42,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 25 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states 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 23:12:42,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:42,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 206 [2023-11-06 23:12:42,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:42,458 INFO L124 PetriNetUnfolderBase]: 510/847 cut-off events. [2023-11-06 23:12:42,458 INFO L125 PetriNetUnfolderBase]: For 2008/2008 co-relation queries the response was YES. [2023-11-06 23:12:42,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2750 conditions, 847 events. 510/847 cut-off events. For 2008/2008 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3523 event pairs, 291 based on Foata normal form. 37/880 useless extension candidates. Maximal degree in co-relation 2726. Up to 614 conditions per place. [2023-11-06 23:12:42,469 INFO L140 encePairwiseOnDemand]: 198/206 looper letters, 37 selfloop transitions, 12 changer transitions 16/68 dead transitions. [2023-11-06 23:12:42,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 438 flow [2023-11-06 23:12:42,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:12:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:12:42,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 808 transitions. [2023-11-06 23:12:42,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49029126213592233 [2023-11-06 23:12:42,474 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 808 transitions. [2023-11-06 23:12:42,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 808 transitions. [2023-11-06 23:12:42,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:42,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 808 transitions. [2023-11-06 23:12:42,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.0) internal successors, (808), 8 states have internal predecessors, (808), 0 states have call successors, (0), 0 states 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 23:12:42,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 206.0) internal successors, (1854), 9 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states 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 23:12:42,483 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 206.0) internal successors, (1854), 9 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states 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 23:12:42,484 INFO L175 Difference]: Start difference. First operand has 49 places, 25 transitions, 140 flow. Second operand 8 states and 808 transitions. [2023-11-06 23:12:42,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 438 flow [2023-11-06 23:12:42,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 385 flow, removed 13 selfloop flow, removed 8 redundant places. [2023-11-06 23:12:42,491 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 203 flow [2023-11-06 23:12:42,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=203, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2023-11-06 23:12:42,493 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2023-11-06 23:12:42,493 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 203 flow [2023-11-06 23:12:42,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states 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 23:12:42,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:42,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:42,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:12:42,494 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 23:12:42,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:42,495 INFO L85 PathProgramCache]: Analyzing trace with hash 765023377, now seen corresponding path program 1 times [2023-11-06 23:12:42,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:12:42,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204693727] [2023-11-06 23:12:42,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:42,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:12:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:42,702 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 23:12:42,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:12:42,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204693727] [2023-11-06 23:12:42,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204693727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:42,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:42,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:12:42,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076603558] [2023-11-06 23:12:42,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:42,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:12:42,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:12:42,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:12:42,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:12:42,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 206 [2023-11-06 23:12:42,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 33 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states 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 23:12:42,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:42,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 206 [2023-11-06 23:12:42,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:43,190 INFO L124 PetriNetUnfolderBase]: 762/1187 cut-off events. [2023-11-06 23:12:43,190 INFO L125 PetriNetUnfolderBase]: For 3106/3110 co-relation queries the response was YES. [2023-11-06 23:12:43,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4297 conditions, 1187 events. 762/1187 cut-off events. For 3106/3110 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4726 event pairs, 226 based on Foata normal form. 36/1218 useless extension candidates. Maximal degree in co-relation 4273. Up to 407 conditions per place. [2023-11-06 23:12:43,203 INFO L140 encePairwiseOnDemand]: 201/206 looper letters, 32 selfloop transitions, 4 changer transitions 26/63 dead transitions. [2023-11-06 23:12:43,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 479 flow [2023-11-06 23:12:43,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:12:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:12:43,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 590 transitions. [2023-11-06 23:12:43,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4773462783171521 [2023-11-06 23:12:43,207 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 590 transitions. [2023-11-06 23:12:43,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 590 transitions. [2023-11-06 23:12:43,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:43,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 590 transitions. [2023-11-06 23:12:43,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 0 states 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 23:12:43,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states 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 23:12:43,216 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states 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 23:12:43,216 INFO L175 Difference]: Start difference. First operand has 52 places, 33 transitions, 203 flow. Second operand 6 states and 590 transitions. [2023-11-06 23:12:43,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 479 flow [2023-11-06 23:12:43,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 463 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-06 23:12:43,225 INFO L231 Difference]: Finished difference. Result has 54 places, 26 transitions, 159 flow [2023-11-06 23:12:43,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=159, PETRI_PLACES=54, PETRI_TRANSITIONS=26} [2023-11-06 23:12:43,227 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2023-11-06 23:12:43,227 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 26 transitions, 159 flow [2023-11-06 23:12:43,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states 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 23:12:43,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:43,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:43,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:12:43,229 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 23:12:43,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:43,230 INFO L85 PathProgramCache]: Analyzing trace with hash 461136833, now seen corresponding path program 1 times [2023-11-06 23:12:43,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:12:43,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055684304] [2023-11-06 23:12:43,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:43,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:12:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:43,418 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 23:12:43,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:12:43,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055684304] [2023-11-06 23:12:43,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055684304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:43,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:43,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:12:43,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217643240] [2023-11-06 23:12:43,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:43,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:12:43,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:12:43,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:12:43,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:12:43,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 206 [2023-11-06 23:12:43,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 26 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states 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 23:12:43,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:43,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 206 [2023-11-06 23:12:43,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:43,585 INFO L124 PetriNetUnfolderBase]: 188/331 cut-off events. [2023-11-06 23:12:43,585 INFO L125 PetriNetUnfolderBase]: For 1150/1151 co-relation queries the response was YES. [2023-11-06 23:12:43,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 331 events. 188/331 cut-off events. For 1150/1151 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1079 event pairs, 95 based on Foata normal form. 15/345 useless extension candidates. Maximal degree in co-relation 1277. Up to 290 conditions per place. [2023-11-06 23:12:43,591 INFO L140 encePairwiseOnDemand]: 201/206 looper letters, 28 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2023-11-06 23:12:43,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 34 transitions, 264 flow [2023-11-06 23:12:43,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:12:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:12:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-11-06 23:12:43,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5097087378640777 [2023-11-06 23:12:43,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-11-06 23:12:43,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-11-06 23:12:43,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:43,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-11-06 23:12:43,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:12:43,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states 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 23:12:43,606 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states 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 23:12:43,606 INFO L175 Difference]: Start difference. First operand has 54 places, 26 transitions, 159 flow. Second operand 3 states and 315 transitions. [2023-11-06 23:12:43,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 34 transitions, 264 flow [2023-11-06 23:12:43,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 34 transitions, 219 flow, removed 10 selfloop flow, removed 11 redundant places. [2023-11-06 23:12:43,612 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 139 flow [2023-11-06 23:12:43,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2023-11-06 23:12:43,617 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-11-06 23:12:43,617 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 139 flow [2023-11-06 23:12:43,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states 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 23:12:43,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:43,618 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 23:12:43,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:12:43,618 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 23:12:43,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:43,619 INFO L85 PathProgramCache]: Analyzing trace with hash -814179627, now seen corresponding path program 1 times [2023-11-06 23:12:43,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:12:43,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329075658] [2023-11-06 23:12:43,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:43,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:12:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:43,944 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 23:12:43,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:12:43,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329075658] [2023-11-06 23:12:43,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329075658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:43,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:43,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:12:43,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176573984] [2023-11-06 23:12:43,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:43,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:12:43,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:12:43,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:12:43,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:12:43,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 206 [2023-11-06 23:12:43,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:12:43,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:43,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 206 [2023-11-06 23:12:43,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:44,084 INFO L124 PetriNetUnfolderBase]: 74/159 cut-off events. [2023-11-06 23:12:44,085 INFO L125 PetriNetUnfolderBase]: For 345/346 co-relation queries the response was YES. [2023-11-06 23:12:44,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 159 events. 74/159 cut-off events. For 345/346 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 420 event pairs, 14 based on Foata normal form. 17/175 useless extension candidates. Maximal degree in co-relation 606. Up to 78 conditions per place. [2023-11-06 23:12:44,087 INFO L140 encePairwiseOnDemand]: 201/206 looper letters, 32 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2023-11-06 23:12:44,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 41 transitions, 290 flow [2023-11-06 23:12:44,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:12:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:12:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions. [2023-11-06 23:12:44,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060679611650486 [2023-11-06 23:12:44,091 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 417 transitions. [2023-11-06 23:12:44,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 417 transitions. [2023-11-06 23:12:44,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:44,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 417 transitions. [2023-11-06 23:12:44,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states 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 23:12:44,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states 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 23:12:44,097 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states 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 23:12:44,098 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 139 flow. Second operand 4 states and 417 transitions. [2023-11-06 23:12:44,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 41 transitions, 290 flow [2023-11-06 23:12:44,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 277 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-06 23:12:44,102 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 167 flow [2023-11-06 23:12:44,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-11-06 23:12:44,104 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2023-11-06 23:12:44,104 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 167 flow [2023-11-06 23:12:44,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:12:44,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:44,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:44,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:12:44,106 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 23:12:44,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:44,107 INFO L85 PathProgramCache]: Analyzing trace with hash -749842952, now seen corresponding path program 1 times [2023-11-06 23:12:44,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:12:44,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116501406] [2023-11-06 23:12:44,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:44,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:12:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:44,457 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 23:12:44,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:12:44,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116501406] [2023-11-06 23:12:44,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116501406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:44,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:44,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:12:44,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753196970] [2023-11-06 23:12:44,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:44,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:12:44,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:12:44,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:12:44,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:12:44,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 206 [2023-11-06 23:12:44,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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 23:12:44,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:44,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 206 [2023-11-06 23:12:44,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:44,571 INFO L124 PetriNetUnfolderBase]: 48/107 cut-off events. [2023-11-06 23:12:44,571 INFO L125 PetriNetUnfolderBase]: For 236/237 co-relation queries the response was YES. [2023-11-06 23:12:44,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 107 events. 48/107 cut-off events. For 236/237 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 250 event pairs, 10 based on Foata normal form. 7/113 useless extension candidates. Maximal degree in co-relation 422. Up to 40 conditions per place. [2023-11-06 23:12:44,573 INFO L140 encePairwiseOnDemand]: 201/206 looper letters, 29 selfloop transitions, 10 changer transitions 0/41 dead transitions. [2023-11-06 23:12:44,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 305 flow [2023-11-06 23:12:44,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:12:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:12:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-11-06 23:12:44,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4970873786407767 [2023-11-06 23:12:44,576 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-11-06 23:12:44,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-11-06 23:12:44,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:44,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-11-06 23:12:44,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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 23:12:44,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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 23:12:44,582 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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 23:12:44,582 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 167 flow. Second operand 5 states and 512 transitions. [2023-11-06 23:12:44,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 305 flow [2023-11-06 23:12:44,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 244 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-11-06 23:12:44,585 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 151 flow [2023-11-06 23:12:44,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-11-06 23:12:44,586 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2023-11-06 23:12:44,586 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 151 flow [2023-11-06 23:12:44,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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 23:12:44,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:44,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:44,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:12:44,587 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 23:12:44,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:44,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1449532639, now seen corresponding path program 1 times [2023-11-06 23:12:44,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:12:44,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328114614] [2023-11-06 23:12:44,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:44,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:12:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:45,515 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 23:12:45,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:12:45,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328114614] [2023-11-06 23:12:45,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328114614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:45,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:45,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:12:45,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491845639] [2023-11-06 23:12:45,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:45,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:12:45,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:12:45,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:12:45,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:12:45,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 206 [2023-11-06 23:12:45,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 151 flow. Second operand has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 0 states have call successors, (0), 0 states 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 23:12:45,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:45,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 206 [2023-11-06 23:12:45,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:45,866 INFO L124 PetriNetUnfolderBase]: 56/130 cut-off events. [2023-11-06 23:12:45,866 INFO L125 PetriNetUnfolderBase]: For 251/255 co-relation queries the response was YES. [2023-11-06 23:12:45,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 130 events. 56/130 cut-off events. For 251/255 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 338 event pairs, 10 based on Foata normal form. 5/135 useless extension candidates. Maximal degree in co-relation 478. Up to 46 conditions per place. [2023-11-06 23:12:45,868 INFO L140 encePairwiseOnDemand]: 199/206 looper letters, 28 selfloop transitions, 3 changer transitions 25/58 dead transitions. [2023-11-06 23:12:45,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 429 flow [2023-11-06 23:12:45,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:12:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:12:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 768 transitions. [2023-11-06 23:12:45,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46601941747572817 [2023-11-06 23:12:45,873 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 768 transitions. [2023-11-06 23:12:45,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 768 transitions. [2023-11-06 23:12:45,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:45,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 768 transitions. [2023-11-06 23:12:45,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 0 states 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 23:12:45,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 206.0) internal successors, (1854), 9 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states 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 23:12:45,883 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 206.0) internal successors, (1854), 9 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states 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 23:12:45,883 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 151 flow. Second operand 8 states and 768 transitions. [2023-11-06 23:12:45,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 429 flow [2023-11-06 23:12:45,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 359 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-11-06 23:12:45,887 INFO L231 Difference]: Finished difference. Result has 49 places, 29 transitions, 132 flow [2023-11-06 23:12:45,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=132, PETRI_PLACES=49, PETRI_TRANSITIONS=29} [2023-11-06 23:12:45,888 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-11-06 23:12:45,888 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 29 transitions, 132 flow [2023-11-06 23:12:45,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 0 states have call successors, (0), 0 states 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 23:12:45,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:45,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:45,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:12:45,890 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 23:12:45,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:45,890 INFO L85 PathProgramCache]: Analyzing trace with hash 658168995, now seen corresponding path program 2 times [2023-11-06 23:12:45,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:12:45,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315968374] [2023-11-06 23:12:45,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:45,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:12:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:12:45,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:12:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:12:46,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:12:46,030 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:12:46,031 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-06 23:12:46,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-06 23:12:46,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-06 23:12:46,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-06 23:12:46,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-06 23:12:46,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-06 23:12:46,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:12:46,036 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:46,044 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:12:46,044 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:12:46,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:12:46 BasicIcfg [2023-11-06 23:12:46,137 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:12:46,138 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:12:46,138 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:12:46,139 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:12:46,139 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:12:31" (3/4) ... [2023-11-06 23:12:46,140 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 23:12:46,279 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83f146e-f34a-40a7-bed5-4b929fe2ead5/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:12:46,279 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:12:46,280 INFO L158 Benchmark]: Toolchain (without parser) took 16388.60ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 117.4MB in the beginning and 159.0MB in the end (delta: -41.6MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. [2023-11-06 23:12:46,280 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 111.1MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:12:46,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.05ms. Allocated memory is still 157.3MB. Free memory was 117.0MB in the beginning and 93.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 23:12:46,282 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.09ms. Allocated memory is still 157.3MB. Free memory was 93.9MB in the beginning and 91.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:12:46,282 INFO L158 Benchmark]: Boogie Preprocessor took 70.38ms. Allocated memory is still 157.3MB. Free memory was 91.7MB in the beginning and 89.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:12:46,283 INFO L158 Benchmark]: RCFGBuilder took 869.30ms. Allocated memory is still 157.3MB. Free memory was 89.7MB in the beginning and 111.8MB in the end (delta: -22.1MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2023-11-06 23:12:46,283 INFO L158 Benchmark]: TraceAbstraction took 14623.35ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 111.8MB in the beginning and 168.4MB in the end (delta: -56.6MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2023-11-06 23:12:46,284 INFO L158 Benchmark]: Witness Printer took 141.05ms. Allocated memory is still 272.6MB. Free memory was 168.4MB in the beginning and 159.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 23:12:46,286 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.47ms. Allocated memory is still 111.1MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 606.05ms. Allocated memory is still 157.3MB. Free memory was 117.0MB in the beginning and 93.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.09ms. Allocated memory is still 157.3MB. Free memory was 93.9MB in the beginning and 91.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.38ms. Allocated memory is still 157.3MB. Free memory was 91.7MB in the beginning and 89.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 869.30ms. Allocated memory is still 157.3MB. Free memory was 89.7MB in the beginning and 111.8MB in the end (delta: -22.1MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * TraceAbstraction took 14623.35ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 111.8MB in the beginning and 168.4MB in the end (delta: -56.6MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. * Witness Printer took 141.05ms. Allocated memory is still 272.6MB. Free memory was 168.4MB in the beginning and 159.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 116 PlacesBefore, 34 PlacesAfterwards, 108 TransitionsBefore, 25 TransitionsAfterwards, 1958 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, 4936 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2163, independent: 1990, independent conditional: 0, independent unconditional: 1990, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1036, independent: 1007, independent conditional: 0, independent unconditional: 1007, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2163, independent: 983, independent conditional: 0, independent unconditional: 983, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 1036, unknown conditional: 0, unknown unconditional: 1036] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2055; [L832] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2055, ((void *)0), P0, ((void *)0))=-2, t2055={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] [L833] 0 pthread_t t2056; [L834] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2056, ((void *)0), P1, ((void *)0))=-1, t2055={5:0}, t2056={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] [L835] 0 pthread_t t2057; [L836] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2057, ((void *)0), P2, ((void *)0))=0, t2055={5:0}, t2056={6:0}, t2057={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=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] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 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) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L789] 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) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 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 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 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) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 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 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3: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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L849] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 832]: 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, 137 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: 14.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 554 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 456 mSDsluCounter, 301 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 227 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1065 IncrementalHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 74 mSDtfsCounter, 1065 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=6, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 724 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 23:12:46,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83f146e-f34a-40a7-bed5-4b929fe2ead5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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