./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/27_Boop_simple_vf.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c25be6-ba4e-4290-aa69-91815baa3ef6/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c25be6-ba4e-4290-aa69-91815baa3ef6/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c25be6-ba4e-4290-aa69-91815baa3ef6/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c25be6-ba4e-4290-aa69-91815baa3ef6/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/27_Boop_simple_vf.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c25be6-ba4e-4290-aa69-91815baa3ef6/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c25be6-ba4e-4290-aa69-91815baa3ef6/bin/uautomizer-Dbtcem3rbc --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 ce64fcfa63b9df647c320ea90e20b624e2dad5b9ca256083b6d2f56c3177560a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:07:25,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:07:25,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:07:25,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:07:25,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:07:25,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:07:25,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:07:25,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:07:25,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:07:25,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:07:25,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:07:25,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:07:25,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:07:25,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:07:25,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:07:25,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:07:25,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:07:25,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:07:25,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:07:25,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:07:25,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:07:25,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:07:25,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:07:25,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:07:25,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:07:25,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:07:25,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:07:25,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:07:25,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:07:25,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:07:25,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:07:25,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:07:25,174 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:07:25,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:07:25,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:07:25,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:07:25,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:07:25,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:07:25,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:07:25,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:07:25,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:07:25,180 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c25be6-ba4e-4290-aa69-91815baa3ef6/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:07:25,221 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:07:25,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:07:25,222 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:07:25,222 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:07:25,223 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:07:25,223 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:07:25,224 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:07:25,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:07:25,224 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:07:25,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:07:25,226 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:07:25,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:07:25,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:07:25,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:07:25,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:07:25,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:07:25,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:07:25,227 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:07:25,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:07:25,227 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:07:25,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:07:25,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:07:25,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:07:25,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:07:25,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:07:25,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:07:25,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:07:25,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:07:25,230 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:07:25,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:07:25,230 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:07:25,230 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:07:25,231 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:07:25,231 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_09c25be6-ba4e-4290-aa69-91815baa3ef6/bin/uautomizer-Dbtcem3rbc/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_09c25be6-ba4e-4290-aa69-91815baa3ef6/bin/uautomizer-Dbtcem3rbc 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 -> ce64fcfa63b9df647c320ea90e20b624e2dad5b9ca256083b6d2f56c3177560a [2022-11-02 21:07:25,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:07:25,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:07:25,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:07:25,548 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:07:25,549 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:07:25,550 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c25be6-ba4e-4290-aa69-91815baa3ef6/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-ext/27_Boop_simple_vf.i [2022-11-02 21:07:25,623 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c25be6-ba4e-4290-aa69-91815baa3ef6/bin/uautomizer-Dbtcem3rbc/data/5eb58293a/20c60025c7ea4503b571c93911740a27/FLAGd485ee540 [2022-11-02 21:07:26,217 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:07:26,218 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c25be6-ba4e-4290-aa69-91815baa3ef6/sv-benchmarks/c/pthread-ext/27_Boop_simple_vf.i [2022-11-02 21:07:26,238 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c25be6-ba4e-4290-aa69-91815baa3ef6/bin/uautomizer-Dbtcem3rbc/data/5eb58293a/20c60025c7ea4503b571c93911740a27/FLAGd485ee540 [2022-11-02 21:07:26,506 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c25be6-ba4e-4290-aa69-91815baa3ef6/bin/uautomizer-Dbtcem3rbc/data/5eb58293a/20c60025c7ea4503b571c93911740a27 [2022-11-02 21:07:26,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:07:26,517 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:07:26,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:07:26,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:07:26,525 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:07:26,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:07:26" (1/1) ... [2022-11-02 21:07:26,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e07fad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:26, skipping insertion in model container [2022-11-02 21:07:26,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:07:26" (1/1) ... [2022-11-02 21:07:26,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:07:26,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:07:26,995 WARN L230 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_09c25be6-ba4e-4290-aa69-91815baa3ef6/sv-benchmarks/c/pthread-ext/27_Boop_simple_vf.i[30297,30310] [2022-11-02 21:07:27,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:07:27,025 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:07:27,081 WARN L230 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_09c25be6-ba4e-4290-aa69-91815baa3ef6/sv-benchmarks/c/pthread-ext/27_Boop_simple_vf.i[30297,30310] [2022-11-02 21:07:27,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:07:27,131 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:07:27,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:27 WrapperNode [2022-11-02 21:07:27,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:07:27,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:07:27,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:07:27,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:07:27,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:27" (1/1) ... [2022-11-02 21:07:27,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:27" (1/1) ... [2022-11-02 21:07:27,180 INFO L138 Inliner]: procedures = 170, calls = 15, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 72 [2022-11-02 21:07:27,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:07:27,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:07:27,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:07:27,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:07:27,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:27" (1/1) ... [2022-11-02 21:07:27,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:27" (1/1) ... [2022-11-02 21:07:27,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:27" (1/1) ... [2022-11-02 21:07:27,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:27" (1/1) ... [2022-11-02 21:07:27,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:27" (1/1) ... [2022-11-02 21:07:27,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:27" (1/1) ... [2022-11-02 21:07:27,229 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:27" (1/1) ... [2022-11-02 21:07:27,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:27" (1/1) ... [2022-11-02 21:07:27,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:07:27,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:07:27,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:07:27,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:07:27,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:27" (1/1) ... [2022-11-02 21:07:27,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:07:27,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c25be6-ba4e-4290-aa69-91815baa3ef6/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:27,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c25be6-ba4e-4290-aa69-91815baa3ef6/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:07:27,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c25be6-ba4e-4290-aa69-91815baa3ef6/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:07:27,315 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-11-02 21:07:27,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-11-02 21:07:27,316 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-02 21:07:27,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-02 21:07:27,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:07:27,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:07:27,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:07:27,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:07:27,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:07:27,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:07:27,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:07:27,319 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 21:07:27,484 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:07:27,486 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:07:27,767 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:07:27,775 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:07:27,775 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-02 21:07:27,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:27 BoogieIcfgContainer [2022-11-02 21:07:27,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:07:27,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:07:27,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:07:27,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:07:27,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:07:26" (1/3) ... [2022-11-02 21:07:27,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c635e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:07:27, skipping insertion in model container [2022-11-02 21:07:27,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:27" (2/3) ... [2022-11-02 21:07:27,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c635e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:07:27, skipping insertion in model container [2022-11-02 21:07:27,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:27" (3/3) ... [2022-11-02 21:07:27,787 INFO L112 eAbstractionObserver]: Analyzing ICFG 27_Boop_simple_vf.i [2022-11-02 21:07:27,796 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 21:07:27,807 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:07:27,807 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:07:27,807 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 21:07:27,862 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 21:07:27,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 91 transitions, 192 flow [2022-11-02 21:07:28,000 INFO L130 PetriNetUnfolder]: 13/101 cut-off events. [2022-11-02 21:07:28,001 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:07:28,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 101 events. 13/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 232 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 82. Up to 4 conditions per place. [2022-11-02 21:07:28,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 91 transitions, 192 flow [2022-11-02 21:07:28,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 90 transitions, 188 flow [2022-11-02 21:07:28,036 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:07:28,045 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;@3b1dfd0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:07:28,045 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-02 21:07:28,077 INFO L130 PetriNetUnfolder]: 10/87 cut-off events. [2022-11-02 21:07:28,077 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:07:28,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:28,079 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:28,079 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:07:28,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:28,085 INFO L85 PathProgramCache]: Analyzing trace with hash 601066750, now seen corresponding path program 1 times [2022-11-02 21:07:28,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:28,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021933988] [2022-11-02 21:07:28,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:28,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:07:28,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:07:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:07:28,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:07:28,303 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:07:28,304 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-11-02 21:07:28,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-11-02 21:07:28,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-11-02 21:07:28,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-11-02 21:07:28,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:07:28,312 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-02 21:07:28,316 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 21:07:28,317 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-02 21:07:28,388 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 21:07:28,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 144 transitions, 312 flow [2022-11-02 21:07:28,421 INFO L130 PetriNetUnfolder]: 17/127 cut-off events. [2022-11-02 21:07:28,421 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 21:07:28,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 127 events. 17/127 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 305 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 136. Up to 6 conditions per place. [2022-11-02 21:07:28,424 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 144 transitions, 312 flow [2022-11-02 21:07:28,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 103 transitions, 221 flow [2022-11-02 21:07:28,428 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:07:28,429 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;@3b1dfd0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:07:28,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-02 21:07:28,450 INFO L130 PetriNetUnfolder]: 14/99 cut-off events. [2022-11-02 21:07:28,450 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-02 21:07:28,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:28,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:28,451 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 21:07:28,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash -224229865, now seen corresponding path program 1 times [2022-11-02 21:07:28,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:28,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286798218] [2022-11-02 21:07:28,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:28,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:28,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:28,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286798218] [2022-11-02 21:07:28,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286798218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:28,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:28,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:28,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88835183] [2022-11-02 21:07:28,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:28,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:07:28,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:28,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:07:28,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:07:28,589 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 144 [2022-11-02 21:07:28,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 103 transitions, 221 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:28,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 144 [2022-11-02 21:07:28,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:28,628 INFO L130 PetriNetUnfolder]: 7/98 cut-off events. [2022-11-02 21:07:28,628 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-02 21:07:28,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 98 events. 7/98 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 164 event pairs, 0 based on Foata normal form. 12/102 useless extension candidates. Maximal degree in co-relation 85. Up to 4 conditions per place. [2022-11-02 21:07:28,631 INFO L137 encePairwiseOnDemand]: 135/144 looper letters, 3 selfloop transitions, 0 changer transitions 0/88 dead transitions. [2022-11-02 21:07:28,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 88 transitions, 197 flow [2022-11-02 21:07:28,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:07:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 21:07:28,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 260 transitions. [2022-11-02 21:07:28,645 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2022-11-02 21:07:28,646 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 260 transitions. [2022-11-02 21:07:28,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 260 transitions. [2022-11-02 21:07:28,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:28,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 260 transitions. [2022-11-02 21:07:28,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 130.0) internal successors, (260), 2 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,660 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,662 INFO L175 Difference]: Start difference. First operand has 96 places, 103 transitions, 221 flow. Second operand 2 states and 260 transitions. [2022-11-02 21:07:28,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 88 transitions, 197 flow [2022-11-02 21:07:28,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 194 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-02 21:07:28,669 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 188 flow [2022-11-02 21:07:28,671 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=188, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2022-11-02 21:07:28,675 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, -7 predicate places. [2022-11-02 21:07:28,675 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 188 flow [2022-11-02 21:07:28,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:28,676 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:28,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:07:28,677 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 21:07:28,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:28,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1229913594, now seen corresponding path program 1 times [2022-11-02 21:07:28,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:28,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242459077] [2022-11-02 21:07:28,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:28,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:07:28,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:07:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:07:28,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:07:28,729 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:07:28,730 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-11-02 21:07:28,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-02 21:07:28,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-02 21:07:28,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-11-02 21:07:28,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-02 21:07:28,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:07:28,731 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-02 21:07:28,732 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 21:07:28,732 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-02 21:07:28,763 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 21:07:28,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 197 transitions, 436 flow [2022-11-02 21:07:28,792 INFO L130 PetriNetUnfolder]: 21/153 cut-off events. [2022-11-02 21:07:28,792 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-02 21:07:28,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 153 events. 21/153 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 360 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 167. Up to 8 conditions per place. [2022-11-02 21:07:28,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 197 transitions, 436 flow [2022-11-02 21:07:28,798 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 116 transitions, 256 flow [2022-11-02 21:07:28,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:07:28,800 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;@3b1dfd0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:07:28,801 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-02 21:07:28,814 INFO L130 PetriNetUnfolder]: 12/95 cut-off events. [2022-11-02 21:07:28,814 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-02 21:07:28,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:28,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:28,815 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 21:07:28,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:28,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1223320198, now seen corresponding path program 1 times [2022-11-02 21:07:28,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:28,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548571271] [2022-11-02 21:07:28,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:28,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:28,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:28,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:28,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548571271] [2022-11-02 21:07:28,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548571271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:28,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:28,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:28,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73705421] [2022-11-02 21:07:28,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:28,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:07:28,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:28,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:07:28,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:07:28,864 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 197 [2022-11-02 21:07:28,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 116 transitions, 256 flow. Second operand has 2 states, 2 states have (on average 169.5) internal successors, (339), 2 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:28,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 197 [2022-11-02 21:07:28,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:28,912 INFO L130 PetriNetUnfolder]: 9/116 cut-off events. [2022-11-02 21:07:28,915 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-02 21:07:28,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 116 events. 9/116 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 200 event pairs, 0 based on Foata normal form. 19/125 useless extension candidates. Maximal degree in co-relation 109. Up to 5 conditions per place. [2022-11-02 21:07:28,921 INFO L137 encePairwiseOnDemand]: 187/197 looper letters, 4 selfloop transitions, 0 changer transitions 0/100 dead transitions. [2022-11-02 21:07:28,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 100 transitions, 232 flow [2022-11-02 21:07:28,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:07:28,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 21:07:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 350 transitions. [2022-11-02 21:07:28,928 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8883248730964467 [2022-11-02 21:07:28,930 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 350 transitions. [2022-11-02 21:07:28,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 350 transitions. [2022-11-02 21:07:28,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:28,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 350 transitions. [2022-11-02 21:07:28,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 175.0) internal successors, (350), 2 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,938 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,938 INFO L175 Difference]: Start difference. First operand has 108 places, 116 transitions, 256 flow. Second operand 2 states and 350 transitions. [2022-11-02 21:07:28,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 100 transitions, 232 flow [2022-11-02 21:07:28,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 100 transitions, 225 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-11-02 21:07:28,943 INFO L231 Difference]: Finished difference. Result has 101 places, 100 transitions, 217 flow [2022-11-02 21:07:28,944 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=217, PETRI_PLACES=101, PETRI_TRANSITIONS=100} [2022-11-02 21:07:28,945 INFO L287 CegarLoopForPetriNet]: 108 programPoint places, -7 predicate places. [2022-11-02 21:07:28,945 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 100 transitions, 217 flow [2022-11-02 21:07:28,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 169.5) internal successors, (339), 2 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:28,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:28,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:07:28,947 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 21:07:28,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:28,948 INFO L85 PathProgramCache]: Analyzing trace with hash -971259791, now seen corresponding path program 1 times [2022-11-02 21:07:28,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:28,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111596289] [2022-11-02 21:07:28,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:28,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:29,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:29,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:29,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111596289] [2022-11-02 21:07:29,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111596289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:29,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:29,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:07:29,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600713980] [2022-11-02 21:07:29,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:29,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:29,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:29,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:29,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:29,099 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 197 [2022-11-02 21:07:29,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 100 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:29,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:29,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 197 [2022-11-02 21:07:29,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:29,242 INFO L130 PetriNetUnfolder]: 110/498 cut-off events. [2022-11-02 21:07:29,242 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-11-02 21:07:29,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 498 events. 110/498 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2614 event pairs, 14 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 704. Up to 91 conditions per place. [2022-11-02 21:07:29,250 INFO L137 encePairwiseOnDemand]: 191/197 looper letters, 11 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2022-11-02 21:07:29,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 106 transitions, 271 flow [2022-11-02 21:07:29,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2022-11-02 21:07:29,253 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8307952622673435 [2022-11-02 21:07:29,253 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 491 transitions. [2022-11-02 21:07:29,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 491 transitions. [2022-11-02 21:07:29,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:29,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 491 transitions. [2022-11-02 21:07:29,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:29,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:29,265 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:29,265 INFO L175 Difference]: Start difference. First operand has 101 places, 100 transitions, 217 flow. Second operand 3 states and 491 transitions. [2022-11-02 21:07:29,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 106 transitions, 271 flow [2022-11-02 21:07:29,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 106 transitions, 271 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 21:07:29,271 INFO L231 Difference]: Finished difference. Result has 105 places, 104 transitions, 255 flow [2022-11-02 21:07:29,272 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=105, PETRI_TRANSITIONS=104} [2022-11-02 21:07:29,274 INFO L287 CegarLoopForPetriNet]: 108 programPoint places, -3 predicate places. [2022-11-02 21:07:29,274 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 104 transitions, 255 flow [2022-11-02 21:07:29,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:29,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:29,276 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:29,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:07:29,276 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 21:07:29,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:29,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1386061371, now seen corresponding path program 1 times [2022-11-02 21:07:29,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:29,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014734142] [2022-11-02 21:07:29,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:29,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:07:29,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:07:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:07:29,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:07:29,371 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:07:29,372 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-11-02 21:07:29,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-02 21:07:29,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-02 21:07:29,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-11-02 21:07:29,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-11-02 21:07:29,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-02 21:07:29,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:07:29,374 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-02 21:07:29,375 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 21:07:29,375 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-02 21:07:29,437 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 21:07:29,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 250 transitions, 564 flow [2022-11-02 21:07:29,486 INFO L130 PetriNetUnfolder]: 25/179 cut-off events. [2022-11-02 21:07:29,487 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-02 21:07:29,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 179 events. 25/179 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 419 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 199. Up to 10 conditions per place. [2022-11-02 21:07:29,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 250 transitions, 564 flow [2022-11-02 21:07:29,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 129 transitions, 293 flow [2022-11-02 21:07:29,493 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:07:29,500 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;@3b1dfd0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:07:29,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-02 21:07:29,516 INFO L130 PetriNetUnfolder]: 12/94 cut-off events. [2022-11-02 21:07:29,516 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-02 21:07:29,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:29,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:29,517 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 21:07:29,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:29,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1755240997, now seen corresponding path program 1 times [2022-11-02 21:07:29,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:29,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260338718] [2022-11-02 21:07:29,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:29,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:29,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:29,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260338718] [2022-11-02 21:07:29,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260338718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:29,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:29,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:29,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251496536] [2022-11-02 21:07:29,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:29,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:07:29,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:29,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:07:29,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:07:29,577 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 250 [2022-11-02 21:07:29,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 129 transitions, 293 flow. Second operand has 2 states, 2 states have (on average 213.5) internal successors, (427), 2 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:29,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:29,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 250 [2022-11-02 21:07:29,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:29,613 INFO L130 PetriNetUnfolder]: 11/134 cut-off events. [2022-11-02 21:07:29,614 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-11-02 21:07:29,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 134 events. 11/134 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 228 event pairs, 0 based on Foata normal form. 27/149 useless extension candidates. Maximal degree in co-relation 134. Up to 6 conditions per place. [2022-11-02 21:07:29,616 INFO L137 encePairwiseOnDemand]: 239/250 looper letters, 5 selfloop transitions, 0 changer transitions 0/112 dead transitions. [2022-11-02 21:07:29,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 112 transitions, 269 flow [2022-11-02 21:07:29,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:07:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 21:07:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 440 transitions. [2022-11-02 21:07:29,618 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.88 [2022-11-02 21:07:29,618 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 440 transitions. [2022-11-02 21:07:29,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 440 transitions. [2022-11-02 21:07:29,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:29,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 440 transitions. [2022-11-02 21:07:29,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 220.0) internal successors, (440), 2 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:29,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:29,622 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:29,622 INFO L175 Difference]: Start difference. First operand has 120 places, 129 transitions, 293 flow. Second operand 2 states and 440 transitions. [2022-11-02 21:07:29,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 112 transitions, 269 flow [2022-11-02 21:07:29,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 112 transitions, 256 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-11-02 21:07:29,629 INFO L231 Difference]: Finished difference. Result has 113 places, 112 transitions, 246 flow [2022-11-02 21:07:29,629 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=246, PETRI_PLACES=113, PETRI_TRANSITIONS=112} [2022-11-02 21:07:29,631 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, -7 predicate places. [2022-11-02 21:07:29,631 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 112 transitions, 246 flow [2022-11-02 21:07:29,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 213.5) internal successors, (427), 2 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:29,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:29,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:29,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:07:29,632 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 21:07:29,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1518924113, now seen corresponding path program 1 times [2022-11-02 21:07:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:29,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037760935] [2022-11-02 21:07:29,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:29,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:29,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:29,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037760935] [2022-11-02 21:07:29,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037760935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:29,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:29,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:07:29,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729437751] [2022-11-02 21:07:29,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:29,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:29,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:29,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:29,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:29,722 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 250 [2022-11-02 21:07:29,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 112 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:29,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:29,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 250 [2022-11-02 21:07:29,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:29,953 INFO L130 PetriNetUnfolder]: 290/1000 cut-off events. [2022-11-02 21:07:29,954 INFO L131 PetriNetUnfolder]: For 151/151 co-relation queries the response was YES. [2022-11-02 21:07:29,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 1000 events. 290/1000 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6484 event pairs, 51 based on Foata normal form. 0/891 useless extension candidates. Maximal degree in co-relation 1523. Up to 262 conditions per place. [2022-11-02 21:07:29,974 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 14 selfloop transitions, 6 changer transitions 0/120 dead transitions. [2022-11-02 21:07:29,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 120 transitions, 317 flow [2022-11-02 21:07:29,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2022-11-02 21:07:29,976 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.824 [2022-11-02 21:07:29,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 618 transitions. [2022-11-02 21:07:29,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 618 transitions. [2022-11-02 21:07:29,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:29,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 618 transitions. [2022-11-02 21:07:29,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:29,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:29,981 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:29,981 INFO L175 Difference]: Start difference. First operand has 113 places, 112 transitions, 246 flow. Second operand 3 states and 618 transitions. [2022-11-02 21:07:29,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 120 transitions, 317 flow [2022-11-02 21:07:29,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 120 transitions, 317 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 21:07:29,985 INFO L231 Difference]: Finished difference. Result has 117 places, 117 transitions, 292 flow [2022-11-02 21:07:29,986 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=117, PETRI_TRANSITIONS=117} [2022-11-02 21:07:29,987 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2022-11-02 21:07:29,988 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 292 flow [2022-11-02 21:07:29,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:29,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:29,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:29,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:07:29,989 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 21:07:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:29,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1429903636, now seen corresponding path program 1 times [2022-11-02 21:07:29,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:29,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653301820] [2022-11-02 21:07:29,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:29,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:30,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:30,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653301820] [2022-11-02 21:07:30,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653301820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:30,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:30,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:07:30,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689747589] [2022-11-02 21:07:30,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:30,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:07:30,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:30,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:07:30,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:07:30,215 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 250 [2022-11-02 21:07:30,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:30,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:30,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 250 [2022-11-02 21:07:30,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:32,020 INFO L130 PetriNetUnfolder]: 2655/9062 cut-off events. [2022-11-02 21:07:32,020 INFO L131 PetriNetUnfolder]: For 937/1096 co-relation queries the response was YES. [2022-11-02 21:07:32,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14173 conditions, 9062 events. 2655/9062 cut-off events. For 937/1096 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 102333 event pairs, 507 based on Foata normal form. 0/8117 useless extension candidates. Maximal degree in co-relation 14164. Up to 1516 conditions per place. [2022-11-02 21:07:32,219 INFO L137 encePairwiseOnDemand]: 240/250 looper letters, 21 selfloop transitions, 16 changer transitions 0/139 dead transitions. [2022-11-02 21:07:32,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 139 transitions, 440 flow [2022-11-02 21:07:32,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:07:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 21:07:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 787 transitions. [2022-11-02 21:07:32,222 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.787 [2022-11-02 21:07:32,222 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 787 transitions. [2022-11-02 21:07:32,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 787 transitions. [2022-11-02 21:07:32,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:32,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 787 transitions. [2022-11-02 21:07:32,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 196.75) internal successors, (787), 4 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:32,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:32,228 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:32,228 INFO L175 Difference]: Start difference. First operand has 117 places, 117 transitions, 292 flow. Second operand 4 states and 787 transitions. [2022-11-02 21:07:32,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 139 transitions, 440 flow [2022-11-02 21:07:32,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 139 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:32,244 INFO L231 Difference]: Finished difference. Result has 121 places, 132 transitions, 394 flow [2022-11-02 21:07:32,245 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=394, PETRI_PLACES=121, PETRI_TRANSITIONS=132} [2022-11-02 21:07:32,246 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 1 predicate places. [2022-11-02 21:07:32,246 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 132 transitions, 394 flow [2022-11-02 21:07:32,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:32,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:32,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:32,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:07:32,247 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 21:07:32,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:32,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1423107784, now seen corresponding path program 2 times [2022-11-02 21:07:32,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:32,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121718845] [2022-11-02 21:07:32,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:32,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:32,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:32,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121718845] [2022-11-02 21:07:32,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121718845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:32,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:32,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:07:32,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044116643] [2022-11-02 21:07:32,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:32,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:32,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:32,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:32,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:32,294 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 250 [2022-11-02 21:07:32,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 132 transitions, 394 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:32,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:32,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 250 [2022-11-02 21:07:32,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:36,148 INFO L130 PetriNetUnfolder]: 4628/21779 cut-off events. [2022-11-02 21:07:36,148 INFO L131 PetriNetUnfolder]: For 2250/2508 co-relation queries the response was YES. [2022-11-02 21:07:36,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31700 conditions, 21779 events. 4628/21779 cut-off events. For 2250/2508 co-relation queries the response was YES. Maximal size of possible extension queue 1031. Compared 297229 event pairs, 434 based on Foata normal form. 0/18859 useless extension candidates. Maximal degree in co-relation 31689. Up to 1968 conditions per place. [2022-11-02 21:07:36,640 INFO L137 encePairwiseOnDemand]: 240/250 looper letters, 17 selfloop transitions, 6 changer transitions 0/138 dead transitions. [2022-11-02 21:07:36,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 138 transitions, 462 flow [2022-11-02 21:07:36,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2022-11-02 21:07:36,643 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.832 [2022-11-02 21:07:36,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 624 transitions. [2022-11-02 21:07:36,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 624 transitions. [2022-11-02 21:07:36,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:36,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 624 transitions. [2022-11-02 21:07:36,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:36,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:36,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:36,649 INFO L175 Difference]: Start difference. First operand has 121 places, 132 transitions, 394 flow. Second operand 3 states and 624 transitions. [2022-11-02 21:07:36,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 138 transitions, 462 flow [2022-11-02 21:07:36,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 138 transitions, 460 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-11-02 21:07:36,823 INFO L231 Difference]: Finished difference. Result has 125 places, 134 transitions, 428 flow [2022-11-02 21:07:36,823 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=125, PETRI_TRANSITIONS=134} [2022-11-02 21:07:36,826 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 5 predicate places. [2022-11-02 21:07:36,827 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 134 transitions, 428 flow [2022-11-02 21:07:36,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:36,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:36,828 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:36,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:07:36,829 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 21:07:36,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:36,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2059888822, now seen corresponding path program 1 times [2022-11-02 21:07:36,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:36,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376399910] [2022-11-02 21:07:36,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:36,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:07:36,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:07:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:07:36,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:07:36,894 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:07:36,894 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2022-11-02 21:07:36,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-02 21:07:36,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-02 21:07:36,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-11-02 21:07:36,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-11-02 21:07:36,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-11-02 21:07:36,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-02 21:07:36,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:07:36,896 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-11-02 21:07:36,897 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 21:07:36,897 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2022-11-02 21:07:36,945 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 21:07:36,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 269 places, 303 transitions, 696 flow [2022-11-02 21:07:36,991 INFO L130 PetriNetUnfolder]: 29/205 cut-off events. [2022-11-02 21:07:36,991 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-02 21:07:36,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 205 events. 29/205 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 477 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 232. Up to 12 conditions per place. [2022-11-02 21:07:36,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 269 places, 303 transitions, 696 flow [2022-11-02 21:07:36,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 142 transitions, 332 flow [2022-11-02 21:07:37,000 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:07:37,001 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;@3b1dfd0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:07:37,001 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-02 21:07:37,011 INFO L130 PetriNetUnfolder]: 14/100 cut-off events. [2022-11-02 21:07:37,011 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-02 21:07:37,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:37,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:37,012 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2022-11-02 21:07:37,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:37,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1192655642, now seen corresponding path program 1 times [2022-11-02 21:07:37,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:37,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347835751] [2022-11-02 21:07:37,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:37,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:37,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:37,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347835751] [2022-11-02 21:07:37,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347835751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:37,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:37,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:37,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668551322] [2022-11-02 21:07:37,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:37,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:07:37,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:37,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:07:37,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:07:37,040 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 303 [2022-11-02 21:07:37,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 142 transitions, 332 flow. Second operand has 2 states, 2 states have (on average 257.5) internal successors, (515), 2 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:37,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:37,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 303 [2022-11-02 21:07:37,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:37,082 INFO L130 PetriNetUnfolder]: 13/152 cut-off events. [2022-11-02 21:07:37,082 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-11-02 21:07:37,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 152 events. 13/152 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs, 0 based on Foata normal form. 36/174 useless extension candidates. Maximal degree in co-relation 160. Up to 7 conditions per place. [2022-11-02 21:07:37,085 INFO L137 encePairwiseOnDemand]: 291/303 looper letters, 6 selfloop transitions, 0 changer transitions 0/124 dead transitions. [2022-11-02 21:07:37,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 124 transitions, 308 flow [2022-11-02 21:07:37,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:07:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 21:07:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 530 transitions. [2022-11-02 21:07:37,087 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8745874587458746 [2022-11-02 21:07:37,088 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 530 transitions. [2022-11-02 21:07:37,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 530 transitions. [2022-11-02 21:07:37,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:37,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 530 transitions. [2022-11-02 21:07:37,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 265.0) internal successors, (530), 2 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:37,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:37,092 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:37,092 INFO L175 Difference]: Start difference. First operand has 132 places, 142 transitions, 332 flow. Second operand 2 states and 530 transitions. [2022-11-02 21:07:37,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 124 transitions, 308 flow [2022-11-02 21:07:37,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 124 transitions, 287 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-11-02 21:07:37,095 INFO L231 Difference]: Finished difference. Result has 125 places, 124 transitions, 275 flow [2022-11-02 21:07:37,096 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=275, PETRI_PLACES=125, PETRI_TRANSITIONS=124} [2022-11-02 21:07:37,097 INFO L287 CegarLoopForPetriNet]: 132 programPoint places, -7 predicate places. [2022-11-02 21:07:37,098 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 124 transitions, 275 flow [2022-11-02 21:07:37,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 257.5) internal successors, (515), 2 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:37,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:37,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:37,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:07:37,099 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2022-11-02 21:07:37,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:37,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1700465937, now seen corresponding path program 1 times [2022-11-02 21:07:37,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:37,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517792771] [2022-11-02 21:07:37,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:37,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:37,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:37,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517792771] [2022-11-02 21:07:37,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517792771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:37,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:37,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:07:37,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801880420] [2022-11-02 21:07:37,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:37,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:37,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:37,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:37,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:37,148 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 303 [2022-11-02 21:07:37,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 124 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:37,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:37,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 303 [2022-11-02 21:07:37,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:37,524 INFO L130 PetriNetUnfolder]: 712/1960 cut-off events. [2022-11-02 21:07:37,524 INFO L131 PetriNetUnfolder]: For 337/337 co-relation queries the response was YES. [2022-11-02 21:07:37,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3206 conditions, 1960 events. 712/1960 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 14100 event pairs, 162 based on Foata normal form. 0/1761 useless extension candidates. Maximal degree in co-relation 3198. Up to 679 conditions per place. [2022-11-02 21:07:37,665 INFO L137 encePairwiseOnDemand]: 295/303 looper letters, 17 selfloop transitions, 7 changer transitions 0/134 dead transitions. [2022-11-02 21:07:37,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 134 transitions, 363 flow [2022-11-02 21:07:37,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 745 transitions. [2022-11-02 21:07:37,668 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8195819581958196 [2022-11-02 21:07:37,668 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 745 transitions. [2022-11-02 21:07:37,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 745 transitions. [2022-11-02 21:07:37,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:37,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 745 transitions. [2022-11-02 21:07:37,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:37,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:37,674 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:37,675 INFO L175 Difference]: Start difference. First operand has 125 places, 124 transitions, 275 flow. Second operand 3 states and 745 transitions. [2022-11-02 21:07:37,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 134 transitions, 363 flow [2022-11-02 21:07:37,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 134 transitions, 363 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 21:07:37,679 INFO L231 Difference]: Finished difference. Result has 129 places, 130 transitions, 329 flow [2022-11-02 21:07:37,680 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=129, PETRI_TRANSITIONS=130} [2022-11-02 21:07:37,681 INFO L287 CegarLoopForPetriNet]: 132 programPoint places, -3 predicate places. [2022-11-02 21:07:37,681 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 130 transitions, 329 flow [2022-11-02 21:07:37,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:37,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:37,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:37,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:07:37,682 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2022-11-02 21:07:37,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:37,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1172415374, now seen corresponding path program 1 times [2022-11-02 21:07:37,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:37,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818815786] [2022-11-02 21:07:37,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:37,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:37,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:37,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818815786] [2022-11-02 21:07:37,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818815786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:37,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:37,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:07:37,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548854893] [2022-11-02 21:07:37,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:37,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:37,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:37,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:37,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:37,731 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 303 [2022-11-02 21:07:37,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 130 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:37,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:37,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 303 [2022-11-02 21:07:37,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:41,597 INFO L130 PetriNetUnfolder]: 6348/21743 cut-off events. [2022-11-02 21:07:41,597 INFO L131 PetriNetUnfolder]: For 1373/1549 co-relation queries the response was YES. [2022-11-02 21:07:41,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32466 conditions, 21743 events. 6348/21743 cut-off events. For 1373/1549 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 275039 event pairs, 1015 based on Foata normal form. 0/18956 useless extension candidates. Maximal degree in co-relation 32456. Up to 3416 conditions per place. [2022-11-02 21:07:41,940 INFO L137 encePairwiseOnDemand]: 291/303 looper letters, 21 selfloop transitions, 7 changer transitions 0/140 dead transitions. [2022-11-02 21:07:41,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 140 transitions, 428 flow [2022-11-02 21:07:41,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2022-11-02 21:07:41,944 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8283828382838284 [2022-11-02 21:07:41,944 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 753 transitions. [2022-11-02 21:07:41,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 753 transitions. [2022-11-02 21:07:41,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:41,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 753 transitions. [2022-11-02 21:07:41,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:41,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:41,951 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:41,951 INFO L175 Difference]: Start difference. First operand has 129 places, 130 transitions, 329 flow. Second operand 3 states and 753 transitions. [2022-11-02 21:07:41,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 140 transitions, 428 flow [2022-11-02 21:07:41,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 140 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:41,968 INFO L231 Difference]: Finished difference. Result has 131 places, 135 transitions, 373 flow [2022-11-02 21:07:41,969 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=373, PETRI_PLACES=131, PETRI_TRANSITIONS=135} [2022-11-02 21:07:41,970 INFO L287 CegarLoopForPetriNet]: 132 programPoint places, -1 predicate places. [2022-11-02 21:07:41,970 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 135 transitions, 373 flow [2022-11-02 21:07:41,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:41,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:41,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:41,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:07:41,971 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2022-11-02 21:07:41,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:41,972 INFO L85 PathProgramCache]: Analyzing trace with hash 318984116, now seen corresponding path program 2 times [2022-11-02 21:07:41,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:41,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359188460] [2022-11-02 21:07:41,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:41,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:42,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:42,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359188460] [2022-11-02 21:07:42,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359188460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:42,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:42,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:07:42,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060805352] [2022-11-02 21:07:42,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:42,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:07:42,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:42,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:07:42,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:07:42,098 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 303 [2022-11-02 21:07:42,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 135 transitions, 373 flow. Second operand has 4 states, 4 states have (on average 226.75) internal successors, (907), 4 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:42,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:42,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 303 [2022-11-02 21:07:42,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:49,332 INFO L130 PetriNetUnfolder]: 13779/45620 cut-off events. [2022-11-02 21:07:49,333 INFO L131 PetriNetUnfolder]: For 3270/3270 co-relation queries the response was YES. [2022-11-02 21:07:49,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68228 conditions, 45620 events. 13779/45620 cut-off events. For 3270/3270 co-relation queries the response was YES. Maximal size of possible extension queue 2064. Compared 624414 event pairs, 2292 based on Foata normal form. 0/39031 useless extension candidates. Maximal degree in co-relation 68217. Up to 6869 conditions per place. [2022-11-02 21:07:50,476 INFO L137 encePairwiseOnDemand]: 293/303 looper letters, 25 selfloop transitions, 16 changer transitions 0/159 dead transitions. [2022-11-02 21:07:50,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 159 transitions, 543 flow [2022-11-02 21:07:50,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:07:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 21:07:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 943 transitions. [2022-11-02 21:07:50,479 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.778052805280528 [2022-11-02 21:07:50,479 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 943 transitions. [2022-11-02 21:07:50,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 943 transitions. [2022-11-02 21:07:50,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:50,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 943 transitions. [2022-11-02 21:07:50,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 235.75) internal successors, (943), 4 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:50,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:50,485 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:50,485 INFO L175 Difference]: Start difference. First operand has 131 places, 135 transitions, 373 flow. Second operand 4 states and 943 transitions. [2022-11-02 21:07:50,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 159 transitions, 543 flow [2022-11-02 21:07:50,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 159 transitions, 529 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:50,498 INFO L231 Difference]: Finished difference. Result has 135 places, 150 transitions, 473 flow [2022-11-02 21:07:50,498 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=473, PETRI_PLACES=135, PETRI_TRANSITIONS=150} [2022-11-02 21:07:50,499 INFO L287 CegarLoopForPetriNet]: 132 programPoint places, 3 predicate places. [2022-11-02 21:07:50,500 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 150 transitions, 473 flow [2022-11-02 21:07:50,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 226.75) internal successors, (907), 4 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:50,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:50,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:50,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:07:50,501 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2022-11-02 21:07:50,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:50,502 INFO L85 PathProgramCache]: Analyzing trace with hash 803676169, now seen corresponding path program 1 times [2022-11-02 21:07:50,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:50,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509208305] [2022-11-02 21:07:50,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:50,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:50,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:50,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509208305] [2022-11-02 21:07:50,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509208305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:50,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:50,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:07:50,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655791937] [2022-11-02 21:07:50,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:50,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:07:50,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:50,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:07:50,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:07:50,591 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 303 [2022-11-02 21:07:50,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 150 transitions, 473 flow. Second operand has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:50,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:50,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 303 [2022-11-02 21:07:50,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:08:14,638 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] L702-1-->L703-1: Formula: (= v_~usecount~0_4 (+ v_~usecount~0_3 1)) InVars {~usecount~0=v_~usecount~0_4} OutVars{~usecount~0=v_~usecount~0_3} AuxVars[] AssignedVars[~usecount~0][130], [thr2Thread3of5ForFork0InUse, thr2Thread4of5ForFork0InUse, 114#L694true, thr2Thread5of5ForFork0InUse, Black: 289#(= ~usecount~0 0), Black: 290#(and (<= 1 ~usecount~0) (<= ~usecount~0 1)), thr1Thread1of5ForFork1InUse, 73#L694true, 77#L694true, 131#L746-6true, 183#L703-1true, 297#(= 1 ~release_thr1~0), 124#L694true, Black: 277#(= ~flag1~0 0), 28#L698true, thr2Thread1of5ForFork0InUse, 272#true, thr2Thread2of5ForFork0InUse, Black: 283#(= 0 ~release_thr1~0), 287#true]) [2022-11-02 21:08:14,638 INFO L383 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-11-02 21:08:14,638 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-02 21:08:14,638 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-02 21:08:14,638 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-02 21:08:18,146 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1138] L697-->L698: Formula: (= v_~flag1~0_1 1) InVars {} OutVars{~flag1~0=v_~flag1~0_1} AuxVars[] AssignedVars[~flag1~0][145], [thr2Thread3of5ForFork0InUse, thr2Thread4of5ForFork0InUse, thr2Thread5of5ForFork0InUse, Black: 289#(= ~usecount~0 0), Black: 287#true, thr1Thread1of5ForFork1InUse, 107#L713true, 131#L746-6true, 290#(and (<= 1 ~usecount~0) (<= ~usecount~0 1)), 209#L698true, 115#L698true, 297#(= 1 ~release_thr1~0), 90#L698true, Black: 277#(= ~flag1~0 0), 28#L698true, thr2Thread1of5ForFork0InUse, 272#true, 68#L692-3true, thr2Thread2of5ForFork0InUse, Black: 283#(= 0 ~release_thr1~0)]) [2022-11-02 21:08:18,147 INFO L383 tUnfolder$Statistics]: this new event has 103 ancestors and is cut-off event [2022-11-02 21:08:18,147 INFO L386 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2022-11-02 21:08:18,147 INFO L386 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2022-11-02 21:08:18,147 INFO L386 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2022-11-02 21:08:24,824 INFO L130 PetriNetUnfolder]: 65984/190082 cut-off events. [2022-11-02 21:08:24,824 INFO L131 PetriNetUnfolder]: For 48058/49599 co-relation queries the response was YES. [2022-11-02 21:08:26,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346736 conditions, 190082 events. 65984/190082 cut-off events. For 48058/49599 co-relation queries the response was YES. Maximal size of possible extension queue 7434. Compared 2926573 event pairs, 12022 based on Foata normal form. 0/169159 useless extension candidates. Maximal degree in co-relation 346723. Up to 28833 conditions per place. [2022-11-02 21:08:27,924 INFO L137 encePairwiseOnDemand]: 293/303 looper letters, 36 selfloop transitions, 4 changer transitions 0/162 dead transitions. [2022-11-02 21:08:27,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 162 transitions, 620 flow [2022-11-02 21:08:27,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:08:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 21:08:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 991 transitions. [2022-11-02 21:08:27,928 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8176567656765676 [2022-11-02 21:08:27,928 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 991 transitions. [2022-11-02 21:08:27,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 991 transitions. [2022-11-02 21:08:27,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:27,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 991 transitions. [2022-11-02 21:08:27,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 247.75) internal successors, (991), 4 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:27,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:27,936 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:27,936 INFO L175 Difference]: Start difference. First operand has 135 places, 150 transitions, 473 flow. Second operand 4 states and 991 transitions. [2022-11-02 21:08:27,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 162 transitions, 620 flow [2022-11-02 21:08:39,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 162 transitions, 620 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 21:08:39,651 INFO L231 Difference]: Finished difference. Result has 140 places, 148 transitions, 482 flow [2022-11-02 21:08:39,651 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=482, PETRI_PLACES=140, PETRI_TRANSITIONS=148} [2022-11-02 21:08:39,652 INFO L287 CegarLoopForPetriNet]: 132 programPoint places, 8 predicate places. [2022-11-02 21:08:39,652 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 148 transitions, 482 flow [2022-11-02 21:08:39,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:39,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:39,653 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:39,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:08:39,653 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2022-11-02 21:08:39,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:39,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1110948404, now seen corresponding path program 1 times [2022-11-02 21:08:39,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:39,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652940293] [2022-11-02 21:08:39,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:39,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:08:39,676 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:08:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:08:39,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:08:39,693 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:08:39,694 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2022-11-02 21:08:39,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-11-02 21:08:39,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining) [2022-11-02 21:08:39,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-11-02 21:08:39,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-11-02 21:08:39,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-11-02 21:08:39,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2022-11-02 21:08:39,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2022-11-02 21:08:39,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:08:39,696 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-11-02 21:08:39,696 WARN L233 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 21:08:39,697 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2022-11-02 21:08:39,739 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 21:08:39,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 315 places, 356 transitions, 832 flow [2022-11-02 21:08:39,772 INFO L130 PetriNetUnfolder]: 33/231 cut-off events. [2022-11-02 21:08:39,772 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-11-02 21:08:39,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 231 events. 33/231 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 528 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 266. Up to 14 conditions per place. [2022-11-02 21:08:39,776 INFO L82 GeneralOperation]: Start removeDead. Operand has 315 places, 356 transitions, 832 flow [2022-11-02 21:08:39,778 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 155 transitions, 373 flow [2022-11-02 21:08:39,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:08:39,779 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;@3b1dfd0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:08:39,780 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-11-02 21:08:39,788 INFO L130 PetriNetUnfolder]: 15/102 cut-off events. [2022-11-02 21:08:39,788 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-02 21:08:39,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:39,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:39,788 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:08:39,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:39,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1795830455, now seen corresponding path program 1 times [2022-11-02 21:08:39,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:39,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74229850] [2022-11-02 21:08:39,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:39,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:39,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:39,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74229850] [2022-11-02 21:08:39,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74229850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:39,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:39,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:08:39,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458583302] [2022-11-02 21:08:39,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:39,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:08:39,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:39,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:08:39,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:08:39,811 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 356 [2022-11-02 21:08:39,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 155 transitions, 373 flow. Second operand has 2 states, 2 states have (on average 301.5) internal successors, (603), 2 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:39,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:39,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 356 [2022-11-02 21:08:39,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:08:39,845 INFO L130 PetriNetUnfolder]: 15/170 cut-off events. [2022-11-02 21:08:39,845 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-11-02 21:08:39,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 170 events. 15/170 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 277 event pairs, 0 based on Foata normal form. 46/200 useless extension candidates. Maximal degree in co-relation 187. Up to 8 conditions per place. [2022-11-02 21:08:39,848 INFO L137 encePairwiseOnDemand]: 343/356 looper letters, 7 selfloop transitions, 0 changer transitions 0/136 dead transitions. [2022-11-02 21:08:39,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 136 transitions, 349 flow [2022-11-02 21:08:39,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:08:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 21:08:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 620 transitions. [2022-11-02 21:08:39,851 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8707865168539326 [2022-11-02 21:08:39,851 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 620 transitions. [2022-11-02 21:08:39,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 620 transitions. [2022-11-02 21:08:39,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:39,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 620 transitions. [2022-11-02 21:08:39,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 310.0) internal successors, (620), 2 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:39,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 356.0) internal successors, (1068), 3 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:39,855 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 356.0) internal successors, (1068), 3 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:39,856 INFO L175 Difference]: Start difference. First operand has 144 places, 155 transitions, 373 flow. Second operand 2 states and 620 transitions. [2022-11-02 21:08:39,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 136 transitions, 349 flow [2022-11-02 21:08:39,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 136 transitions, 318 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-11-02 21:08:39,859 INFO L231 Difference]: Finished difference. Result has 137 places, 136 transitions, 304 flow [2022-11-02 21:08:39,859 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=304, PETRI_PLACES=137, PETRI_TRANSITIONS=136} [2022-11-02 21:08:39,860 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, -7 predicate places. [2022-11-02 21:08:39,861 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 136 transitions, 304 flow [2022-11-02 21:08:39,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 301.5) internal successors, (603), 2 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:39,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:39,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:39,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:08:39,862 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:08:39,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:39,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1430613377, now seen corresponding path program 1 times [2022-11-02 21:08:39,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:39,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568192833] [2022-11-02 21:08:39,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:39,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:39,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:39,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568192833] [2022-11-02 21:08:39,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568192833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:39,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:39,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:08:39,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362288882] [2022-11-02 21:08:39,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:39,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:08:39,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:39,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:08:39,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:08:39,913 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 356 [2022-11-02 21:08:39,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 136 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:39,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:39,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 356 [2022-11-02 21:08:39,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:08:40,346 INFO L130 PetriNetUnfolder]: 1680/3858 cut-off events. [2022-11-02 21:08:40,346 INFO L131 PetriNetUnfolder]: For 715/715 co-relation queries the response was YES. [2022-11-02 21:08:40,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6682 conditions, 3858 events. 1680/3858 cut-off events. For 715/715 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 28894 event pairs, 467 based on Foata normal form. 0/3497 useless extension candidates. Maximal degree in co-relation 6673. Up to 1654 conditions per place. [2022-11-02 21:08:40,533 INFO L137 encePairwiseOnDemand]: 347/356 looper letters, 20 selfloop transitions, 8 changer transitions 0/148 dead transitions. [2022-11-02 21:08:40,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 148 transitions, 409 flow [2022-11-02 21:08:40,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:08:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:08:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2022-11-02 21:08:40,541 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8164794007490637 [2022-11-02 21:08:40,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 872 transitions. [2022-11-02 21:08:40,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 872 transitions. [2022-11-02 21:08:40,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:40,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 872 transitions. [2022-11-02 21:08:40,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:40,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:40,549 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:40,549 INFO L175 Difference]: Start difference. First operand has 137 places, 136 transitions, 304 flow. Second operand 3 states and 872 transitions. [2022-11-02 21:08:40,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 148 transitions, 409 flow [2022-11-02 21:08:40,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 148 transitions, 409 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 21:08:40,552 INFO L231 Difference]: Finished difference. Result has 141 places, 143 transitions, 366 flow [2022-11-02 21:08:40,553 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=141, PETRI_TRANSITIONS=143} [2022-11-02 21:08:40,553 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, -3 predicate places. [2022-11-02 21:08:40,553 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 143 transitions, 366 flow [2022-11-02 21:08:40,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:40,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:40,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:40,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:08:40,555 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:08:40,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:40,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1556241143, now seen corresponding path program 1 times [2022-11-02 21:08:40,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:40,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332081137] [2022-11-02 21:08:40,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:40,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:40,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:40,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332081137] [2022-11-02 21:08:40,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332081137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:40,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:40,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:08:40,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461771147] [2022-11-02 21:08:40,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:40,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:08:40,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:40,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:08:40,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:08:40,645 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 356 [2022-11-02 21:08:40,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 143 transitions, 366 flow. Second operand has 4 states, 4 states have (on average 264.75) internal successors, (1059), 4 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:40,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:40,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 356 [2022-11-02 21:08:40,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand