./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8 --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 ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 --- 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-e04fb08 [2022-11-16 11:05:21,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:05:21,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:05:21,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:05:21,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:05:21,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:05:21,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:05:21,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:05:21,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:05:21,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:05:21,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:05:21,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:05:21,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:05:21,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:05:21,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:05:21,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:05:21,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:05:21,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:05:21,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:05:21,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:05:21,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:05:21,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:05:21,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:05:21,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:05:21,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:05:21,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:05:21,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:05:21,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:05:21,437 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:05:21,438 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:05:21,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:05:21,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:05:21,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:05:21,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:05:21,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:05:21,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:05:21,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:05:21,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:05:21,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:05:21,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:05:21,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:05:21,450 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:05:21,493 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:05:21,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:05:21,496 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:05:21,497 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:05:21,498 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:05:21,498 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:05:21,499 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:05:21,499 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:05:21,500 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:05:21,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:05:21,501 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:05:21,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:05:21,502 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:05:21,502 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:05:21,502 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:05:21,503 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:05:21,503 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:05:21,503 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:05:21,503 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:05:21,504 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:05:21,504 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:05:21,504 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:05:21,504 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:05:21,505 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:05:21,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:05:21,505 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:05:21,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:05:21,507 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:05:21,508 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:05:21,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:05:21,508 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:05:21,508 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:05:21,509 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:05:21,509 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_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/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_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8 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 -> ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 [2022-11-16 11:05:21,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:05:21,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:05:21,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:05:21,896 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:05:21,897 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:05:21,899 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2022-11-16 11:05:21,972 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/data/f58ad2739/e0dbc503eedf4e39a94e6d2df7faa1a7/FLAG366309b44 [2022-11-16 11:05:22,594 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:05:22,594 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2022-11-16 11:05:22,613 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/data/f58ad2739/e0dbc503eedf4e39a94e6d2df7faa1a7/FLAG366309b44 [2022-11-16 11:05:22,846 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/data/f58ad2739/e0dbc503eedf4e39a94e6d2df7faa1a7 [2022-11-16 11:05:22,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:05:22,852 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:05:22,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:05:22,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:05:22,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:05:22,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:05:22" (1/1) ... [2022-11-16 11:05:22,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15df43a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:22, skipping insertion in model container [2022-11-16 11:05:22,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:05:22" (1/1) ... [2022-11-16 11:05:22,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:05:22,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:05:23,328 WARN L229 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_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i[30176,30189] [2022-11-16 11:05:23,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:05:23,379 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:05:23,429 WARN L229 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_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i[30176,30189] [2022-11-16 11:05:23,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:05:23,474 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:05:23,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:23 WrapperNode [2022-11-16 11:05:23,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:05:23,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:05:23,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:05:23,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:05:23,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:23" (1/1) ... [2022-11-16 11:05:23,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:23" (1/1) ... [2022-11-16 11:05:23,536 INFO L138 Inliner]: procedures = 170, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 141 [2022-11-16 11:05:23,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:05:23,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:05:23,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:05:23,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:05:23,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:23" (1/1) ... [2022-11-16 11:05:23,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:23" (1/1) ... [2022-11-16 11:05:23,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:23" (1/1) ... [2022-11-16 11:05:23,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:23" (1/1) ... [2022-11-16 11:05:23,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:23" (1/1) ... [2022-11-16 11:05:23,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:23" (1/1) ... [2022-11-16 11:05:23,583 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:23" (1/1) ... [2022-11-16 11:05:23,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:23" (1/1) ... [2022-11-16 11:05:23,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:05:23,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:05:23,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:05:23,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:05:23,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:23" (1/1) ... [2022-11-16 11:05:23,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:05:23,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:23,641 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:05:23,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:05:23,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:05:23,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:05:23,685 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-16 11:05:23,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:05:23,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:05:23,686 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-16 11:05:23,686 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-16 11:05:23,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:05:23,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:05:23,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:05:23,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:05:23,691 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:05:23,873 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:05:23,875 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:05:24,225 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:05:24,232 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:05:24,233 INFO L300 CfgBuilder]: Removed 18 assume(true) statements. [2022-11-16 11:05:24,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:05:24 BoogieIcfgContainer [2022-11-16 11:05:24,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:05:24,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:05:24,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:05:24,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:05:24,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:05:22" (1/3) ... [2022-11-16 11:05:24,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b6dad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:05:24, skipping insertion in model container [2022-11-16 11:05:24,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:23" (2/3) ... [2022-11-16 11:05:24,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b6dad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:05:24, skipping insertion in model container [2022-11-16 11:05:24,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:05:24" (3/3) ... [2022-11-16 11:05:24,257 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_60-invariant_racefree.i [2022-11-16 11:05:24,266 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:05:24,282 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:05:24,282 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 11:05:24,282 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:05:24,394 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-16 11:05:24,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 146 transitions, 300 flow [2022-11-16 11:05:24,559 INFO L130 PetriNetUnfolder]: 33/204 cut-off events. [2022-11-16 11:05:24,559 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 11:05:24,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 204 events. 33/204 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 671 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 110. Up to 6 conditions per place. [2022-11-16 11:05:24,570 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 146 transitions, 300 flow [2022-11-16 11:05:24,575 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 141 transitions, 287 flow [2022-11-16 11:05:24,590 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:05:24,596 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;@6f37622c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:05:24,597 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-16 11:05:24,616 INFO L130 PetriNetUnfolder]: 10/98 cut-off events. [2022-11-16 11:05:24,616 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:05:24,616 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:24,617 INFO L209 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] [2022-11-16 11:05:24,618 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 11:05:24,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:24,623 INFO L85 PathProgramCache]: Analyzing trace with hash 240493146, now seen corresponding path program 1 times [2022-11-16 11:05:24,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:24,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293029721] [2022-11-16 11:05:24,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:24,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:24,836 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-16 11:05:24,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:24,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293029721] [2022-11-16 11:05:24,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293029721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:24,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:24,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:05:24,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641671648] [2022-11-16 11:05:24,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:24,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:05:24,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:24,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:05:24,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:05:24,894 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 146 [2022-11-16 11:05:24,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 141 transitions, 287 flow. Second operand has 2 states, 2 states have (on average 123.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 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-16 11:05:24,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:24,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 146 [2022-11-16 11:05:24,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:24,979 INFO L130 PetriNetUnfolder]: 1/165 cut-off events. [2022-11-16 11:05:24,979 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 11:05:24,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 1/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 309 event pairs, 0 based on Foata normal form. 31/188 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-16 11:05:24,982 INFO L137 encePairwiseOnDemand]: 126/146 looper letters, 1 selfloop transitions, 0 changer transitions 0/119 dead transitions. [2022-11-16 11:05:24,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 119 transitions, 245 flow [2022-11-16 11:05:24,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:05:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 11:05:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 265 transitions. [2022-11-16 11:05:25,008 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9075342465753424 [2022-11-16 11:05:25,009 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 265 transitions. [2022-11-16 11:05:25,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 265 transitions. [2022-11-16 11:05:25,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:25,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 265 transitions. [2022-11-16 11:05:25,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 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-16 11:05:25,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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-16 11:05:25,034 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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-16 11:05:25,036 INFO L175 Difference]: Start difference. First operand has 123 places, 141 transitions, 287 flow. Second operand 2 states and 265 transitions. [2022-11-16 11:05:25,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 119 transitions, 245 flow [2022-11-16 11:05:25,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 119 transitions, 245 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:05:25,047 INFO L231 Difference]: Finished difference. Result has 122 places, 119 transitions, 243 flow [2022-11-16 11:05:25,050 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=243, PETRI_PLACES=122, PETRI_TRANSITIONS=119} [2022-11-16 11:05:25,056 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -1 predicate places. [2022-11-16 11:05:25,056 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 119 transitions, 243 flow [2022-11-16 11:05:25,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 123.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 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-16 11:05:25,057 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:25,057 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:25,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:05:25,058 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 11:05:25,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:25,061 INFO L85 PathProgramCache]: Analyzing trace with hash 653294572, now seen corresponding path program 1 times [2022-11-16 11:05:25,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:25,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156518948] [2022-11-16 11:05:25,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:25,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:05:25,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:05:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:05:25,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:05:25,175 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:05:25,177 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-11-16 11:05:25,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-11-16 11:05:25,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-11-16 11:05:25,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-11-16 11:05:25,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:05:25,180 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-16 11:05:25,182 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:05:25,183 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-16 11:05:25,235 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 11:05:25,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 195 transitions, 408 flow [2022-11-16 11:05:25,320 INFO L130 PetriNetUnfolder]: 57/336 cut-off events. [2022-11-16 11:05:25,322 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 11:05:25,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 336 events. 57/336 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1282 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 206. Up to 9 conditions per place. [2022-11-16 11:05:25,331 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 195 transitions, 408 flow [2022-11-16 11:05:25,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 195 transitions, 408 flow [2022-11-16 11:05:25,343 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:05:25,345 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;@6f37622c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:05:25,345 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-16 11:05:25,355 INFO L130 PetriNetUnfolder]: 10/98 cut-off events. [2022-11-16 11:05:25,358 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:05:25,371 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:25,372 INFO L209 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] [2022-11-16 11:05:25,372 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-16 11:05:25,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:25,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1100514403, now seen corresponding path program 1 times [2022-11-16 11:05:25,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:25,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466867873] [2022-11-16 11:05:25,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:25,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:25,488 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-16 11:05:25,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:25,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466867873] [2022-11-16 11:05:25,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466867873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:25,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:25,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:05:25,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395815972] [2022-11-16 11:05:25,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:25,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:05:25,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:25,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:05:25,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:05:25,500 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 195 [2022-11-16 11:05:25,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 195 transitions, 408 flow. Second operand has 2 states, 2 states have (on average 160.0) internal successors, (320), 2 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:05:25,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:25,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 195 [2022-11-16 11:05:25,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:25,583 INFO L130 PetriNetUnfolder]: 5/279 cut-off events. [2022-11-16 11:05:25,584 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-16 11:05:25,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 279 events. 5/279 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 815 event pairs, 0 based on Foata normal form. 73/338 useless extension candidates. Maximal degree in co-relation 174. Up to 7 conditions per place. [2022-11-16 11:05:25,586 INFO L137 encePairwiseOnDemand]: 166/195 looper letters, 4 selfloop transitions, 0 changer transitions 0/163 dead transitions. [2022-11-16 11:05:25,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 163 transitions, 352 flow [2022-11-16 11:05:25,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:05:25,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 11:05:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 351 transitions. [2022-11-16 11:05:25,591 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9 [2022-11-16 11:05:25,592 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 351 transitions. [2022-11-16 11:05:25,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 351 transitions. [2022-11-16 11:05:25,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:25,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 351 transitions. [2022-11-16 11:05:25,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 175.5) internal successors, (351), 2 states have internal predecessors, (351), 0 states have call successors, (0), 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-16 11:05:25,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 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-16 11:05:25,598 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 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-16 11:05:25,598 INFO L175 Difference]: Start difference. First operand has 167 places, 195 transitions, 408 flow. Second operand 2 states and 351 transitions. [2022-11-16 11:05:25,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 163 transitions, 352 flow [2022-11-16 11:05:25,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 352 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:05:25,607 INFO L231 Difference]: Finished difference. Result has 165 places, 163 transitions, 344 flow [2022-11-16 11:05:25,608 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=344, PETRI_PLACES=165, PETRI_TRANSITIONS=163} [2022-11-16 11:05:25,609 INFO L288 CegarLoopForPetriNet]: 167 programPoint places, -2 predicate places. [2022-11-16 11:05:25,609 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 163 transitions, 344 flow [2022-11-16 11:05:25,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 160.0) internal successors, (320), 2 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:05:25,610 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:25,610 INFO L209 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] [2022-11-16 11:05:25,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:05:25,610 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-16 11:05:25,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:25,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1703677742, now seen corresponding path program 1 times [2022-11-16 11:05:25,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:25,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895144499] [2022-11-16 11:05:25,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:25,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:25,861 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-16 11:05:25,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:25,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895144499] [2022-11-16 11:05:25,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895144499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:25,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:25,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:05:25,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268296126] [2022-11-16 11:05:25,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:25,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:05:25,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:25,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:05:25,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:05:25,866 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 195 [2022-11-16 11:05:25,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 163 transitions, 344 flow. Second operand has 5 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 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-16 11:05:25,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:25,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 195 [2022-11-16 11:05:25,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:27,193 INFO L130 PetriNetUnfolder]: 1287/6396 cut-off events. [2022-11-16 11:05:27,194 INFO L131 PetriNetUnfolder]: For 339/339 co-relation queries the response was YES. [2022-11-16 11:05:27,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8783 conditions, 6396 events. 1287/6396 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 70628 event pairs, 499 based on Foata normal form. 0/6003 useless extension candidates. Maximal degree in co-relation 8778. Up to 1001 conditions per place. [2022-11-16 11:05:27,234 INFO L137 encePairwiseOnDemand]: 180/195 looper letters, 94 selfloop transitions, 26 changer transitions 3/258 dead transitions. [2022-11-16 11:05:27,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 258 transitions, 826 flow [2022-11-16 11:05:27,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:05:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:05:27,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1344 transitions. [2022-11-16 11:05:27,238 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7658119658119659 [2022-11-16 11:05:27,239 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1344 transitions. [2022-11-16 11:05:27,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1344 transitions. [2022-11-16 11:05:27,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:27,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1344 transitions. [2022-11-16 11:05:27,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 149.33333333333334) internal successors, (1344), 9 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:05:27,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 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-16 11:05:27,249 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 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-16 11:05:27,250 INFO L175 Difference]: Start difference. First operand has 165 places, 163 transitions, 344 flow. Second operand 9 states and 1344 transitions. [2022-11-16 11:05:27,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 258 transitions, 826 flow [2022-11-16 11:05:27,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 258 transitions, 826 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:05:27,266 INFO L231 Difference]: Finished difference. Result has 180 places, 189 transitions, 551 flow [2022-11-16 11:05:27,266 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=551, PETRI_PLACES=180, PETRI_TRANSITIONS=189} [2022-11-16 11:05:27,269 INFO L288 CegarLoopForPetriNet]: 167 programPoint places, 13 predicate places. [2022-11-16 11:05:27,269 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 189 transitions, 551 flow [2022-11-16 11:05:27,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 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-16 11:05:27,270 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:27,271 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1] [2022-11-16 11:05:27,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:05:27,271 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-16 11:05:27,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:27,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1080746650, now seen corresponding path program 1 times [2022-11-16 11:05:27,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:27,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437668896] [2022-11-16 11:05:27,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:27,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:05:27,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:05:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:05:27,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:05:27,397 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:05:27,398 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-11-16 11:05:27,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-16 11:05:27,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-11-16 11:05:27,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-11-16 11:05:27,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-16 11:05:27,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:05:27,402 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-16 11:05:27,403 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:05:27,403 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-16 11:05:27,450 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 11:05:27,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 244 transitions, 518 flow [2022-11-16 11:05:27,548 INFO L130 PetriNetUnfolder]: 86/501 cut-off events. [2022-11-16 11:05:27,548 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-16 11:05:27,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 501 events. 86/501 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2001 event pairs, 1 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 344. Up to 16 conditions per place. [2022-11-16 11:05:27,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 244 transitions, 518 flow [2022-11-16 11:05:27,559 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 244 transitions, 518 flow [2022-11-16 11:05:27,561 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:05:27,562 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;@6f37622c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:05:27,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 11:05:27,572 INFO L130 PetriNetUnfolder]: 10/98 cut-off events. [2022-11-16 11:05:27,572 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:05:27,573 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:27,573 INFO L209 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] [2022-11-16 11:05:27,574 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-16 11:05:27,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:27,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2095703407, now seen corresponding path program 1 times [2022-11-16 11:05:27,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:27,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455162122] [2022-11-16 11:05:27,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:27,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:27,627 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-16 11:05:27,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:27,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455162122] [2022-11-16 11:05:27,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455162122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:27,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:27,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:05:27,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880694697] [2022-11-16 11:05:27,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:27,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:05:27,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:27,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:05:27,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:05:27,631 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 244 [2022-11-16 11:05:27,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 244 transitions, 518 flow. Second operand has 2 states, 2 states have (on average 197.0) internal successors, (394), 2 states have internal predecessors, (394), 0 states have call successors, (0), 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-16 11:05:27,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:27,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 244 [2022-11-16 11:05:27,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:27,741 INFO L130 PetriNetUnfolder]: 11/419 cut-off events. [2022-11-16 11:05:27,741 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-16 11:05:27,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 419 events. 11/419 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1518 event pairs, 1 based on Foata normal form. 170/567 useless extension candidates. Maximal degree in co-relation 293. Up to 16 conditions per place. [2022-11-16 11:05:27,746 INFO L137 encePairwiseOnDemand]: 206/244 looper letters, 6 selfloop transitions, 0 changer transitions 0/202 dead transitions. [2022-11-16 11:05:27,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 202 transitions, 446 flow [2022-11-16 11:05:27,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:05:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 11:05:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 436 transitions. [2022-11-16 11:05:27,748 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8934426229508197 [2022-11-16 11:05:27,748 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 436 transitions. [2022-11-16 11:05:27,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 436 transitions. [2022-11-16 11:05:27,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:27,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 436 transitions. [2022-11-16 11:05:27,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 218.0) internal successors, (436), 2 states have internal predecessors, (436), 0 states have call successors, (0), 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-16 11:05:27,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 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-16 11:05:27,752 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 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-16 11:05:27,752 INFO L175 Difference]: Start difference. First operand has 207 places, 244 transitions, 518 flow. Second operand 2 states and 436 transitions. [2022-11-16 11:05:27,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 202 transitions, 446 flow [2022-11-16 11:05:27,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 202 transitions, 446 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:05:27,757 INFO L231 Difference]: Finished difference. Result has 204 places, 202 transitions, 434 flow [2022-11-16 11:05:27,757 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=434, PETRI_PLACES=204, PETRI_TRANSITIONS=202} [2022-11-16 11:05:27,759 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, -3 predicate places. [2022-11-16 11:05:27,760 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 202 transitions, 434 flow [2022-11-16 11:05:27,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 197.0) internal successors, (394), 2 states have internal predecessors, (394), 0 states have call successors, (0), 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-16 11:05:27,760 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:27,760 INFO L209 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] [2022-11-16 11:05:27,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:05:27,761 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-16 11:05:27,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:27,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1306727645, now seen corresponding path program 1 times [2022-11-16 11:05:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:27,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203844128] [2022-11-16 11:05:27,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:27,925 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-16 11:05:27,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:27,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203844128] [2022-11-16 11:05:27,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203844128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:27,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:27,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:05:27,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406342148] [2022-11-16 11:05:27,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:27,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:05:27,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:27,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:05:27,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:05:27,930 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 244 [2022-11-16 11:05:27,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 202 transitions, 434 flow. Second operand has 5 states, 5 states have (on average 166.4) internal successors, (832), 5 states have internal predecessors, (832), 0 states have call successors, (0), 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-16 11:05:27,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:27,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 244 [2022-11-16 11:05:27,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:37,090 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][320], [210#true, 71#L716-5true, t_funThread1of3ForFork0InUse, 215#(= ~x~0 0), t_funThread2of3ForFork0NotInUse, 188#L702-7true, t_funThread3of3ForFork0NotInUse]) [2022-11-16 11:05:37,091 INFO L383 tUnfolder$Statistics]: this new event has 144 ancestors and is cut-off event [2022-11-16 11:05:37,091 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-16 11:05:37,091 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-16 11:05:37,091 INFO L386 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-11-16 11:05:37,145 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][321], [190#L702-4true, 210#true, 71#L716-5true, t_funThread1of3ForFork0InUse, 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse]) [2022-11-16 11:05:37,145 INFO L383 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-11-16 11:05:37,146 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-16 11:05:37,146 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-16 11:05:37,146 INFO L386 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-11-16 11:05:37,381 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][321], [60#L691true, 210#true, 71#L716-5true, t_funThread1of3ForFork0InUse, 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse]) [2022-11-16 11:05:37,382 INFO L383 tUnfolder$Statistics]: this new event has 149 ancestors and is cut-off event [2022-11-16 11:05:37,382 INFO L386 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-11-16 11:05:37,382 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-16 11:05:37,382 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-16 11:05:37,427 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][323], [96#L691-1true, 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 210#true, 71#L716-5true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse]) [2022-11-16 11:05:37,427 INFO L383 tUnfolder$Statistics]: this new event has 150 ancestors and is cut-off event [2022-11-16 11:05:37,427 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-16 11:05:37,427 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-16 11:05:37,427 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-16 11:05:37,467 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][323], [221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 210#true, 66#L691-5true, 71#L716-5true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse]) [2022-11-16 11:05:37,467 INFO L383 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-11-16 11:05:37,467 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-16 11:05:37,468 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-16 11:05:37,468 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-16 11:05:37,763 INFO L130 PetriNetUnfolder]: 18279/64896 cut-off events. [2022-11-16 11:05:37,763 INFO L131 PetriNetUnfolder]: For 5131/5131 co-relation queries the response was YES. [2022-11-16 11:05:38,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93482 conditions, 64896 events. 18279/64896 cut-off events. For 5131/5131 co-relation queries the response was YES. Maximal size of possible extension queue 2481. Compared 958027 event pairs, 6477 based on Foata normal form. 0/60938 useless extension candidates. Maximal degree in co-relation 93476. Up to 11621 conditions per place. [2022-11-16 11:05:38,313 INFO L137 encePairwiseOnDemand]: 225/244 looper letters, 151 selfloop transitions, 40 changer transitions 0/356 dead transitions. [2022-11-16 11:05:38,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 356 transitions, 1205 flow [2022-11-16 11:05:38,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:05:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:05:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1687 transitions. [2022-11-16 11:05:38,320 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7682149362477231 [2022-11-16 11:05:38,321 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1687 transitions. [2022-11-16 11:05:38,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1687 transitions. [2022-11-16 11:05:38,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:38,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1687 transitions. [2022-11-16 11:05:38,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 187.44444444444446) internal successors, (1687), 9 states have internal predecessors, (1687), 0 states have call successors, (0), 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-16 11:05:38,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 0 states have call successors, (0), 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-16 11:05:38,336 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 0 states have call successors, (0), 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-16 11:05:38,336 INFO L175 Difference]: Start difference. First operand has 204 places, 202 transitions, 434 flow. Second operand 9 states and 1687 transitions. [2022-11-16 11:05:38,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 356 transitions, 1205 flow [2022-11-16 11:05:38,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 356 transitions, 1205 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:05:38,566 INFO L231 Difference]: Finished difference. Result has 220 places, 240 transitions, 764 flow [2022-11-16 11:05:38,566 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=764, PETRI_PLACES=220, PETRI_TRANSITIONS=240} [2022-11-16 11:05:38,567 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 13 predicate places. [2022-11-16 11:05:38,567 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 240 transitions, 764 flow [2022-11-16 11:05:38,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 166.4) internal successors, (832), 5 states have internal predecessors, (832), 0 states have call successors, (0), 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-16 11:05:38,572 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:38,572 INFO L209 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-16 11:05:38,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:05:38,573 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-16 11:05:38,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:38,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1152243931, now seen corresponding path program 1 times [2022-11-16 11:05:38,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:38,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585782290] [2022-11-16 11:05:38,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:38,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:38,654 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-16 11:05:38,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:38,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585782290] [2022-11-16 11:05:38,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585782290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:38,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:38,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:05:38,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545369419] [2022-11-16 11:05:38,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:38,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:05:38,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:38,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:05:38,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:05:38,664 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 244 [2022-11-16 11:05:38,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 240 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:05:38,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:38,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 244 [2022-11-16 11:05:38,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:40,827 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][226], [Black: 225#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), 235#true, Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#true, Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 216#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 210#true, Black: 223#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 217#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), 71#L716-5true, 215#(= ~x~0 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 74#L705true]) [2022-11-16 11:05:40,828 INFO L383 tUnfolder$Statistics]: this new event has 144 ancestors and is cut-off event [2022-11-16 11:05:40,828 INFO L386 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-11-16 11:05:40,828 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-16 11:05:40,828 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-16 11:05:40,865 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][226], [Black: 225#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), 235#true, Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#true, Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 216#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 190#L702-4true, 210#true, Black: 223#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 217#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), 71#L716-5true, 215#(= ~x~0 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse]) [2022-11-16 11:05:40,865 INFO L383 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-11-16 11:05:40,865 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-16 11:05:40,865 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-16 11:05:40,865 INFO L386 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-11-16 11:05:40,887 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][226], [Black: 225#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), 235#true, Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#true, Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 216#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 210#true, Black: 223#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 217#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), 71#L716-5true, 159#L706-4true, 215#(= ~x~0 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse]) [2022-11-16 11:05:40,887 INFO L383 tUnfolder$Statistics]: this new event has 150 ancestors and is cut-off event [2022-11-16 11:05:40,888 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-16 11:05:40,888 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-16 11:05:40,888 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-16 11:05:40,914 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][226], [235#true, Black: 225#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#true, Black: 215#(= ~x~0 0), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 190#L702-4true, 210#true, Black: 223#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 217#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), 71#L716-5true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 216#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))]) [2022-11-16 11:05:40,914 INFO L383 tUnfolder$Statistics]: this new event has 154 ancestors and is cut-off event [2022-11-16 11:05:40,914 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-16 11:05:40,915 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-16 11:05:40,915 INFO L386 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-11-16 11:05:40,928 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][226], [235#true, Black: 225#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#true, Black: 215#(= ~x~0 0), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 216#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 210#true, Black: 217#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), 71#L716-5true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 96#L691-1true, 223#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2022-11-16 11:05:40,928 INFO L383 tUnfolder$Statistics]: this new event has 156 ancestors and is cut-off event [2022-11-16 11:05:40,928 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-16 11:05:40,928 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-16 11:05:40,928 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-16 11:05:40,938 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][226], [235#true, Black: 225#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#true, Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 216#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 210#true, Black: 223#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 217#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), 71#L716-5true, 215#(= ~x~0 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 150#L706-12true]) [2022-11-16 11:05:40,938 INFO L383 tUnfolder$Statistics]: this new event has 157 ancestors and is cut-off event [2022-11-16 11:05:40,938 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-16 11:05:40,938 INFO L386 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-11-16 11:05:40,939 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-16 11:05:41,159 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][226], [235#true, Black: 225#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#true, Black: 215#(= ~x~0 0), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 216#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 210#true, Black: 223#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), t_funThread1of3ForFork0NotInUse, 71#L716-5true, t_funThread2of3ForFork0NotInUse, 217#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), t_funThread3of3ForFork0NotInUse]) [2022-11-16 11:05:41,159 INFO L383 tUnfolder$Statistics]: this new event has 170 ancestors and is cut-off event [2022-11-16 11:05:41,159 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-16 11:05:41,159 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-16 11:05:41,159 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-16 11:05:41,163 INFO L130 PetriNetUnfolder]: 1747/14011 cut-off events. [2022-11-16 11:05:41,163 INFO L131 PetriNetUnfolder]: For 6949/7679 co-relation queries the response was YES. [2022-11-16 11:05:41,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22367 conditions, 14011 events. 1747/14011 cut-off events. For 6949/7679 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 185490 event pairs, 930 based on Foata normal form. 50/13327 useless extension candidates. Maximal degree in co-relation 22353. Up to 1771 conditions per place. [2022-11-16 11:05:41,286 INFO L137 encePairwiseOnDemand]: 241/244 looper letters, 15 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2022-11-16 11:05:41,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 244 transitions, 806 flow [2022-11-16 11:05:41,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:05:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:05:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 585 transitions. [2022-11-16 11:05:41,289 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7991803278688525 [2022-11-16 11:05:41,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 585 transitions. [2022-11-16 11:05:41,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 585 transitions. [2022-11-16 11:05:41,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:41,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 585 transitions. [2022-11-16 11:05:41,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 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-16 11:05:41,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 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-16 11:05:41,294 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 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-16 11:05:41,294 INFO L175 Difference]: Start difference. First operand has 220 places, 240 transitions, 764 flow. Second operand 3 states and 585 transitions. [2022-11-16 11:05:41,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 244 transitions, 806 flow [2022-11-16 11:05:41,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 244 transitions, 806 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:05:41,335 INFO L231 Difference]: Finished difference. Result has 223 places, 241 transitions, 776 flow [2022-11-16 11:05:41,335 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=223, PETRI_TRANSITIONS=241} [2022-11-16 11:05:41,336 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 16 predicate places. [2022-11-16 11:05:41,337 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 241 transitions, 776 flow [2022-11-16 11:05:41,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:05:41,337 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:41,338 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:41,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:05:41,338 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-16 11:05:41,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:41,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2125649252, now seen corresponding path program 1 times [2022-11-16 11:05:41,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:41,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830407267] [2022-11-16 11:05:41,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:41,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:05:41,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:41,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830407267] [2022-11-16 11:05:41,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830407267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:41,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:41,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:05:41,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427198956] [2022-11-16 11:05:41,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:41,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:05:41,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:41,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:05:41,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:05:41,474 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 244 [2022-11-16 11:05:41,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 241 transitions, 776 flow. Second operand has 5 states, 5 states have (on average 166.6) internal successors, (833), 5 states have internal predecessors, (833), 0 states have call successors, (0), 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-16 11:05:41,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:41,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 244 [2022-11-16 11:05:41,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:55,837 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([964] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][406], [235#true, Black: 225#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 213#true, Black: 215#(= ~x~0 0), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 216#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 210#true, Black: 223#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 217#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), 56#L691-5true, 71#L716-5true, t_funThread1of3ForFork0NotInUse, 252#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0), 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2022-11-16 11:05:55,837 INFO L383 tUnfolder$Statistics]: this new event has 145 ancestors and is cut-off event [2022-11-16 11:05:55,837 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-16 11:05:55,837 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-16 11:05:55,838 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-16 11:05:56,493 INFO L130 PetriNetUnfolder]: 26254/100310 cut-off events. [2022-11-16 11:05:56,493 INFO L131 PetriNetUnfolder]: For 75895/76736 co-relation queries the response was YES. [2022-11-16 11:05:56,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189345 conditions, 100310 events. 26254/100310 cut-off events. For 75895/76736 co-relation queries the response was YES. Maximal size of possible extension queue 3760. Compared 1604370 event pairs, 10153 based on Foata normal form. 523/96257 useless extension candidates. Maximal degree in co-relation 189329. Up to 17517 conditions per place. [2022-11-16 11:05:57,665 INFO L137 encePairwiseOnDemand]: 228/244 looper letters, 149 selfloop transitions, 101 changer transitions 0/420 dead transitions. [2022-11-16 11:05:57,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 420 transitions, 2111 flow [2022-11-16 11:05:57,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:05:57,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:05:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1676 transitions. [2022-11-16 11:05:57,671 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7632058287795993 [2022-11-16 11:05:57,671 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1676 transitions. [2022-11-16 11:05:57,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1676 transitions. [2022-11-16 11:05:57,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:57,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1676 transitions. [2022-11-16 11:05:57,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 186.22222222222223) internal successors, (1676), 9 states have internal predecessors, (1676), 0 states have call successors, (0), 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-16 11:05:57,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 0 states have call successors, (0), 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-16 11:05:57,684 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 0 states have call successors, (0), 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-16 11:05:57,684 INFO L175 Difference]: Start difference. First operand has 223 places, 241 transitions, 776 flow. Second operand 9 states and 1676 transitions. [2022-11-16 11:05:57,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 420 transitions, 2111 flow [2022-11-16 11:05:58,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 420 transitions, 2109 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:05:58,091 INFO L231 Difference]: Finished difference. Result has 236 places, 307 transitions, 1532 flow [2022-11-16 11:05:58,091 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1532, PETRI_PLACES=236, PETRI_TRANSITIONS=307} [2022-11-16 11:05:58,092 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 29 predicate places. [2022-11-16 11:05:58,092 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 307 transitions, 1532 flow [2022-11-16 11:05:58,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 166.6) internal successors, (833), 5 states have internal predecessors, (833), 0 states have call successors, (0), 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-16 11:05:58,093 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:58,093 INFO L209 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] [2022-11-16 11:05:58,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:05:58,094 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-16 11:05:58,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:58,094 INFO L85 PathProgramCache]: Analyzing trace with hash 731972702, now seen corresponding path program 1 times [2022-11-16 11:05:58,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:58,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560151852] [2022-11-16 11:05:58,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:58,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:05:58,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:58,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560151852] [2022-11-16 11:05:58,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560151852] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:05:58,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541823805] [2022-11-16 11:05:58,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:58,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:58,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:58,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:05:58,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:05:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:58,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:05:58,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:05:58,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:05:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:05:58,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541823805] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:05:58,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:05:58,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 11:05:58,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370974136] [2022-11-16 11:05:58,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:05:58,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:05:58,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:58,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:05:58,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:05:58,624 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 244 [2022-11-16 11:05:58,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 307 transitions, 1532 flow. Second operand has 10 states, 10 states have (on average 190.3) internal successors, (1903), 10 states have internal predecessors, (1903), 0 states have call successors, (0), 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-16 11:05:58,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:58,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 244 [2022-11-16 11:05:58,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:06:01,503 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([966] t_funEXIT-->L716-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][299], [Black: 243#(not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 250#(and (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 242#(= ~x~0 0), Black: 225#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 246#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#true, Black: 215#(= ~x~0 0), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 216#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 210#true, 66#L691-5true, Black: 217#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), 71#L716-5true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0), 260#true, 244#(not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0)), 223#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 248#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 240#true]) [2022-11-16 11:06:01,503 INFO L383 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-11-16 11:06:01,503 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-16 11:06:01,503 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-16 11:06:01,503 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-16 11:06:02,012 INFO L130 PetriNetUnfolder]: 2268/18986 cut-off events. [2022-11-16 11:06:02,012 INFO L131 PetriNetUnfolder]: For 14258/14971 co-relation queries the response was YES. [2022-11-16 11:06:02,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32103 conditions, 18986 events. 2268/18986 cut-off events. For 14258/14971 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 270896 event pairs, 1206 based on Foata normal form. 8/17968 useless extension candidates. Maximal degree in co-relation 32082. Up to 2163 conditions per place. [2022-11-16 11:06:02,195 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 16 selfloop transitions, 9 changer transitions 0/317 dead transitions. [2022-11-16 11:06:02,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 317 transitions, 1604 flow [2022-11-16 11:06:02,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:06:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:06:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1719 transitions. [2022-11-16 11:06:02,202 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7827868852459017 [2022-11-16 11:06:02,203 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1719 transitions. [2022-11-16 11:06:02,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1719 transitions. [2022-11-16 11:06:02,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:06:02,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1719 transitions. [2022-11-16 11:06:02,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 191.0) internal successors, (1719), 9 states have internal predecessors, (1719), 0 states have call successors, (0), 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-16 11:06:02,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 0 states have call successors, (0), 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-16 11:06:02,224 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 0 states have call successors, (0), 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-16 11:06:02,224 INFO L175 Difference]: Start difference. First operand has 236 places, 307 transitions, 1532 flow. Second operand 9 states and 1719 transitions. [2022-11-16 11:06:02,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 317 transitions, 1604 flow [2022-11-16 11:06:02,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 317 transitions, 1604 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:06:02,293 INFO L231 Difference]: Finished difference. Result has 247 places, 313 transitions, 1582 flow [2022-11-16 11:06:02,294 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1582, PETRI_PLACES=247, PETRI_TRANSITIONS=313} [2022-11-16 11:06:02,295 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 40 predicate places. [2022-11-16 11:06:02,295 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 313 transitions, 1582 flow [2022-11-16 11:06:02,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 190.3) internal successors, (1903), 10 states have internal predecessors, (1903), 0 states have call successors, (0), 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-16 11:06:02,296 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:06:02,296 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2022-11-16 11:06:02,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:06:02,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_528d2fbf-1ec0-4981-8a2e-758b5a2b03d9/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 11:06:02,502 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-16 11:06:02,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:02,503 INFO L85 PathProgramCache]: Analyzing trace with hash -8851865, now seen corresponding path program 1 times [2022-11-16 11:06:02,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:02,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453737262] [2022-11-16 11:06:02,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:02,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:06:02,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:06:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:06:02,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:06:02,560 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:06:02,561 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-11-16 11:06:02,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-16 11:06:02,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-11-16 11:06:02,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-11-16 11:06:02,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-11-16 11:06:02,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-16 11:06:02,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:06:02,562 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-16 11:06:02,563 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:06:02,563 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-16 11:06:02,606 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-16 11:06:02,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 293 transitions, 630 flow [2022-11-16 11:06:02,721 INFO L130 PetriNetUnfolder]: 127/734 cut-off events. [2022-11-16 11:06:02,721 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-11-16 11:06:02,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 734 events. 127/734 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3168 event pairs, 6 based on Foata normal form. 0/598 useless extension candidates. Maximal degree in co-relation 521. Up to 32 conditions per place. [2022-11-16 11:06:02,726 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 293 transitions, 630 flow [2022-11-16 11:06:02,732 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 293 transitions, 630 flow [2022-11-16 11:06:02,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:06:02,734 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;@6f37622c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:06:02,734 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-16 11:06:02,740 INFO L130 PetriNetUnfolder]: 10/98 cut-off events. [2022-11-16 11:06:02,740 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:06:02,740 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:06:02,741 INFO L209 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] [2022-11-16 11:06:02,741 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-16 11:06:02,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:02,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1549893430, now seen corresponding path program 1 times [2022-11-16 11:06:02,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:02,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101692622] [2022-11-16 11:06:02,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:02,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:02,778 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-16 11:06:02,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:02,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101692622] [2022-11-16 11:06:02,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101692622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:02,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:02,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:06:02,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960303724] [2022-11-16 11:06:02,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:02,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:06:02,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:02,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:06:02,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:06:02,789 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 293 [2022-11-16 11:06:02,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 293 transitions, 630 flow. Second operand has 2 states, 2 states have (on average 234.0) internal successors, (468), 2 states have internal predecessors, (468), 0 states have call successors, (0), 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-16 11:06:02,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:06:02,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 293 [2022-11-16 11:06:02,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:06:02,923 INFO L130 PetriNetUnfolder]: 25/623 cut-off events. [2022-11-16 11:06:02,923 INFO L131 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-11-16 11:06:02,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 623 events. 25/623 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2608 event pairs, 6 based on Foata normal form. 388/977 useless extension candidates. Maximal degree in co-relation 454. Up to 37 conditions per place. [2022-11-16 11:06:02,931 INFO L137 encePairwiseOnDemand]: 246/293 looper letters, 8 selfloop transitions, 0 changer transitions 0/241 dead transitions. [2022-11-16 11:06:02,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 241 transitions, 542 flow [2022-11-16 11:06:02,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:06:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 11:06:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 521 transitions. [2022-11-16 11:06:02,939 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8890784982935154 [2022-11-16 11:06:02,939 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 521 transitions. [2022-11-16 11:06:02,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 521 transitions. [2022-11-16 11:06:02,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:06:02,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 521 transitions. [2022-11-16 11:06:02,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 260.5) internal successors, (521), 2 states have internal predecessors, (521), 0 states have call successors, (0), 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-16 11:06:02,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 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-16 11:06:02,946 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 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-16 11:06:02,947 INFO L175 Difference]: Start difference. First operand has 247 places, 293 transitions, 630 flow. Second operand 2 states and 521 transitions. [2022-11-16 11:06:02,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 241 transitions, 542 flow [2022-11-16 11:06:02,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 241 transitions, 542 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:06:02,952 INFO L231 Difference]: Finished difference. Result has 243 places, 241 transitions, 526 flow [2022-11-16 11:06:02,952 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=526, PETRI_PLACES=243, PETRI_TRANSITIONS=241} [2022-11-16 11:06:02,954 INFO L288 CegarLoopForPetriNet]: 247 programPoint places, -4 predicate places. [2022-11-16 11:06:02,954 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 241 transitions, 526 flow [2022-11-16 11:06:02,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 234.0) internal successors, (468), 2 states have internal predecessors, (468), 0 states have call successors, (0), 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-16 11:06:02,955 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:06:02,955 INFO L209 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] [2022-11-16 11:06:02,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:06:02,955 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-16 11:06:02,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:02,956 INFO L85 PathProgramCache]: Analyzing trace with hash 293676076, now seen corresponding path program 1 times [2022-11-16 11:06:02,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:02,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033129530] [2022-11-16 11:06:02,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:02,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:03,062 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-16 11:06:03,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:03,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033129530] [2022-11-16 11:06:03,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033129530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:03,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:03,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:06:03,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633154685] [2022-11-16 11:06:03,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:03,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:06:03,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:03,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:06:03,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:06:03,066 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 293 [2022-11-16 11:06:03,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 241 transitions, 526 flow. Second operand has 5 states, 5 states have (on average 196.4) internal successors, (982), 5 states have internal predecessors, (982), 0 states have call successors, (0), 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-16 11:06:03,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:06:03,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 293 [2022-11-16 11:06:03,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand