./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/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_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/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_111e0c10-b456-4225-961a-7d9fc00cea6c/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 246cd07a930f0cb8d777c2eae74f25d04e3267c275b813f0c0f5232c23299340 --- 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:32:00,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:32:00,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:32:00,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:32:00,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:32:00,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:32:00,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:32:00,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:32:00,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:32:00,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:32:00,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:32:00,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:32:00,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:32:00,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:32:00,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:32:00,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:32:00,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:32:00,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:32:00,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:32:00,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:32:00,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:32:00,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:32:00,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:32:00,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:32:00,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:32:00,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:32:00,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:32:00,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:32:00,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:32:00,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:32:00,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:32:00,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:32:00,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:32:00,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:32:00,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:32:00,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:32:00,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:32:00,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:32:00,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:32:00,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:32:00,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:32:00,767 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:32:00,796 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:32:00,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:32:00,797 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:32:00,797 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:32:00,797 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:32:00,798 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:32:00,798 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:32:00,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:32:00,799 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:32:00,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:32:00,799 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:32:00,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:32:00,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:32:00,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:32:00,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:32:00,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:32:00,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:32:00,801 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:32:00,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:32:00,801 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:32:00,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:32:00,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:32:00,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:32:00,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:32:00,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:32:00,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:32:00,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:32:00,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:32:00,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:32:00,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:32:00,810 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:32:00,810 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:32:00,811 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:32:00,811 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_111e0c10-b456-4225-961a-7d9fc00cea6c/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_111e0c10-b456-4225-961a-7d9fc00cea6c/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 -> 246cd07a930f0cb8d777c2eae74f25d04e3267c275b813f0c0f5232c23299340 [2022-11-16 11:32:01,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:32:01,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:32:01,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:32:01,117 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:32:01,118 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:32:01,120 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2022-11-16 11:32:01,183 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/data/4e54d68f4/7c197a6f30314df2b0d74c8a8f8166e2/FLAG334701de4 [2022-11-16 11:32:01,775 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:32:01,779 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2022-11-16 11:32:01,800 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/data/4e54d68f4/7c197a6f30314df2b0d74c8a8f8166e2/FLAG334701de4 [2022-11-16 11:32:02,010 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/data/4e54d68f4/7c197a6f30314df2b0d74c8a8f8166e2 [2022-11-16 11:32:02,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:32:02,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:32:02,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:32:02,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:32:02,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:32:02,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:32:02" (1/1) ... [2022-11-16 11:32:02,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@533091c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:02, skipping insertion in model container [2022-11-16 11:32:02,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:32:02" (1/1) ... [2022-11-16 11:32:02,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:32:02,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:32:02,616 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_111e0c10-b456-4225-961a-7d9fc00cea6c/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i[47038,47051] [2022-11-16 11:32:02,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:32:02,680 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:32:02,736 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_111e0c10-b456-4225-961a-7d9fc00cea6c/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i[47038,47051] [2022-11-16 11:32:02,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:32:02,805 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:32:02,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:02 WrapperNode [2022-11-16 11:32:02,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:32:02,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:32:02,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:32:02,807 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:32:02,815 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:32:02" (1/1) ... [2022-11-16 11:32:02,830 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:32:02" (1/1) ... [2022-11-16 11:32:02,858 INFO L138 Inliner]: procedures = 271, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 201 [2022-11-16 11:32:02,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:32:02,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:32:02,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:32:02,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:32:02,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:02" (1/1) ... [2022-11-16 11:32:02,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:02" (1/1) ... [2022-11-16 11:32:02,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:02" (1/1) ... [2022-11-16 11:32:02,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:02" (1/1) ... [2022-11-16 11:32:02,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:02" (1/1) ... [2022-11-16 11:32:02,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:02" (1/1) ... [2022-11-16 11:32:02,890 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:02" (1/1) ... [2022-11-16 11:32:02,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:02" (1/1) ... [2022-11-16 11:32:02,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:32:02,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:32:02,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:32:02,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:32:02,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:02" (1/1) ... [2022-11-16 11:32:02,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:32:02,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:32:02,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:32:02,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:32:03,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:32:03,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:32:03,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:32:03,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:32:03,013 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-16 11:32:03,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:32:03,014 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-16 11:32:03,015 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-16 11:32:03,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:32:03,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:32:03,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:32:03,018 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:32:03,165 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:32:03,167 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:32:03,604 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:32:03,614 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:32:03,614 INFO L300 CfgBuilder]: Removed 22 assume(true) statements. [2022-11-16 11:32:03,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:32:03 BoogieIcfgContainer [2022-11-16 11:32:03,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:32:03,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:32:03,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:32:03,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:32:03,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:32:02" (1/3) ... [2022-11-16 11:32:03,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9d7c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:32:03, skipping insertion in model container [2022-11-16 11:32:03,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:02" (2/3) ... [2022-11-16 11:32:03,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9d7c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:32:03, skipping insertion in model container [2022-11-16 11:32:03,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:32:03" (3/3) ... [2022-11-16 11:32:03,627 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_78-equ_racing.i [2022-11-16 11:32:03,636 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:32:03,647 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:32:03,647 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 11:32:03,648 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:32:03,776 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-16 11:32:03,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 206 transitions, 420 flow [2022-11-16 11:32:04,003 INFO L130 PetriNetUnfolder]: 43/278 cut-off events. [2022-11-16 11:32:04,005 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 11:32:04,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 278 events. 43/278 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 860 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 136. Up to 8 conditions per place. [2022-11-16 11:32:04,015 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 206 transitions, 420 flow [2022-11-16 11:32:04,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 199 transitions, 403 flow [2022-11-16 11:32:04,043 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:32:04,052 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;@7bc38734, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:32:04,052 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-16 11:32:04,082 INFO L130 PetriNetUnfolder]: 14/162 cut-off events. [2022-11-16 11:32:04,082 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:32:04,083 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:04,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:32:04,084 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:32:04,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:04,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1080089369, now seen corresponding path program 1 times [2022-11-16 11:32:04,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:04,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213542521] [2022-11-16 11:32:04,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:04,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:04,441 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:32:04,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:04,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213542521] [2022-11-16 11:32:04,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213542521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:04,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:04,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:32:04,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803376580] [2022-11-16 11:32:04,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:04,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:32:04,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:04,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:32:04,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:32:04,493 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 206 [2022-11-16 11:32:04,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 199 transitions, 403 flow. Second operand has 2 states, 2 states have (on average 178.5) internal successors, (357), 2 states have internal predecessors, (357), 0 states have call successors, (0), 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:32:04,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:04,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 206 [2022-11-16 11:32:04,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:04,557 INFO L130 PetriNetUnfolder]: 4/231 cut-off events. [2022-11-16 11:32:04,557 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 11:32:04,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 231 events. 4/231 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 623 event pairs, 0 based on Foata normal form. 37/257 useless extension candidates. Maximal degree in co-relation 120. Up to 4 conditions per place. [2022-11-16 11:32:04,560 INFO L137 encePairwiseOnDemand]: 182/206 looper letters, 1 selfloop transitions, 0 changer transitions 0/173 dead transitions. [2022-11-16 11:32:04,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 173 transitions, 353 flow [2022-11-16 11:32:04,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:32:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 11:32:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 381 transitions. [2022-11-16 11:32:04,578 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9247572815533981 [2022-11-16 11:32:04,579 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 381 transitions. [2022-11-16 11:32:04,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 381 transitions. [2022-11-16 11:32:04,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:04,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 381 transitions. [2022-11-16 11:32:04,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 190.5) internal successors, (381), 2 states have internal predecessors, (381), 0 states have call successors, (0), 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:32:04,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:32:04,594 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:32:04,596 INFO L175 Difference]: Start difference. First operand has 175 places, 199 transitions, 403 flow. Second operand 2 states and 381 transitions. [2022-11-16 11:32:04,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 173 transitions, 353 flow [2022-11-16 11:32:04,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 173 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:32:04,605 INFO L231 Difference]: Finished difference. Result has 174 places, 173 transitions, 351 flow [2022-11-16 11:32:04,607 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=351, PETRI_PLACES=174, PETRI_TRANSITIONS=173} [2022-11-16 11:32:04,611 INFO L288 CegarLoopForPetriNet]: 175 programPoint places, -1 predicate places. [2022-11-16 11:32:04,612 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 173 transitions, 351 flow [2022-11-16 11:32:04,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 178.5) internal successors, (357), 2 states have internal predecessors, (357), 0 states have call successors, (0), 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:32:04,612 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:04,613 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:32:04,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:32:04,613 INFO L420 AbstractCegarLoop]: === Iteration 2 === 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:32:04,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:04,614 INFO L85 PathProgramCache]: Analyzing trace with hash 427462440, now seen corresponding path program 1 times [2022-11-16 11:32:04,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:04,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397388145] [2022-11-16 11:32:04,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:04,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:04,803 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:32:04,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:04,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397388145] [2022-11-16 11:32:04,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397388145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:04,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:04,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:32:04,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846146409] [2022-11-16 11:32:04,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:04,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:32:04,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:04,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:32:04,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:32:04,817 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2022-11-16 11:32:04,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 173 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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:32:04,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:04,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2022-11-16 11:32:04,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:04,896 INFO L130 PetriNetUnfolder]: 3/177 cut-off events. [2022-11-16 11:32:04,896 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:32:04,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 177 events. 3/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 295 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 190. Up to 6 conditions per place. [2022-11-16 11:32:04,905 INFO L137 encePairwiseOnDemand]: 203/206 looper letters, 8 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2022-11-16 11:32:04,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 175 transitions, 375 flow [2022-11-16 11:32:04,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:32:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:32:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2022-11-16 11:32:04,910 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8478964401294499 [2022-11-16 11:32:04,910 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2022-11-16 11:32:04,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2022-11-16 11:32:04,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:04,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2022-11-16 11:32:04,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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:32:04,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:32:04,919 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:32:04,920 INFO L175 Difference]: Start difference. First operand has 174 places, 173 transitions, 351 flow. Second operand 3 states and 524 transitions. [2022-11-16 11:32:04,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 175 transitions, 375 flow [2022-11-16 11:32:04,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 175 transitions, 375 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:32:04,926 INFO L231 Difference]: Finished difference. Result has 177 places, 173 transitions, 359 flow [2022-11-16 11:32:04,927 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=359, PETRI_PLACES=177, PETRI_TRANSITIONS=173} [2022-11-16 11:32:04,927 INFO L288 CegarLoopForPetriNet]: 175 programPoint places, 2 predicate places. [2022-11-16 11:32:04,928 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 173 transitions, 359 flow [2022-11-16 11:32:04,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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:32:04,928 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:04,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:32:04,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:32:04,930 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 1 more)] === [2022-11-16 11:32:04,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:04,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1004301748, now seen corresponding path program 1 times [2022-11-16 11:32:04,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:04,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018556009] [2022-11-16 11:32:04,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:04,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:32:05,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:32:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:32:05,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:32:05,104 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:32:05,105 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-11-16 11:32:05,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-11-16 11:32:05,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-11-16 11:32:05,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-11-16 11:32:05,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:32:05,119 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-16 11:32:05,123 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:32:05,123 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-16 11:32:05,196 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 11:32:05,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 266 transitions, 550 flow [2022-11-16 11:32:05,280 INFO L130 PetriNetUnfolder]: 72/435 cut-off events. [2022-11-16 11:32:05,281 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 11:32:05,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 435 events. 72/435 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1664 event pairs, 0 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 280. Up to 12 conditions per place. [2022-11-16 11:32:05,287 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 266 transitions, 550 flow [2022-11-16 11:32:05,294 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 264 transitions, 546 flow [2022-11-16 11:32:05,296 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:32:05,304 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;@7bc38734, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:32:05,304 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-16 11:32:05,326 INFO L130 PetriNetUnfolder]: 16/173 cut-off events. [2022-11-16 11:32:05,326 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 11:32:05,326 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:05,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:32:05,327 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:32:05,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:05,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1900868071, now seen corresponding path program 1 times [2022-11-16 11:32:05,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:05,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983739906] [2022-11-16 11:32:05,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:05,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:05,420 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:32:05,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:05,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983739906] [2022-11-16 11:32:05,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983739906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:05,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:05,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:32:05,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895909933] [2022-11-16 11:32:05,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:05,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:32:05,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:05,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:32:05,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:32:05,424 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 266 [2022-11-16 11:32:05,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 264 transitions, 546 flow. Second operand has 2 states, 2 states have (on average 224.5) internal successors, (449), 2 states have internal predecessors, (449), 0 states have call successors, (0), 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:32:05,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:05,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 266 [2022-11-16 11:32:05,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:05,519 INFO L130 PetriNetUnfolder]: 9/366 cut-off events. [2022-11-16 11:32:05,519 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-16 11:32:05,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 366 events. 9/366 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1346 event pairs, 0 based on Foata normal form. 88/436 useless extension candidates. Maximal degree in co-relation 240. Up to 7 conditions per place. [2022-11-16 11:32:05,523 INFO L137 encePairwiseOnDemand]: 231/266 looper letters, 4 selfloop transitions, 0 changer transitions 0/226 dead transitions. [2022-11-16 11:32:05,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 226 transitions, 478 flow [2022-11-16 11:32:05,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:32:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 11:32:05,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 487 transitions. [2022-11-16 11:32:05,527 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9154135338345865 [2022-11-16 11:32:05,527 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 487 transitions. [2022-11-16 11:32:05,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 487 transitions. [2022-11-16 11:32:05,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:05,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 487 transitions. [2022-11-16 11:32:05,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 243.5) internal successors, (487), 2 states have internal predecessors, (487), 0 states have call successors, (0), 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:32:05,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 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:32:05,532 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 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:32:05,532 INFO L175 Difference]: Start difference. First operand has 228 places, 264 transitions, 546 flow. Second operand 2 states and 487 transitions. [2022-11-16 11:32:05,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 226 transitions, 478 flow [2022-11-16 11:32:05,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 226 transitions, 478 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:32:05,542 INFO L231 Difference]: Finished difference. Result has 226 places, 226 transitions, 470 flow [2022-11-16 11:32:05,542 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=470, PETRI_PLACES=226, PETRI_TRANSITIONS=226} [2022-11-16 11:32:05,545 INFO L288 CegarLoopForPetriNet]: 228 programPoint places, -2 predicate places. [2022-11-16 11:32:05,545 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 226 transitions, 470 flow [2022-11-16 11:32:05,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 224.5) internal successors, (449), 2 states have internal predecessors, (449), 0 states have call successors, (0), 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:32:05,546 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:05,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:32:05,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:32:05,547 INFO L420 AbstractCegarLoop]: === Iteration 2 === 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:32:05,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:05,547 INFO L85 PathProgramCache]: Analyzing trace with hash -886547416, now seen corresponding path program 1 times [2022-11-16 11:32:05,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:05,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092713473] [2022-11-16 11:32:05,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:05,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:05,672 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:32:05,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:05,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092713473] [2022-11-16 11:32:05,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092713473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:05,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:05,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:32:05,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746728309] [2022-11-16 11:32:05,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:05,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:32:05,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:05,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:32:05,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:32:05,676 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 266 [2022-11-16 11:32:05,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 226 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 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:32:05,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:05,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 266 [2022-11-16 11:32:05,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:05,772 INFO L130 PetriNetUnfolder]: 7/321 cut-off events. [2022-11-16 11:32:05,773 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-16 11:32:05,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 321 events. 7/321 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1021 event pairs, 0 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 352. Up to 16 conditions per place. [2022-11-16 11:32:05,777 INFO L137 encePairwiseOnDemand]: 263/266 looper letters, 13 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2022-11-16 11:32:05,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 230 transitions, 508 flow [2022-11-16 11:32:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:32:05,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:32:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2022-11-16 11:32:05,779 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8358395989974937 [2022-11-16 11:32:05,780 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 667 transitions. [2022-11-16 11:32:05,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 667 transitions. [2022-11-16 11:32:05,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:05,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 667 transitions. [2022-11-16 11:32:05,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 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:32:05,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 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:32:05,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 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:32:05,785 INFO L175 Difference]: Start difference. First operand has 226 places, 226 transitions, 470 flow. Second operand 3 states and 667 transitions. [2022-11-16 11:32:05,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 230 transitions, 508 flow [2022-11-16 11:32:05,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 230 transitions, 508 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:32:05,793 INFO L231 Difference]: Finished difference. Result has 229 places, 227 transitions, 482 flow [2022-11-16 11:32:05,793 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=229, PETRI_TRANSITIONS=227} [2022-11-16 11:32:05,795 INFO L288 CegarLoopForPetriNet]: 228 programPoint places, 1 predicate places. [2022-11-16 11:32:05,795 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 227 transitions, 482 flow [2022-11-16 11:32:05,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 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:32:05,796 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:05,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:32:05,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:32:05,797 INFO L420 AbstractCegarLoop]: === Iteration 3 === 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:32:05,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:05,797 INFO L85 PathProgramCache]: Analyzing trace with hash -165554477, now seen corresponding path program 1 times [2022-11-16 11:32:05,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:05,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857328802] [2022-11-16 11:32:05,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:05,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:06,583 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:32:06,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:06,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857328802] [2022-11-16 11:32:06,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857328802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:06,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:06,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 11:32:06,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094029181] [2022-11-16 11:32:06,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:06,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:32:06,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:06,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:32:06,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:32:06,595 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 266 [2022-11-16 11:32:06,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 227 transitions, 482 flow. Second operand has 12 states, 12 states have (on average 161.66666666666666) internal successors, (1940), 12 states have internal predecessors, (1940), 0 states have call successors, (0), 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:32:06,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:06,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 266 [2022-11-16 11:32:06,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:10,066 INFO L130 PetriNetUnfolder]: 4123/13576 cut-off events. [2022-11-16 11:32:10,066 INFO L131 PetriNetUnfolder]: For 211/211 co-relation queries the response was YES. [2022-11-16 11:32:10,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20289 conditions, 13576 events. 4123/13576 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 162218 event pairs, 731 based on Foata normal form. 0/12999 useless extension candidates. Maximal degree in co-relation 20282. Up to 2356 conditions per place. [2022-11-16 11:32:10,214 INFO L137 encePairwiseOnDemand]: 250/266 looper letters, 230 selfloop transitions, 45 changer transitions 73/505 dead transitions. [2022-11-16 11:32:10,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 505 transitions, 1798 flow [2022-11-16 11:32:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 11:32:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-11-16 11:32:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4302 transitions. [2022-11-16 11:32:10,226 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6469172932330827 [2022-11-16 11:32:10,226 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4302 transitions. [2022-11-16 11:32:10,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4302 transitions. [2022-11-16 11:32:10,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:10,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4302 transitions. [2022-11-16 11:32:10,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 172.08) internal successors, (4302), 25 states have internal predecessors, (4302), 0 states have call successors, (0), 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:32:10,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 266.0) internal successors, (6916), 26 states have internal predecessors, (6916), 0 states have call successors, (0), 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:32:10,257 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 266.0) internal successors, (6916), 26 states have internal predecessors, (6916), 0 states have call successors, (0), 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:32:10,257 INFO L175 Difference]: Start difference. First operand has 229 places, 227 transitions, 482 flow. Second operand 25 states and 4302 transitions. [2022-11-16 11:32:10,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 505 transitions, 1798 flow [2022-11-16 11:32:10,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 505 transitions, 1796 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:32:10,269 INFO L231 Difference]: Finished difference. Result has 263 places, 275 transitions, 779 flow [2022-11-16 11:32:10,269 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=779, PETRI_PLACES=263, PETRI_TRANSITIONS=275} [2022-11-16 11:32:10,274 INFO L288 CegarLoopForPetriNet]: 228 programPoint places, 35 predicate places. [2022-11-16 11:32:10,275 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 275 transitions, 779 flow [2022-11-16 11:32:10,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 161.66666666666666) internal successors, (1940), 12 states have internal predecessors, (1940), 0 states have call successors, (0), 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:32:10,277 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:10,278 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, 1, 1, 1, 1, 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:32:10,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:32:10,278 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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:32:10,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:10,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2027097912, now seen corresponding path program 1 times [2022-11-16 11:32:10,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:10,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858417707] [2022-11-16 11:32:10,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:10,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:32:10,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:32:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:32:10,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:32:10,352 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:32:10,352 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-11-16 11:32:10,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-16 11:32:10,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-11-16 11:32:10,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-11-16 11:32:10,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-16 11:32:10,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:32:10,353 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-16 11:32:10,354 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:32:10,354 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-16 11:32:10,395 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 11:32:10,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 326 transitions, 682 flow [2022-11-16 11:32:10,505 INFO L130 PetriNetUnfolder]: 106/625 cut-off events. [2022-11-16 11:32:10,506 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-16 11:32:10,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 625 events. 106/625 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2628 event pairs, 1 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 443. Up to 16 conditions per place. [2022-11-16 11:32:10,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 278 places, 326 transitions, 682 flow [2022-11-16 11:32:10,525 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 277 places, 324 transitions, 678 flow [2022-11-16 11:32:10,526 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:32:10,527 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;@7bc38734, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:32:10,527 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 11:32:10,544 INFO L130 PetriNetUnfolder]: 16/173 cut-off events. [2022-11-16 11:32:10,545 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 11:32:10,545 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:10,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:32:10,545 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:32:10,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:10,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1324184345, now seen corresponding path program 1 times [2022-11-16 11:32:10,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:10,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387628211] [2022-11-16 11:32:10,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:10,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:10,582 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:32:10,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:10,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387628211] [2022-11-16 11:32:10,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387628211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:10,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:10,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:32:10,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098376463] [2022-11-16 11:32:10,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:10,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:32:10,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:10,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:32:10,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:32:10,591 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 326 [2022-11-16 11:32:10,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 324 transitions, 678 flow. Second operand has 2 states, 2 states have (on average 270.5) internal successors, (541), 2 states have internal predecessors, (541), 0 states have call successors, (0), 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:32:10,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:10,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 326 [2022-11-16 11:32:10,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:10,699 INFO L130 PetriNetUnfolder]: 16/527 cut-off events. [2022-11-16 11:32:10,699 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-16 11:32:10,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 527 events. 16/527 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2255 event pairs, 1 based on Foata normal form. 205/705 useless extension candidates. Maximal degree in co-relation 380. Up to 16 conditions per place. [2022-11-16 11:32:10,707 INFO L137 encePairwiseOnDemand]: 280/326 looper letters, 6 selfloop transitions, 0 changer transitions 0/274 dead transitions. [2022-11-16 11:32:10,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 274 transitions, 590 flow [2022-11-16 11:32:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:32:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 11:32:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 592 transitions. [2022-11-16 11:32:10,754 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9079754601226994 [2022-11-16 11:32:10,754 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 592 transitions. [2022-11-16 11:32:10,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 592 transitions. [2022-11-16 11:32:10,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:10,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 592 transitions. [2022-11-16 11:32:10,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 296.0) internal successors, (592), 2 states have internal predecessors, (592), 0 states have call successors, (0), 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:32:10,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 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:32:10,758 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 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:32:10,758 INFO L175 Difference]: Start difference. First operand has 277 places, 324 transitions, 678 flow. Second operand 2 states and 592 transitions. [2022-11-16 11:32:10,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 274 transitions, 590 flow [2022-11-16 11:32:10,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 274 transitions, 590 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:32:10,776 INFO L231 Difference]: Finished difference. Result has 274 places, 274 transitions, 578 flow [2022-11-16 11:32:10,776 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=578, PETRI_PLACES=274, PETRI_TRANSITIONS=274} [2022-11-16 11:32:10,777 INFO L288 CegarLoopForPetriNet]: 277 programPoint places, -3 predicate places. [2022-11-16 11:32:10,778 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 274 transitions, 578 flow [2022-11-16 11:32:10,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 270.5) internal successors, (541), 2 states have internal predecessors, (541), 0 states have call successors, (0), 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:32:10,778 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:10,778 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:32:10,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:32:10,779 INFO L420 AbstractCegarLoop]: === Iteration 2 === 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:32:10,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:10,779 INFO L85 PathProgramCache]: Analyzing trace with hash 183367464, now seen corresponding path program 1 times [2022-11-16 11:32:10,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:10,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813189336] [2022-11-16 11:32:10,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:10,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:10,828 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:32:10,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:10,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813189336] [2022-11-16 11:32:10,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813189336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:10,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:10,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:32:10,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926285117] [2022-11-16 11:32:10,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:10,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:32:10,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:10,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:32:10,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:32:10,830 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 326 [2022-11-16 11:32:10,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 274 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 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:32:10,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:10,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 326 [2022-11-16 11:32:10,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:10,946 INFO L130 PetriNetUnfolder]: 14/482 cut-off events. [2022-11-16 11:32:10,946 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-11-16 11:32:10,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 482 events. 14/482 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1934 event pairs, 1 based on Foata normal form. 0/458 useless extension candidates. Maximal degree in co-relation 540. Up to 30 conditions per place. [2022-11-16 11:32:10,954 INFO L137 encePairwiseOnDemand]: 323/326 looper letters, 15 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2022-11-16 11:32:10,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 278 transitions, 620 flow [2022-11-16 11:32:10,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:32:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:32:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 807 transitions. [2022-11-16 11:32:10,957 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8251533742331288 [2022-11-16 11:32:10,957 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 807 transitions. [2022-11-16 11:32:10,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 807 transitions. [2022-11-16 11:32:10,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:10,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 807 transitions. [2022-11-16 11:32:10,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 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:32:10,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 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:32:10,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 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:32:10,962 INFO L175 Difference]: Start difference. First operand has 274 places, 274 transitions, 578 flow. Second operand 3 states and 807 transitions. [2022-11-16 11:32:10,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 278 transitions, 620 flow [2022-11-16 11:32:10,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 278 transitions, 620 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:32:10,968 INFO L231 Difference]: Finished difference. Result has 277 places, 275 transitions, 590 flow [2022-11-16 11:32:10,968 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=277, PETRI_TRANSITIONS=275} [2022-11-16 11:32:10,969 INFO L288 CegarLoopForPetriNet]: 277 programPoint places, 0 predicate places. [2022-11-16 11:32:10,969 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 275 transitions, 590 flow [2022-11-16 11:32:10,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 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:32:10,969 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:10,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:32:10,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:32:10,970 INFO L420 AbstractCegarLoop]: === Iteration 3 === 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:32:10,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:10,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1154931475, now seen corresponding path program 1 times [2022-11-16 11:32:10,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:10,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272030334] [2022-11-16 11:32:10,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:10,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:11,557 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:32:11,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:11,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272030334] [2022-11-16 11:32:11,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272030334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:11,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:11,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 11:32:11,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434971264] [2022-11-16 11:32:11,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:11,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:32:11,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:11,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:32:11,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:32:11,563 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 326 [2022-11-16 11:32:11,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 275 transitions, 590 flow. Second operand has 12 states, 12 states have (on average 200.66666666666666) internal successors, (2408), 12 states have internal predecessors, (2408), 0 states have call successors, (0), 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:32:11,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:11,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 326 [2022-11-16 11:32:11,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:34,246 INFO L130 PetriNetUnfolder]: 57332/143262 cut-off events. [2022-11-16 11:32:34,246 INFO L131 PetriNetUnfolder]: For 3098/3098 co-relation queries the response was YES. [2022-11-16 11:32:34,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223953 conditions, 143262 events. 57332/143262 cut-off events. For 3098/3098 co-relation queries the response was YES. Maximal size of possible extension queue 5779. Compared 2053485 event pairs, 9544 based on Foata normal form. 0/138287 useless extension candidates. Maximal degree in co-relation 223945. Up to 30426 conditions per place. [2022-11-16 11:32:35,485 INFO L137 encePairwiseOnDemand]: 309/326 looper letters, 445 selfloop transitions, 59 changer transitions 0/700 dead transitions. [2022-11-16 11:32:35,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 700 transitions, 2612 flow [2022-11-16 11:32:35,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 11:32:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-11-16 11:32:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5433 transitions. [2022-11-16 11:32:35,497 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6666257668711656 [2022-11-16 11:32:35,497 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 5433 transitions. [2022-11-16 11:32:35,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 5433 transitions. [2022-11-16 11:32:35,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:35,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 5433 transitions. [2022-11-16 11:32:35,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 217.32) internal successors, (5433), 25 states have internal predecessors, (5433), 0 states have call successors, (0), 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:32:35,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 326.0) internal successors, (8476), 26 states have internal predecessors, (8476), 0 states have call successors, (0), 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:32:35,532 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 326.0) internal successors, (8476), 26 states have internal predecessors, (8476), 0 states have call successors, (0), 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:32:35,532 INFO L175 Difference]: Start difference. First operand has 277 places, 275 transitions, 590 flow. Second operand 25 states and 5433 transitions. [2022-11-16 11:32:35,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 700 transitions, 2612 flow [2022-11-16 11:32:35,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 700 transitions, 2610 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:32:35,545 INFO L231 Difference]: Finished difference. Result has 314 places, 336 transitions, 1012 flow [2022-11-16 11:32:35,546 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1012, PETRI_PLACES=314, PETRI_TRANSITIONS=336} [2022-11-16 11:32:35,546 INFO L288 CegarLoopForPetriNet]: 277 programPoint places, 37 predicate places. [2022-11-16 11:32:35,547 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 336 transitions, 1012 flow [2022-11-16 11:32:35,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 200.66666666666666) internal successors, (2408), 12 states have internal predecessors, (2408), 0 states have call successors, (0), 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:32:35,548 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:35,548 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, 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:32:35,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:32:35,548 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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:32:35,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:35,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1247338263, now seen corresponding path program 1 times [2022-11-16 11:32:35,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:35,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198253181] [2022-11-16 11:32:35,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:35,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:35,630 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:32:35,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:35,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198253181] [2022-11-16 11:32:35,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198253181] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:32:35,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826344901] [2022-11-16 11:32:35,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:35,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:32:35,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:32:35,638 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:32:35,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:32:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:35,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:32:35,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:32:35,894 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:32:35,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:32:35,976 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:32:35,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826344901] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:32:35,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:32:35,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 11:32:35,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713442664] [2022-11-16 11:32:35,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:32:35,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:32:35,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:35,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:32:35,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:32:35,980 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 326 [2022-11-16 11:32:35,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 336 transitions, 1012 flow. Second operand has 10 states, 10 states have (on average 264.3) internal successors, (2643), 10 states have internal predecessors, (2643), 0 states have call successors, (0), 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:32:35,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:35,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 326 [2022-11-16 11:32:35,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:36,884 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1297] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][306], [281#true, Black: 330#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 286#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 293#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), 170#L1040-5true, 172#L1013-30true, 312#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), t_funThread1of3ForFork0InUse, Black: 308#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread2of3ForFork0NotInUse, Black: 322#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 336#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), t_funThread3of3ForFork0NotInUse, Black: 292#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 316#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), 354#true, Black: 302#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 304#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 306#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 310#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 324#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 294#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)))]) [2022-11-16 11:32:36,885 INFO L383 tUnfolder$Statistics]: this new event has 187 ancestors and is cut-off event [2022-11-16 11:32:36,885 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-11-16 11:32:36,885 INFO L386 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-11-16 11:32:36,885 INFO L386 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-11-16 11:32:36,908 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1297] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][306], [281#true, Black: 330#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 286#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 293#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), 170#L1040-5true, 314#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), 164#L1013-32true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, Black: 308#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 322#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 336#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), t_funThread3of3ForFork0NotInUse, Black: 292#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 316#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 302#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 354#true, Black: 304#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 306#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 310#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 324#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 294#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)))]) [2022-11-16 11:32:36,908 INFO L383 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-11-16 11:32:36,908 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-11-16 11:32:36,909 INFO L386 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-11-16 11:32:36,909 INFO L386 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-11-16 11:32:36,926 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1297] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][306], [281#true, Black: 330#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 286#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 293#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), 170#L1040-5true, 235#L999-1true, 316#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, Black: 308#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 322#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 336#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), t_funThread3of3ForFork0NotInUse, Black: 292#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), 354#true, Black: 302#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 304#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 306#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 310#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 324#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 294#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)))]) [2022-11-16 11:32:36,926 INFO L383 tUnfolder$Statistics]: this new event has 191 ancestors and is cut-off event [2022-11-16 11:32:36,926 INFO L386 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-11-16 11:32:36,927 INFO L386 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-11-16 11:32:36,927 INFO L386 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-11-16 11:32:36,947 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1297] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][306], [281#true, Black: 330#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 286#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 293#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), 170#L1040-5true, 205#L1013-34true, 320#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, Black: 308#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 322#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), t_funThread3of3ForFork0NotInUse, Black: 336#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 292#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 316#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), 354#true, Black: 302#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 304#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 306#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 310#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 324#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 294#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)))]) [2022-11-16 11:32:36,948 INFO L383 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2022-11-16 11:32:36,948 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-16 11:32:36,948 INFO L386 tUnfolder$Statistics]: existing Event has 186 ancestors and is cut-off event [2022-11-16 11:32:36,948 INFO L386 tUnfolder$Statistics]: existing Event has 186 ancestors and is cut-off event [2022-11-16 11:32:36,984 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1296] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][307], [281#true, Black: 286#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 330#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), 170#L1040-5true, 3#L1013-8true, t_funThread1of3ForFork0InUse, Black: 308#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread2of3ForFork0NotInUse, Black: 322#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), t_funThread3of3ForFork0NotInUse, Black: 336#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 292#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 316#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 302#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 354#true, Black: 304#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 306#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 310#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 293#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 324#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 294#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)))]) [2022-11-16 11:32:36,984 INFO L383 tUnfolder$Statistics]: this new event has 182 ancestors and is not cut-off event [2022-11-16 11:32:36,984 INFO L386 tUnfolder$Statistics]: existing Event has 182 ancestors and is not cut-off event [2022-11-16 11:32:36,984 INFO L386 tUnfolder$Statistics]: existing Event has 190 ancestors and is not cut-off event [2022-11-16 11:32:36,984 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is not cut-off event [2022-11-16 11:32:37,000 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1297] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][306], [281#true, Black: 330#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 286#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 293#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), 170#L1040-5true, 320#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0NotInUse, Black: 308#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 322#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 336#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), t_funThread3of3ForFork0NotInUse, Black: 292#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 316#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 302#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 354#true, Black: 304#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 306#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 310#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 324#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 294#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)))]) [2022-11-16 11:32:37,000 INFO L383 tUnfolder$Statistics]: this new event has 207 ancestors and is cut-off event [2022-11-16 11:32:37,000 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-16 11:32:37,000 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 11:32:37,000 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-16 11:32:37,022 INFO L130 PetriNetUnfolder]: 560/4312 cut-off events. [2022-11-16 11:32:37,023 INFO L131 PetriNetUnfolder]: For 7322/7905 co-relation queries the response was YES. [2022-11-16 11:32:37,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8595 conditions, 4312 events. 560/4312 cut-off events. For 7322/7905 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 43419 event pairs, 125 based on Foata normal form. 36/4127 useless extension candidates. Maximal degree in co-relation 8573. Up to 480 conditions per place. [2022-11-16 11:32:37,098 INFO L137 encePairwiseOnDemand]: 320/326 looper letters, 16 selfloop transitions, 9 changer transitions 0/346 dead transitions. [2022-11-16 11:32:37,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 346 transitions, 1084 flow [2022-11-16 11:32:37,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:32:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:32:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2385 transitions. [2022-11-16 11:32:37,104 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8128834355828221 [2022-11-16 11:32:37,104 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2385 transitions. [2022-11-16 11:32:37,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2385 transitions. [2022-11-16 11:32:37,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:37,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2385 transitions. [2022-11-16 11:32:37,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 265.0) internal successors, (2385), 9 states have internal predecessors, (2385), 0 states have call successors, (0), 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:32:37,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 326.0) internal successors, (3260), 10 states have internal predecessors, (3260), 0 states have call successors, (0), 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:32:37,133 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 326.0) internal successors, (3260), 10 states have internal predecessors, (3260), 0 states have call successors, (0), 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:32:37,134 INFO L175 Difference]: Start difference. First operand has 314 places, 336 transitions, 1012 flow. Second operand 9 states and 2385 transitions. [2022-11-16 11:32:37,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 346 transitions, 1084 flow [2022-11-16 11:32:37,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 346 transitions, 1081 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:32:37,163 INFO L231 Difference]: Finished difference. Result has 323 places, 342 transitions, 1059 flow [2022-11-16 11:32:37,164 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1059, PETRI_PLACES=323, PETRI_TRANSITIONS=342} [2022-11-16 11:32:37,165 INFO L288 CegarLoopForPetriNet]: 277 programPoint places, 46 predicate places. [2022-11-16 11:32:37,165 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 342 transitions, 1059 flow [2022-11-16 11:32:37,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 264.3) internal successors, (2643), 10 states have internal predecessors, (2643), 0 states have call successors, (0), 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:32:37,166 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:37,167 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, 1, 1, 1, 1, 1, 1, 1, 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:32:37,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:32:37,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:32:37,372 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:32:37,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:37,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1195502371, now seen corresponding path program 1 times [2022-11-16 11:32:37,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:37,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467270038] [2022-11-16 11:32:37,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:37,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 11:32:37,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:37,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467270038] [2022-11-16 11:32:37,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467270038] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:32:37,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159427794] [2022-11-16 11:32:37,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:37,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:32:37,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:32:37,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:32:37,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_111e0c10-b456-4225-961a-7d9fc00cea6c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:32:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:38,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-16 11:32:38,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:32:38,403 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:32:38,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:32:38,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:32:38,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:32:38,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:32:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 11:32:38,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:32:39,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-11-16 11:32:39,379 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 11:32:39,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-16 11:32:39,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 11:32:39,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159427794] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:32:39,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:32:39,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2022-11-16 11:32:39,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476190924] [2022-11-16 11:32:39,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:32:39,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-16 11:32:39,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:39,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-16 11:32:39,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=371, Unknown=9, NotChecked=0, Total=462 [2022-11-16 11:32:39,396 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 326 [2022-11-16 11:32:39,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 342 transitions, 1059 flow. Second operand has 22 states, 22 states have (on average 202.0909090909091) internal successors, (4446), 22 states have internal predecessors, (4446), 0 states have call successors, (0), 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:32:39,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:39,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 326 [2022-11-16 11:32:39,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand