./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 --- 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-b5237d8 [2022-11-21 17:28:37,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:28:37,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:28:37,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:28:37,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:28:37,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:28:37,935 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:28:37,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:28:37,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:28:37,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:28:37,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:28:37,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:28:37,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:28:37,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:28:37,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:28:37,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:28:37,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:28:37,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:28:37,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:28:37,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:28:37,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:28:37,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:28:37,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:28:37,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:28:37,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:28:37,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:28:37,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:28:37,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:28:37,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:28:37,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:28:37,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:28:37,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:28:37,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:28:37,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:28:37,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:28:37,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:28:37,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:28:37,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:28:37,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:28:37,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:28:38,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:28:38,004 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-21 17:28:38,047 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:28:38,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:28:38,048 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:28:38,048 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:28:38,049 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:28:38,049 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:28:38,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:28:38,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:28:38,050 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:28:38,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:28:38,051 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 17:28:38,051 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 17:28:38,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:28:38,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 17:28:38,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:28:38,052 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 17:28:38,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:28:38,052 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 17:28:38,053 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-21 17:28:38,053 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 17:28:38,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 17:28:38,053 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:28:38,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 17:28:38,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:28:38,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:28:38,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:28:38,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:28:38,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:28:38,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:28:38,055 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 17:28:38,055 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:28:38,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 17:28:38,055 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 17:28:38,055 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 17:28:38,056 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 17:28:38,056 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_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/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_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a 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 ! overflow) ) 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 -> 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 [2022-11-21 17:28:38,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:28:38,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:28:38,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:28:38,404 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:28:38,405 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:28:38,406 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2022-11-21 17:28:41,492 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:28:41,772 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:28:41,773 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2022-11-21 17:28:41,787 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/data/66369a0a9/a1a61da67b8944529d9c35814e94953f/FLAGac8c33594 [2022-11-21 17:28:41,815 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/data/66369a0a9/a1a61da67b8944529d9c35814e94953f [2022-11-21 17:28:41,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:28:41,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:28:41,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:28:41,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:28:41,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:28:41,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:28:41" (1/1) ... [2022-11-21 17:28:41,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9d4e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:28:41, skipping insertion in model container [2022-11-21 17:28:41,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:28:41" (1/1) ... [2022-11-21 17:28:41,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:28:41,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:28:42,430 WARN L237 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_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2022-11-21 17:28:42,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:28:42,476 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:28:42,510 WARN L237 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_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2022-11-21 17:28:42,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:28:42,586 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:28:42,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:28:42 WrapperNode [2022-11-21 17:28:42,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:28:42,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:28:42,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:28:42,589 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:28:42,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:28:42" (1/1) ... [2022-11-21 17:28:42,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:28:42" (1/1) ... [2022-11-21 17:28:42,643 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 269 [2022-11-21 17:28:42,644 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:28:42,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:28:42,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:28:42,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:28:42,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:28:42" (1/1) ... [2022-11-21 17:28:42,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:28:42" (1/1) ... [2022-11-21 17:28:42,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:28:42" (1/1) ... [2022-11-21 17:28:42,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:28:42" (1/1) ... [2022-11-21 17:28:42,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:28:42" (1/1) ... [2022-11-21 17:28:42,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:28:42" (1/1) ... [2022-11-21 17:28:42,712 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:28:42" (1/1) ... [2022-11-21 17:28:42,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:28:42" (1/1) ... [2022-11-21 17:28:42,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:28:42,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:28:42,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:28:42,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:28:42,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:28:42" (1/1) ... [2022-11-21 17:28:42,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:28:42,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:28:42,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:28:42,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:28:42,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 17:28:42,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 17:28:42,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 17:28:42,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 17:28:42,816 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-21 17:28:42,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:28:42,817 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-21 17:28:42,817 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-21 17:28:42,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 17:28:42,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:28:42,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:28:42,819 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 17:28:43,029 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:28:43,031 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:28:43,557 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:28:43,566 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:28:43,567 INFO L300 CfgBuilder]: Removed 35 assume(true) statements. [2022-11-21 17:28:43,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:28:43 BoogieIcfgContainer [2022-11-21 17:28:43,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:28:43,571 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:28:43,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:28:43,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:28:43,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:28:41" (1/3) ... [2022-11-21 17:28:43,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31114781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:28:43, skipping insertion in model container [2022-11-21 17:28:43,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:28:42" (2/3) ... [2022-11-21 17:28:43,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31114781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:28:43, skipping insertion in model container [2022-11-21 17:28:43,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:28:43" (3/3) ... [2022-11-21 17:28:43,581 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2022-11-21 17:28:43,590 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 17:28:43,601 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:28:43,602 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-11-21 17:28:43,602 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 17:28:43,735 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-21 17:28:43,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 254 places, 296 transitions, 600 flow [2022-11-21 17:28:44,044 INFO L130 PetriNetUnfolder]: 73/453 cut-off events. [2022-11-21 17:28:44,045 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-21 17:28:44,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 453 events. 73/453 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2189 event pairs, 0 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 248. Up to 8 conditions per place. [2022-11-21 17:28:44,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 254 places, 296 transitions, 600 flow [2022-11-21 17:28:44,073 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 252 places, 293 transitions, 594 flow [2022-11-21 17:28:44,087 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:28:44,095 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;@643744a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:28:44,095 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-11-21 17:28:44,104 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-21 17:28:44,107 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 17:28:44,107 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:28:44,108 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] [2022-11-21 17:28:44,108 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-21 17:28:44,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:44,115 INFO L85 PathProgramCache]: Analyzing trace with hash 345272585, now seen corresponding path program 1 times [2022-11-21 17:28:44,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:44,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577114962] [2022-11-21 17:28:44,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:44,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:44,477 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-21 17:28:44,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:28:44,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577114962] [2022-11-21 17:28:44,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577114962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:28:44,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:28:44,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:28:44,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754901583] [2022-11-21 17:28:44,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:28:44,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:28:44,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:44,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:28:44,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:28:44,544 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-21 17:28:44,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 293 transitions, 594 flow. Second operand has 4 states, 4 states have (on average 242.5) internal successors, (970), 4 states have internal predecessors, (970), 0 states have call successors, (0), 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-21 17:28:44,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:28:44,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-21 17:28:44,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:28:44,712 INFO L130 PetriNetUnfolder]: 9/389 cut-off events. [2022-11-21 17:28:44,712 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-21 17:28:44,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 389 events. 9/389 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1763 event pairs, 0 based on Foata normal form. 62/402 useless extension candidates. Maximal degree in co-relation 210. Up to 15 conditions per place. [2022-11-21 17:28:44,720 INFO L137 encePairwiseOnDemand]: 251/296 looper letters, 17 selfloop transitions, 4 changer transitions 0/259 dead transitions. [2022-11-21 17:28:44,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 259 transitions, 568 flow [2022-11-21 17:28:44,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:28:44,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 17:28:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1268 transitions. [2022-11-21 17:28:44,751 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8567567567567568 [2022-11-21 17:28:44,752 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1268 transitions. [2022-11-21 17:28:44,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1268 transitions. [2022-11-21 17:28:44,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:28:44,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1268 transitions. [2022-11-21 17:28:44,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 253.6) internal successors, (1268), 5 states have internal predecessors, (1268), 0 states have call successors, (0), 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-21 17:28:44,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 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-21 17:28:44,780 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 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-21 17:28:44,783 INFO L175 Difference]: Start difference. First operand has 252 places, 293 transitions, 594 flow. Second operand 5 states and 1268 transitions. [2022-11-21 17:28:44,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 259 transitions, 568 flow [2022-11-21 17:28:44,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 259 transitions, 568 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 17:28:44,799 INFO L231 Difference]: Finished difference. Result has 256 places, 255 transitions, 544 flow [2022-11-21 17:28:44,802 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=544, PETRI_PLACES=256, PETRI_TRANSITIONS=255} [2022-11-21 17:28:44,809 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 4 predicate places. [2022-11-21 17:28:44,809 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 255 transitions, 544 flow [2022-11-21 17:28:44,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 242.5) internal successors, (970), 4 states have internal predecessors, (970), 0 states have call successors, (0), 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-21 17:28:44,810 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:28:44,811 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:28:44,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 17:28:44,812 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-21 17:28:44,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:44,813 INFO L85 PathProgramCache]: Analyzing trace with hash -495076173, now seen corresponding path program 1 times [2022-11-21 17:28:44,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:44,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177488568] [2022-11-21 17:28:44,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:44,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:45,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:28:45,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:28:45,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177488568] [2022-11-21 17:28:45,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177488568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:28:45,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:28:45,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:28:45,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443588741] [2022-11-21 17:28:45,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:28:45,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:28:45,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:45,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:28:45,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:28:45,011 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-21 17:28:45,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 255 transitions, 544 flow. Second operand has 4 states, 4 states have (on average 244.25) internal successors, (977), 4 states have internal predecessors, (977), 0 states have call successors, (0), 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-21 17:28:45,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:28:45,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-21 17:28:45,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:28:45,123 INFO L130 PetriNetUnfolder]: 9/388 cut-off events. [2022-11-21 17:28:45,124 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-21 17:28:45,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 388 events. 9/388 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1757 event pairs, 0 based on Foata normal form. 1/343 useless extension candidates. Maximal degree in co-relation 378. Up to 7 conditions per place. [2022-11-21 17:28:45,127 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 9 selfloop transitions, 8 changer transitions 0/255 dead transitions. [2022-11-21 17:28:45,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 255 transitions, 576 flow [2022-11-21 17:28:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:28:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 17:28:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1220 transitions. [2022-11-21 17:28:45,132 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8243243243243243 [2022-11-21 17:28:45,132 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1220 transitions. [2022-11-21 17:28:45,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1220 transitions. [2022-11-21 17:28:45,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:28:45,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1220 transitions. [2022-11-21 17:28:45,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 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-21 17:28:45,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 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-21 17:28:45,140 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 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-21 17:28:45,140 INFO L175 Difference]: Start difference. First operand has 256 places, 255 transitions, 544 flow. Second operand 5 states and 1220 transitions. [2022-11-21 17:28:45,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 255 transitions, 576 flow [2022-11-21 17:28:45,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 255 transitions, 574 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 17:28:45,149 INFO L231 Difference]: Finished difference. Result has 259 places, 255 transitions, 562 flow [2022-11-21 17:28:45,149 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=562, PETRI_PLACES=259, PETRI_TRANSITIONS=255} [2022-11-21 17:28:45,150 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 7 predicate places. [2022-11-21 17:28:45,150 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 255 transitions, 562 flow [2022-11-21 17:28:45,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 244.25) internal successors, (977), 4 states have internal predecessors, (977), 0 states have call successors, (0), 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-21 17:28:45,151 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:28:45,152 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] [2022-11-21 17:28:45,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 17:28:45,152 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-21 17:28:45,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:45,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1832508587, now seen corresponding path program 1 times [2022-11-21 17:28:45,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:45,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945402017] [2022-11-21 17:28:45,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:45,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:28:45,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:28:45,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945402017] [2022-11-21 17:28:45,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945402017] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:28:45,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848991240] [2022-11-21 17:28:45,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:45,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:28:45,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:28:45,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:28:45,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 17:28:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:45,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 17:28:45,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:28:45,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:28:45,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:28:45,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848991240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:28:45,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:28:45,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-21 17:28:45,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308266267] [2022-11-21 17:28:45,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:28:45,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:28:45,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:45,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:28:45,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:28:45,540 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-21 17:28:45,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 255 transitions, 562 flow. Second operand has 5 states, 5 states have (on average 243.8) internal successors, (1219), 5 states have internal predecessors, (1219), 0 states have call successors, (0), 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-21 17:28:45,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:28:45,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-21 17:28:45,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:28:45,641 INFO L130 PetriNetUnfolder]: 9/387 cut-off events. [2022-11-21 17:28:45,641 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-21 17:28:45,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 387 events. 9/387 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1750 event pairs, 0 based on Foata normal form. 1/342 useless extension candidates. Maximal degree in co-relation 376. Up to 10 conditions per place. [2022-11-21 17:28:45,646 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 11 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2022-11-21 17:28:45,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 254 transitions, 590 flow [2022-11-21 17:28:45,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:28:45,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-21 17:28:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 977 transitions. [2022-11-21 17:28:45,649 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825168918918919 [2022-11-21 17:28:45,649 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 977 transitions. [2022-11-21 17:28:45,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 977 transitions. [2022-11-21 17:28:45,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:28:45,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 977 transitions. [2022-11-21 17:28:45,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 244.25) internal successors, (977), 4 states have internal predecessors, (977), 0 states have call successors, (0), 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-21 17:28:45,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 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-21 17:28:45,657 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 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-21 17:28:45,657 INFO L175 Difference]: Start difference. First operand has 259 places, 255 transitions, 562 flow. Second operand 4 states and 977 transitions. [2022-11-21 17:28:45,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 254 transitions, 590 flow [2022-11-21 17:28:45,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 254 transitions, 578 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 17:28:45,663 INFO L231 Difference]: Finished difference. Result has 258 places, 254 transitions, 556 flow [2022-11-21 17:28:45,664 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=556, PETRI_PLACES=258, PETRI_TRANSITIONS=254} [2022-11-21 17:28:45,665 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 6 predicate places. [2022-11-21 17:28:45,665 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 254 transitions, 556 flow [2022-11-21 17:28:45,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 243.8) internal successors, (1219), 5 states have internal predecessors, (1219), 0 states have call successors, (0), 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-21 17:28:45,666 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:28:45,666 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] [2022-11-21 17:28:45,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 17:28:45,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-21 17:28:45,873 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-21 17:28:45,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:45,873 INFO L85 PathProgramCache]: Analyzing trace with hash -169423497, now seen corresponding path program 1 times [2022-11-21 17:28:45,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:45,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675140511] [2022-11-21 17:28:45,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:45,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:45,979 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-21 17:28:45,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:28:45,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675140511] [2022-11-21 17:28:45,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675140511] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:28:45,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803121851] [2022-11-21 17:28:45,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:45,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:28:45,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:28:45,987 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:28:45,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 17:28:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:46,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 17:28:46,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:28:46,115 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-21 17:28:46,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:28:46,155 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-21 17:28:46,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803121851] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:28:46,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:28:46,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-21 17:28:46,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475810383] [2022-11-21 17:28:46,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:28:46,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 17:28:46,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:46,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 17:28:46,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-21 17:28:46,161 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-21 17:28:46,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 254 transitions, 556 flow. Second operand has 10 states, 10 states have (on average 243.7) internal successors, (2437), 10 states have internal predecessors, (2437), 0 states have call successors, (0), 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-21 17:28:46,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:28:46,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-21 17:28:46,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:28:46,322 INFO L130 PetriNetUnfolder]: 9/395 cut-off events. [2022-11-21 17:28:46,322 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-21 17:28:46,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 395 events. 9/395 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1737 event pairs, 0 based on Foata normal form. 2/351 useless extension candidates. Maximal degree in co-relation 366. Up to 7 conditions per place. [2022-11-21 17:28:46,326 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 18 selfloop transitions, 9 changer transitions 0/265 dead transitions. [2022-11-21 17:28:46,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 265 transitions, 648 flow [2022-11-21 17:28:46,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 17:28:46,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-21 17:28:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2198 transitions. [2022-11-21 17:28:46,330 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825075075075075 [2022-11-21 17:28:46,331 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2198 transitions. [2022-11-21 17:28:46,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2198 transitions. [2022-11-21 17:28:46,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:28:46,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2198 transitions. [2022-11-21 17:28:46,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 244.22222222222223) internal successors, (2198), 9 states have internal predecessors, (2198), 0 states have call successors, (0), 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-21 17:28:46,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 296.0) internal successors, (2960), 10 states have internal predecessors, (2960), 0 states have call successors, (0), 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-21 17:28:46,344 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 296.0) internal successors, (2960), 10 states have internal predecessors, (2960), 0 states have call successors, (0), 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-21 17:28:46,344 INFO L175 Difference]: Start difference. First operand has 258 places, 254 transitions, 556 flow. Second operand 9 states and 2198 transitions. [2022-11-21 17:28:46,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 265 transitions, 648 flow [2022-11-21 17:28:46,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 265 transitions, 634 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 17:28:46,350 INFO L231 Difference]: Finished difference. Result has 267 places, 258 transitions, 602 flow [2022-11-21 17:28:46,350 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=602, PETRI_PLACES=267, PETRI_TRANSITIONS=258} [2022-11-21 17:28:46,351 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 15 predicate places. [2022-11-21 17:28:46,351 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 258 transitions, 602 flow [2022-11-21 17:28:46,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 243.7) internal successors, (2437), 10 states have internal predecessors, (2437), 0 states have call successors, (0), 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-21 17:28:46,352 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:28:46,353 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:28:46,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 17:28:46,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:28:46,558 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-21 17:28:46,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:46,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1870480841, now seen corresponding path program 2 times [2022-11-21 17:28:46,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:46,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121437884] [2022-11-21 17:28:46,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:46,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-21 17:28:46,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:28:46,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121437884] [2022-11-21 17:28:46,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121437884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:28:46,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:28:46,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:28:46,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738943499] [2022-11-21 17:28:46,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:28:46,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:28:46,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:46,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:28:46,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:28:46,690 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-21 17:28:46,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 258 transitions, 602 flow. Second operand has 4 states, 4 states have (on average 242.75) internal successors, (971), 4 states have internal predecessors, (971), 0 states have call successors, (0), 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-21 17:28:46,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:28:46,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-21 17:28:46,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:28:46,769 INFO L130 PetriNetUnfolder]: 6/267 cut-off events. [2022-11-21 17:28:46,769 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-11-21 17:28:46,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 267 events. 6/267 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 812 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 250. Up to 7 conditions per place. [2022-11-21 17:28:46,773 INFO L137 encePairwiseOnDemand]: 289/296 looper letters, 10 selfloop transitions, 4 changer transitions 0/258 dead transitions. [2022-11-21 17:28:46,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 258 transitions, 630 flow [2022-11-21 17:28:46,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:28:46,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 17:28:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1222 transitions. [2022-11-21 17:28:46,777 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8256756756756757 [2022-11-21 17:28:46,777 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1222 transitions. [2022-11-21 17:28:46,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1222 transitions. [2022-11-21 17:28:46,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:28:46,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1222 transitions. [2022-11-21 17:28:46,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 244.4) internal successors, (1222), 5 states have internal predecessors, (1222), 0 states have call successors, (0), 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-21 17:28:46,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 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-21 17:28:46,785 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 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-21 17:28:46,785 INFO L175 Difference]: Start difference. First operand has 267 places, 258 transitions, 602 flow. Second operand 5 states and 1222 transitions. [2022-11-21 17:28:46,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 258 transitions, 630 flow [2022-11-21 17:28:46,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 258 transitions, 614 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-21 17:28:46,792 INFO L231 Difference]: Finished difference. Result has 266 places, 256 transitions, 594 flow [2022-11-21 17:28:46,793 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=594, PETRI_PLACES=266, PETRI_TRANSITIONS=256} [2022-11-21 17:28:46,793 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 14 predicate places. [2022-11-21 17:28:46,794 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 256 transitions, 594 flow [2022-11-21 17:28:46,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 242.75) internal successors, (971), 4 states have internal predecessors, (971), 0 states have call successors, (0), 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-21 17:28:46,795 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:28:46,795 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:28:46,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 17:28:46,795 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-21 17:28:46,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:46,796 INFO L85 PathProgramCache]: Analyzing trace with hash 7125757, now seen corresponding path program 1 times [2022-11-21 17:28:46,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:46,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121770001] [2022-11-21 17:28:46,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:46,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:28:46,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:28:46,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121770001] [2022-11-21 17:28:46,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121770001] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:28:46,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143995884] [2022-11-21 17:28:46,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:46,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:28:46,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:28:46,956 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:28:46,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 17:28:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:47,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 17:28:47,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:28:47,132 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:28:47,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:28:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:28:47,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143995884] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:28:47,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:28:47,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-21 17:28:47,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358940772] [2022-11-21 17:28:47,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:28:47,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-21 17:28:47,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:47,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 17:28:47,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-21 17:28:47,285 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-21 17:28:47,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 256 transitions, 594 flow. Second operand has 18 states, 18 states have (on average 244.05555555555554) internal successors, (4393), 18 states have internal predecessors, (4393), 0 states have call successors, (0), 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-21 17:28:47,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:28:47,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-21 17:28:47,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:28:47,614 INFO L130 PetriNetUnfolder]: 6/295 cut-off events. [2022-11-21 17:28:47,614 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-11-21 17:28:47,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 295 events. 6/295 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 813 event pairs, 0 based on Foata normal form. 4/273 useless extension candidates. Maximal degree in co-relation 243. Up to 9 conditions per place. [2022-11-21 17:28:47,618 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 34 selfloop transitions, 21 changer transitions 0/291 dead transitions. [2022-11-21 17:28:47,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 291 transitions, 858 flow [2022-11-21 17:28:47,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 17:28:47,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-21 17:28:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5120 transitions. [2022-11-21 17:28:47,629 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8236808236808236 [2022-11-21 17:28:47,630 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 5120 transitions. [2022-11-21 17:28:47,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 5120 transitions. [2022-11-21 17:28:47,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:28:47,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 5120 transitions. [2022-11-21 17:28:47,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 243.8095238095238) internal successors, (5120), 21 states have internal predecessors, (5120), 0 states have call successors, (0), 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-21 17:28:47,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 296.0) internal successors, (6512), 22 states have internal predecessors, (6512), 0 states have call successors, (0), 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-21 17:28:47,659 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 296.0) internal successors, (6512), 22 states have internal predecessors, (6512), 0 states have call successors, (0), 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-21 17:28:47,659 INFO L175 Difference]: Start difference. First operand has 266 places, 256 transitions, 594 flow. Second operand 21 states and 5120 transitions. [2022-11-21 17:28:47,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 291 transitions, 858 flow [2022-11-21 17:28:47,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 291 transitions, 850 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 17:28:47,669 INFO L231 Difference]: Finished difference. Result has 287 places, 269 transitions, 742 flow [2022-11-21 17:28:47,670 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=742, PETRI_PLACES=287, PETRI_TRANSITIONS=269} [2022-11-21 17:28:47,673 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 35 predicate places. [2022-11-21 17:28:47,673 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 269 transitions, 742 flow [2022-11-21 17:28:47,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 244.05555555555554) internal successors, (4393), 18 states have internal predecessors, (4393), 0 states have call successors, (0), 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-21 17:28:47,691 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:28:47,691 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:28:47,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 17:28:47,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:28:47,902 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-21 17:28:47,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:47,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1631003773, now seen corresponding path program 2 times [2022-11-21 17:28:47,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:47,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210571043] [2022-11-21 17:28:47,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:47,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:28:48,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:28:48,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210571043] [2022-11-21 17:28:48,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210571043] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:28:48,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641641927] [2022-11-21 17:28:48,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:28:48,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:28:48,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:28:48,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:28:48,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 17:28:48,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:28:48,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:28:48,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 17:28:48,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:28:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:28:48,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:28:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:28:48,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641641927] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:28:48,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:28:48,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-21 17:28:48,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049027647] [2022-11-21 17:28:48,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:28:48,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-21 17:28:48,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:48,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-21 17:28:48,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-21 17:28:48,855 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-21 17:28:48,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 269 transitions, 742 flow. Second operand has 23 states, 23 states have (on average 244.30434782608697) internal successors, (5619), 23 states have internal predecessors, (5619), 0 states have call successors, (0), 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-21 17:28:48,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:28:48,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-21 17:28:48,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:28:49,338 INFO L130 PetriNetUnfolder]: 6/316 cut-off events. [2022-11-21 17:28:49,338 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2022-11-21 17:28:49,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 316 events. 6/316 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 814 event pairs, 0 based on Foata normal form. 3/293 useless extension candidates. Maximal degree in co-relation 334. Up to 12 conditions per place. [2022-11-21 17:28:49,342 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 46 selfloop transitions, 30 changer transitions 0/312 dead transitions. [2022-11-21 17:28:49,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 312 transitions, 1104 flow [2022-11-21 17:28:49,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-21 17:28:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-21 17:28:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 7309 transitions. [2022-11-21 17:28:49,358 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8230855855855855 [2022-11-21 17:28:49,358 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 7309 transitions. [2022-11-21 17:28:49,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 7309 transitions. [2022-11-21 17:28:49,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:28:49,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 7309 transitions. [2022-11-21 17:28:49,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 243.63333333333333) internal successors, (7309), 30 states have internal predecessors, (7309), 0 states have call successors, (0), 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-21 17:28:49,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 296.0) internal successors, (9176), 31 states have internal predecessors, (9176), 0 states have call successors, (0), 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-21 17:28:49,393 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 296.0) internal successors, (9176), 31 states have internal predecessors, (9176), 0 states have call successors, (0), 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-21 17:28:49,394 INFO L175 Difference]: Start difference. First operand has 287 places, 269 transitions, 742 flow. Second operand 30 states and 7309 transitions. [2022-11-21 17:28:49,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 312 transitions, 1104 flow [2022-11-21 17:28:49,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 312 transitions, 1024 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-21 17:28:49,402 INFO L231 Difference]: Finished difference. Result has 312 places, 279 transitions, 840 flow [2022-11-21 17:28:49,403 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=840, PETRI_PLACES=312, PETRI_TRANSITIONS=279} [2022-11-21 17:28:49,403 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 60 predicate places. [2022-11-21 17:28:49,404 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 279 transitions, 840 flow [2022-11-21 17:28:49,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 244.30434782608697) internal successors, (5619), 23 states have internal predecessors, (5619), 0 states have call successors, (0), 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-21 17:28:49,406 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:28:49,406 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:28:49,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 17:28:49,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-21 17:28:49,612 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-21 17:28:49,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:49,612 INFO L85 PathProgramCache]: Analyzing trace with hash 394578151, now seen corresponding path program 3 times [2022-11-21 17:28:49,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:49,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619289171] [2022-11-21 17:28:49,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:49,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:28:49,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:28:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:28:49,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:28:49,724 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 17:28:49,725 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2022-11-21 17:28:49,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 29 remaining) [2022-11-21 17:28:49,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 29 remaining) [2022-11-21 17:28:49,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 29 remaining) [2022-11-21 17:28:49,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 29 remaining) [2022-11-21 17:28:49,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 29 remaining) [2022-11-21 17:28:49,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 29 remaining) [2022-11-21 17:28:49,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 29 remaining) [2022-11-21 17:28:49,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 29 remaining) [2022-11-21 17:28:49,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 29 remaining) [2022-11-21 17:28:49,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 29 remaining) [2022-11-21 17:28:49,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 29 remaining) [2022-11-21 17:28:49,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 29 remaining) [2022-11-21 17:28:49,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 29 remaining) [2022-11-21 17:28:49,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 29 remaining) [2022-11-21 17:28:49,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 29 remaining) [2022-11-21 17:28:49,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 29 remaining) [2022-11-21 17:28:49,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 29 remaining) [2022-11-21 17:28:49,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 29 remaining) [2022-11-21 17:28:49,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 29 remaining) [2022-11-21 17:28:49,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 29 remaining) [2022-11-21 17:28:49,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 29 remaining) [2022-11-21 17:28:49,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 29 remaining) [2022-11-21 17:28:49,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 29 remaining) [2022-11-21 17:28:49,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 29 remaining) [2022-11-21 17:28:49,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 29 remaining) [2022-11-21 17:28:49,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 29 remaining) [2022-11-21 17:28:49,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 29 remaining) [2022-11-21 17:28:49,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 29 remaining) [2022-11-21 17:28:49,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 17:28:49,742 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2022-11-21 17:28:49,744 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-21 17:28:49,745 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-21 17:28:49,813 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-21 17:28:49,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 325 places, 380 transitions, 778 flow [2022-11-21 17:28:49,923 INFO L130 PetriNetUnfolder]: 118/731 cut-off events. [2022-11-21 17:28:49,923 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-21 17:28:49,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 731 events. 118/731 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3930 event pairs, 0 based on Foata normal form. 0/555 useless extension candidates. Maximal degree in co-relation 455. Up to 12 conditions per place. [2022-11-21 17:28:49,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 380 transitions, 778 flow [2022-11-21 17:28:49,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 325 places, 380 transitions, 778 flow [2022-11-21 17:28:49,945 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:28:49,945 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;@643744a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:28:49,945 INFO L358 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2022-11-21 17:28:49,948 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-21 17:28:49,948 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 17:28:49,948 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:28:49,948 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] [2022-11-21 17:28:49,949 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-21 17:28:49,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:49,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1413576965, now seen corresponding path program 1 times [2022-11-21 17:28:49,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:49,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836381277] [2022-11-21 17:28:49,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:49,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:50,006 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-21 17:28:50,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:28:50,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836381277] [2022-11-21 17:28:50,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836381277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:28:50,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:28:50,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:28:50,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088868127] [2022-11-21 17:28:50,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:28:50,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:28:50,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:50,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:28:50,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:28:50,010 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-21 17:28:50,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 380 transitions, 778 flow. Second operand has 4 states, 4 states have (on average 311.5) internal successors, (1246), 4 states have internal predecessors, (1246), 0 states have call successors, (0), 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-21 17:28:50,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:28:50,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-21 17:28:50,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:28:50,168 INFO L130 PetriNetUnfolder]: 17/629 cut-off events. [2022-11-21 17:28:50,169 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-21 17:28:50,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 629 events. 17/629 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3350 event pairs, 0 based on Foata normal form. 126/672 useless extension candidates. Maximal degree in co-relation 415. Up to 19 conditions per place. [2022-11-21 17:28:50,181 INFO L137 encePairwiseOnDemand]: 323/380 looper letters, 19 selfloop transitions, 4 changer transitions 0/333 dead transitions. [2022-11-21 17:28:50,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 333 transitions, 730 flow [2022-11-21 17:28:50,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:28:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 17:28:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions. [2022-11-21 17:28:50,185 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8563157894736843 [2022-11-21 17:28:50,185 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1627 transitions. [2022-11-21 17:28:50,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1627 transitions. [2022-11-21 17:28:50,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:28:50,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1627 transitions. [2022-11-21 17:28:50,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 325.4) internal successors, (1627), 5 states have internal predecessors, (1627), 0 states have call successors, (0), 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-21 17:28:50,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 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-21 17:28:50,194 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 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-21 17:28:50,194 INFO L175 Difference]: Start difference. First operand has 325 places, 380 transitions, 778 flow. Second operand 5 states and 1627 transitions. [2022-11-21 17:28:50,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 333 transitions, 730 flow [2022-11-21 17:28:50,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 333 transitions, 730 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 17:28:50,201 INFO L231 Difference]: Finished difference. Result has 328 places, 329 transitions, 702 flow [2022-11-21 17:28:50,201 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=702, PETRI_PLACES=328, PETRI_TRANSITIONS=329} [2022-11-21 17:28:50,204 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 3 predicate places. [2022-11-21 17:28:50,204 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 329 transitions, 702 flow [2022-11-21 17:28:50,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 311.5) internal successors, (1246), 4 states have internal predecessors, (1246), 0 states have call successors, (0), 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-21 17:28:50,205 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:28:50,205 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:28:50,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 17:28:50,205 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-21 17:28:50,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:50,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1545477069, now seen corresponding path program 1 times [2022-11-21 17:28:50,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:50,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899123456] [2022-11-21 17:28:50,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:50,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:28:50,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:28:50,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899123456] [2022-11-21 17:28:50,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899123456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:28:50,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:28:50,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:28:50,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045238098] [2022-11-21 17:28:50,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:28:50,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:28:50,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:50,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:28:50,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:28:50,252 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-21 17:28:50,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 329 transitions, 702 flow. Second operand has 4 states, 4 states have (on average 313.25) internal successors, (1253), 4 states have internal predecessors, (1253), 0 states have call successors, (0), 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-21 17:28:50,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:28:50,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-21 17:28:50,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:28:50,422 INFO L130 PetriNetUnfolder]: 17/628 cut-off events. [2022-11-21 17:28:50,422 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-21 17:28:50,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 628 events. 17/628 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3351 event pairs, 0 based on Foata normal form. 1/549 useless extension candidates. Maximal degree in co-relation 629. Up to 11 conditions per place. [2022-11-21 17:28:50,434 INFO L137 encePairwiseOnDemand]: 374/380 looper letters, 11 selfloop transitions, 8 changer transitions 0/329 dead transitions. [2022-11-21 17:28:50,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 329 transitions, 738 flow [2022-11-21 17:28:50,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:28:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 17:28:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1567 transitions. [2022-11-21 17:28:50,438 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8247368421052632 [2022-11-21 17:28:50,438 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1567 transitions. [2022-11-21 17:28:50,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1567 transitions. [2022-11-21 17:28:50,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:28:50,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1567 transitions. [2022-11-21 17:28:50,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 313.4) internal successors, (1567), 5 states have internal predecessors, (1567), 0 states have call successors, (0), 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-21 17:28:50,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 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-21 17:28:50,447 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 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-21 17:28:50,447 INFO L175 Difference]: Start difference. First operand has 328 places, 329 transitions, 702 flow. Second operand 5 states and 1567 transitions. [2022-11-21 17:28:50,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 329 transitions, 738 flow [2022-11-21 17:28:50,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 329 transitions, 736 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 17:28:50,453 INFO L231 Difference]: Finished difference. Result has 331 places, 329 transitions, 720 flow [2022-11-21 17:28:50,454 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=720, PETRI_PLACES=331, PETRI_TRANSITIONS=329} [2022-11-21 17:28:50,455 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 6 predicate places. [2022-11-21 17:28:50,455 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 329 transitions, 720 flow [2022-11-21 17:28:50,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 313.25) internal successors, (1253), 4 states have internal predecessors, (1253), 0 states have call successors, (0), 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-21 17:28:50,456 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:28:50,456 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] [2022-11-21 17:28:50,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 17:28:50,456 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-21 17:28:50,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:50,457 INFO L85 PathProgramCache]: Analyzing trace with hash -665147737, now seen corresponding path program 1 times [2022-11-21 17:28:50,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:50,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777680370] [2022-11-21 17:28:50,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:50,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:28:50,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:28:50,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777680370] [2022-11-21 17:28:50,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777680370] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:28:50,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725319403] [2022-11-21 17:28:50,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:50,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:28:50,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:28:50,525 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:28:50,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 17:28:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:50,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 17:28:50,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:28:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:28:50,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:28:50,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725319403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:28:50,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:28:50,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-21 17:28:50,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914313050] [2022-11-21 17:28:50,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:28:50,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:28:50,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:50,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:28:50,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:28:50,675 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-21 17:28:50,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 329 transitions, 720 flow. Second operand has 5 states, 5 states have (on average 312.8) internal successors, (1564), 5 states have internal predecessors, (1564), 0 states have call successors, (0), 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-21 17:28:50,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:28:50,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-21 17:28:50,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:28:50,822 INFO L130 PetriNetUnfolder]: 17/627 cut-off events. [2022-11-21 17:28:50,822 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-11-21 17:28:50,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 627 events. 17/627 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3337 event pairs, 0 based on Foata normal form. 1/548 useless extension candidates. Maximal degree in co-relation 627. Up to 14 conditions per place. [2022-11-21 17:28:50,833 INFO L137 encePairwiseOnDemand]: 376/380 looper letters, 13 selfloop transitions, 5 changer transitions 0/328 dead transitions. [2022-11-21 17:28:50,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 328 transitions, 752 flow [2022-11-21 17:28:50,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:28:50,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-21 17:28:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1255 transitions. [2022-11-21 17:28:50,837 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8256578947368421 [2022-11-21 17:28:50,837 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1255 transitions. [2022-11-21 17:28:50,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1255 transitions. [2022-11-21 17:28:50,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:28:50,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1255 transitions. [2022-11-21 17:28:50,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 313.75) internal successors, (1255), 4 states have internal predecessors, (1255), 0 states have call successors, (0), 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-21 17:28:50,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 380.0) internal successors, (1900), 5 states have internal predecessors, (1900), 0 states have call successors, (0), 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-21 17:28:50,843 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 380.0) internal successors, (1900), 5 states have internal predecessors, (1900), 0 states have call successors, (0), 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-21 17:28:50,843 INFO L175 Difference]: Start difference. First operand has 331 places, 329 transitions, 720 flow. Second operand 4 states and 1255 transitions. [2022-11-21 17:28:50,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 328 transitions, 752 flow [2022-11-21 17:28:50,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 328 transitions, 740 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 17:28:50,850 INFO L231 Difference]: Finished difference. Result has 330 places, 328 transitions, 714 flow [2022-11-21 17:28:50,852 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=714, PETRI_PLACES=330, PETRI_TRANSITIONS=328} [2022-11-21 17:28:50,853 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 5 predicate places. [2022-11-21 17:28:50,853 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 328 transitions, 714 flow [2022-11-21 17:28:50,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 312.8) internal successors, (1564), 5 states have internal predecessors, (1564), 0 states have call successors, (0), 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-21 17:28:50,854 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:28:50,854 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] [2022-11-21 17:28:50,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 17:28:51,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-21 17:28:51,060 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-21 17:28:51,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:51,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1243406533, now seen corresponding path program 1 times [2022-11-21 17:28:51,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:51,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688713229] [2022-11-21 17:28:51,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:51,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:51,131 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-21 17:28:51,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:28:51,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688713229] [2022-11-21 17:28:51,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688713229] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:28:51,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109601744] [2022-11-21 17:28:51,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:51,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:28:51,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:28:51,133 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:28:51,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 17:28:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:51,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 17:28:51,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:28:51,254 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-21 17:28:51,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:28:51,315 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-21 17:28:51,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109601744] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:28:51,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:28:51,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-21 17:28:51,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804532123] [2022-11-21 17:28:51,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:28:51,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 17:28:51,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:51,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 17:28:51,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-21 17:28:51,321 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-21 17:28:51,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 328 transitions, 714 flow. Second operand has 10 states, 10 states have (on average 312.7) internal successors, (3127), 10 states have internal predecessors, (3127), 0 states have call successors, (0), 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-21 17:28:51,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:28:51,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-21 17:28:51,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:28:51,526 INFO L130 PetriNetUnfolder]: 17/635 cut-off events. [2022-11-21 17:28:51,526 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-21 17:28:51,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 635 events. 17/635 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3323 event pairs, 0 based on Foata normal form. 2/557 useless extension candidates. Maximal degree in co-relation 617. Up to 11 conditions per place. [2022-11-21 17:28:51,544 INFO L137 encePairwiseOnDemand]: 374/380 looper letters, 20 selfloop transitions, 9 changer transitions 0/339 dead transitions. [2022-11-21 17:28:51,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 339 transitions, 810 flow [2022-11-21 17:28:51,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 17:28:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-21 17:28:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2821 transitions. [2022-11-21 17:28:51,551 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8248538011695906 [2022-11-21 17:28:51,551 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2821 transitions. [2022-11-21 17:28:51,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2821 transitions. [2022-11-21 17:28:51,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:28:51,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2821 transitions. [2022-11-21 17:28:51,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 313.44444444444446) internal successors, (2821), 9 states have internal predecessors, (2821), 0 states have call successors, (0), 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-21 17:28:51,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 380.0) internal successors, (3800), 10 states have internal predecessors, (3800), 0 states have call successors, (0), 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-21 17:28:51,568 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 380.0) internal successors, (3800), 10 states have internal predecessors, (3800), 0 states have call successors, (0), 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-21 17:28:51,568 INFO L175 Difference]: Start difference. First operand has 330 places, 328 transitions, 714 flow. Second operand 9 states and 2821 transitions. [2022-11-21 17:28:51,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 339 transitions, 810 flow [2022-11-21 17:28:51,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 339 transitions, 796 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 17:28:51,575 INFO L231 Difference]: Finished difference. Result has 339 places, 332 transitions, 760 flow [2022-11-21 17:28:51,576 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=760, PETRI_PLACES=339, PETRI_TRANSITIONS=332} [2022-11-21 17:28:51,577 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 14 predicate places. [2022-11-21 17:28:51,578 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 332 transitions, 760 flow [2022-11-21 17:28:51,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 312.7) internal successors, (3127), 10 states have internal predecessors, (3127), 0 states have call successors, (0), 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-21 17:28:51,579 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:28:51,579 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:28:51,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 17:28:51,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-21 17:28:51,787 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-21 17:28:51,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:51,787 INFO L85 PathProgramCache]: Analyzing trace with hash -479457019, now seen corresponding path program 2 times [2022-11-21 17:28:51,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:51,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933894378] [2022-11-21 17:28:51,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:51,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-21 17:28:51,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:28:51,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933894378] [2022-11-21 17:28:51,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933894378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:28:51,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:28:51,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:28:51,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685784949] [2022-11-21 17:28:51,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:28:51,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:28:51,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:51,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:28:51,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:28:51,850 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-21 17:28:51,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 332 transitions, 760 flow. Second operand has 4 states, 4 states have (on average 311.75) internal successors, (1247), 4 states have internal predecessors, (1247), 0 states have call successors, (0), 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-21 17:28:51,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:28:51,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-21 17:28:51,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:28:51,998 INFO L130 PetriNetUnfolder]: 13/516 cut-off events. [2022-11-21 17:28:51,998 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-21 17:28:52,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 516 events. 13/516 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2446 event pairs, 0 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 520. Up to 21 conditions per place. [2022-11-21 17:28:52,010 INFO L137 encePairwiseOnDemand]: 373/380 looper letters, 19 selfloop transitions, 4 changer transitions 0/339 dead transitions. [2022-11-21 17:28:52,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 339 transitions, 820 flow [2022-11-21 17:28:52,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:28:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 17:28:52,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1576 transitions. [2022-11-21 17:28:52,017 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8294736842105264 [2022-11-21 17:28:52,017 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1576 transitions. [2022-11-21 17:28:52,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1576 transitions. [2022-11-21 17:28:52,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:28:52,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1576 transitions. [2022-11-21 17:28:52,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 315.2) internal successors, (1576), 5 states have internal predecessors, (1576), 0 states have call successors, (0), 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-21 17:28:52,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 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-21 17:28:52,024 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 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-21 17:28:52,025 INFO L175 Difference]: Start difference. First operand has 339 places, 332 transitions, 760 flow. Second operand 5 states and 1576 transitions. [2022-11-21 17:28:52,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 339 transitions, 820 flow [2022-11-21 17:28:52,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 339 transitions, 804 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-21 17:28:52,032 INFO L231 Difference]: Finished difference. Result has 342 places, 335 transitions, 776 flow [2022-11-21 17:28:52,033 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=776, PETRI_PLACES=342, PETRI_TRANSITIONS=335} [2022-11-21 17:28:52,033 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 17 predicate places. [2022-11-21 17:28:52,033 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 335 transitions, 776 flow [2022-11-21 17:28:52,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 311.75) internal successors, (1247), 4 states have internal predecessors, (1247), 0 states have call successors, (0), 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-21 17:28:52,035 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:28:52,035 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-11-21 17:28:52,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 17:28:52,036 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-21 17:28:52,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:52,036 INFO L85 PathProgramCache]: Analyzing trace with hash -504147163, now seen corresponding path program 1 times [2022-11-21 17:28:52,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:52,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79597313] [2022-11-21 17:28:52,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:52,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-21 17:28:52,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:28:52,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79597313] [2022-11-21 17:28:52,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79597313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:28:52,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:28:52,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:28:52,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628161387] [2022-11-21 17:28:52,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:28:52,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:28:52,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:52,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:28:52,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:28:52,126 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-21 17:28:52,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 335 transitions, 776 flow. Second operand has 4 states, 4 states have (on average 313.75) internal successors, (1255), 4 states have internal predecessors, (1255), 0 states have call successors, (0), 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-21 17:28:52,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:28:52,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-21 17:28:52,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:28:52,293 INFO L130 PetriNetUnfolder]: 13/515 cut-off events. [2022-11-21 17:28:52,293 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-11-21 17:28:52,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 515 events. 13/515 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2447 event pairs, 0 based on Foata normal form. 1/458 useless extension candidates. Maximal degree in co-relation 527. Up to 10 conditions per place. [2022-11-21 17:28:52,304 INFO L137 encePairwiseOnDemand]: 374/380 looper letters, 11 selfloop transitions, 8 changer transitions 0/335 dead transitions. [2022-11-21 17:28:52,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 335 transitions, 812 flow [2022-11-21 17:28:52,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:28:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 17:28:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1567 transitions. [2022-11-21 17:28:52,308 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8247368421052632 [2022-11-21 17:28:52,308 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1567 transitions. [2022-11-21 17:28:52,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1567 transitions. [2022-11-21 17:28:52,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:28:52,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1567 transitions. [2022-11-21 17:28:52,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 313.4) internal successors, (1567), 5 states have internal predecessors, (1567), 0 states have call successors, (0), 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-21 17:28:52,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 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-21 17:28:52,315 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 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-21 17:28:52,315 INFO L175 Difference]: Start difference. First operand has 342 places, 335 transitions, 776 flow. Second operand 5 states and 1567 transitions. [2022-11-21 17:28:52,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 335 transitions, 812 flow [2022-11-21 17:28:52,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 335 transitions, 810 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 17:28:52,323 INFO L231 Difference]: Finished difference. Result has 345 places, 335 transitions, 794 flow [2022-11-21 17:28:52,323 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=794, PETRI_PLACES=345, PETRI_TRANSITIONS=335} [2022-11-21 17:28:52,325 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 20 predicate places. [2022-11-21 17:28:52,325 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 335 transitions, 794 flow [2022-11-21 17:28:52,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 313.75) internal successors, (1255), 4 states have internal predecessors, (1255), 0 states have call successors, (0), 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-21 17:28:52,326 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:28:52,326 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2022-11-21 17:28:52,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 17:28:52,326 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-21 17:28:52,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:52,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1551308074, now seen corresponding path program 1 times [2022-11-21 17:28:52,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:52,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936373382] [2022-11-21 17:28:52,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:52,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:52,472 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 17:28:52,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:28:52,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936373382] [2022-11-21 17:28:52,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936373382] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:28:52,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477652978] [2022-11-21 17:28:52,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:52,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:28:52,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:28:52,475 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:28:52,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 17:28:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:52,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 17:28:52,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:28:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 17:28:52,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:28:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 17:28:52,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477652978] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:28:52,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:28:52,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-21 17:28:52,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923229903] [2022-11-21 17:28:52,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:28:52,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-21 17:28:52,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:52,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 17:28:52,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-21 17:28:52,785 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-21 17:28:52,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 335 transitions, 794 flow. Second operand has 18 states, 18 states have (on average 313.1111111111111) internal successors, (5636), 18 states have internal predecessors, (5636), 0 states have call successors, (0), 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-21 17:28:52,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:28:52,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-21 17:28:52,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:28:53,199 INFO L130 PetriNetUnfolder]: 13/543 cut-off events. [2022-11-21 17:28:53,199 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-11-21 17:28:53,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 543 events. 13/543 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2440 event pairs, 0 based on Foata normal form. 4/489 useless extension candidates. Maximal degree in co-relation 521. Up to 11 conditions per place. [2022-11-21 17:28:53,208 INFO L137 encePairwiseOnDemand]: 374/380 looper letters, 36 selfloop transitions, 21 changer transitions 0/370 dead transitions. [2022-11-21 17:28:53,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 370 transitions, 1062 flow [2022-11-21 17:28:53,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 17:28:53,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-21 17:28:53,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6571 transitions. [2022-11-21 17:28:53,228 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8234335839598997 [2022-11-21 17:28:53,228 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 6571 transitions. [2022-11-21 17:28:53,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 6571 transitions. [2022-11-21 17:28:53,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:28:53,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 6571 transitions. [2022-11-21 17:28:53,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 312.9047619047619) internal successors, (6571), 21 states have internal predecessors, (6571), 0 states have call successors, (0), 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-21 17:28:53,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 380.0) internal successors, (8360), 22 states have internal predecessors, (8360), 0 states have call successors, (0), 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-21 17:28:53,262 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 380.0) internal successors, (8360), 22 states have internal predecessors, (8360), 0 states have call successors, (0), 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-21 17:28:53,262 INFO L175 Difference]: Start difference. First operand has 345 places, 335 transitions, 794 flow. Second operand 21 states and 6571 transitions. [2022-11-21 17:28:53,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 370 transitions, 1062 flow [2022-11-21 17:28:53,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 370 transitions, 1050 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 17:28:53,271 INFO L231 Difference]: Finished difference. Result has 367 places, 348 transitions, 938 flow [2022-11-21 17:28:53,272 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=938, PETRI_PLACES=367, PETRI_TRANSITIONS=348} [2022-11-21 17:28:53,273 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 42 predicate places. [2022-11-21 17:28:53,273 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 348 transitions, 938 flow [2022-11-21 17:28:53,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 313.1111111111111) internal successors, (5636), 18 states have internal predecessors, (5636), 0 states have call successors, (0), 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-21 17:28:53,275 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:28:53,275 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 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] [2022-11-21 17:28:53,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 17:28:53,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-21 17:28:53,482 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-21 17:28:53,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:53,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1908419414, now seen corresponding path program 2 times [2022-11-21 17:28:53,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:53,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630219021] [2022-11-21 17:28:53,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:53,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 17:28:53,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:28:53,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630219021] [2022-11-21 17:28:53,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630219021] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:28:53,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846209296] [2022-11-21 17:28:53,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:28:53,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:28:53,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:28:53,841 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:28:53,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 17:28:53,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:28:53,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:28:53,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 17:28:53,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:28:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 17:28:54,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:28:54,314 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 17:28:54,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846209296] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:28:54,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:28:54,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-21 17:28:54,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185670267] [2022-11-21 17:28:54,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:28:54,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-21 17:28:54,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:54,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-21 17:28:54,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-21 17:28:54,323 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-21 17:28:54,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 348 transitions, 938 flow. Second operand has 23 states, 23 states have (on average 313.3478260869565) internal successors, (7207), 23 states have internal predecessors, (7207), 0 states have call successors, (0), 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-21 17:28:54,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:28:54,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-21 17:28:54,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:28:54,901 INFO L130 PetriNetUnfolder]: 13/564 cut-off events. [2022-11-21 17:28:54,901 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2022-11-21 17:28:54,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 564 events. 13/564 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2440 event pairs, 0 based on Foata normal form. 3/509 useless extension candidates. Maximal degree in co-relation 575. Up to 12 conditions per place. [2022-11-21 17:28:54,913 INFO L137 encePairwiseOnDemand]: 374/380 looper letters, 48 selfloop transitions, 30 changer transitions 0/391 dead transitions. [2022-11-21 17:28:54,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 391 transitions, 1304 flow [2022-11-21 17:28:54,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-21 17:28:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-21 17:28:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9381 transitions. [2022-11-21 17:28:54,926 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8228947368421052 [2022-11-21 17:28:54,926 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 9381 transitions. [2022-11-21 17:28:54,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 9381 transitions. [2022-11-21 17:28:54,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:28:54,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 9381 transitions. [2022-11-21 17:28:54,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 312.7) internal successors, (9381), 30 states have internal predecessors, (9381), 0 states have call successors, (0), 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-21 17:28:54,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 380.0) internal successors, (11780), 31 states have internal predecessors, (11780), 0 states have call successors, (0), 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-21 17:28:54,971 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 380.0) internal successors, (11780), 31 states have internal predecessors, (11780), 0 states have call successors, (0), 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-21 17:28:54,971 INFO L175 Difference]: Start difference. First operand has 367 places, 348 transitions, 938 flow. Second operand 30 states and 9381 transitions. [2022-11-21 17:28:54,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 391 transitions, 1304 flow [2022-11-21 17:28:54,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 391 transitions, 1224 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-21 17:28:54,981 INFO L231 Difference]: Finished difference. Result has 392 places, 358 transitions, 1036 flow [2022-11-21 17:28:54,982 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1036, PETRI_PLACES=392, PETRI_TRANSITIONS=358} [2022-11-21 17:28:54,983 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 67 predicate places. [2022-11-21 17:28:54,983 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 358 transitions, 1036 flow [2022-11-21 17:28:54,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 313.3478260869565) internal successors, (7207), 23 states have internal predecessors, (7207), 0 states have call successors, (0), 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-21 17:28:54,985 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:28:54,985 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 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] [2022-11-21 17:28:54,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-21 17:28:55,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 17:28:55,193 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-21 17:28:55,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:55,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2090743300, now seen corresponding path program 3 times [2022-11-21 17:28:55,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:55,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553201878] [2022-11-21 17:28:55,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:55,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-21 17:28:55,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:28:55,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553201878] [2022-11-21 17:28:55,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553201878] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:28:55,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460249979] [2022-11-21 17:28:55,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 17:28:55,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:28:55,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:28:55,340 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:28:55,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 17:28:55,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-21 17:28:55,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:28:55,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 17:28:55,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:28:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-21 17:28:55,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:28:55,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460249979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:28:55,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:28:55,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-21 17:28:55,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233102052] [2022-11-21 17:28:55,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:28:55,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:28:55,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:55,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:28:55,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:28:55,525 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-21 17:28:55,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 358 transitions, 1036 flow. Second operand has 5 states, 5 states have (on average 313.2) internal successors, (1566), 5 states have internal predecessors, (1566), 0 states have call successors, (0), 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-21 17:28:55,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:28:55,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-21 17:28:55,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:28:55,741 INFO L130 PetriNetUnfolder]: 13/563 cut-off events. [2022-11-21 17:28:55,741 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-11-21 17:28:55,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 563 events. 13/563 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2437 event pairs, 0 based on Foata normal form. 1/506 useless extension candidates. Maximal degree in co-relation 536. Up to 17 conditions per place. [2022-11-21 17:28:55,751 INFO L137 encePairwiseOnDemand]: 376/380 looper letters, 13 selfloop transitions, 5 changer transitions 0/357 dead transitions. [2022-11-21 17:28:55,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 357 transitions, 1068 flow [2022-11-21 17:28:55,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:28:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-21 17:28:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1255 transitions. [2022-11-21 17:28:55,754 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8256578947368421 [2022-11-21 17:28:55,754 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1255 transitions. [2022-11-21 17:28:55,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1255 transitions. [2022-11-21 17:28:55,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:28:55,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1255 transitions. [2022-11-21 17:28:55,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 313.75) internal successors, (1255), 4 states have internal predecessors, (1255), 0 states have call successors, (0), 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-21 17:28:55,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 380.0) internal successors, (1900), 5 states have internal predecessors, (1900), 0 states have call successors, (0), 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-21 17:28:55,760 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 380.0) internal successors, (1900), 5 states have internal predecessors, (1900), 0 states have call successors, (0), 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-21 17:28:55,761 INFO L175 Difference]: Start difference. First operand has 392 places, 358 transitions, 1036 flow. Second operand 4 states and 1255 transitions. [2022-11-21 17:28:55,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 357 transitions, 1068 flow [2022-11-21 17:28:55,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 357 transitions, 1022 flow, removed 5 selfloop flow, removed 18 redundant places. [2022-11-21 17:28:55,770 INFO L231 Difference]: Finished difference. Result has 376 places, 357 transitions, 996 flow [2022-11-21 17:28:55,771 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=996, PETRI_PLACES=376, PETRI_TRANSITIONS=357} [2022-11-21 17:28:55,771 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 51 predicate places. [2022-11-21 17:28:55,772 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 357 transitions, 996 flow [2022-11-21 17:28:55,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 313.2) internal successors, (1566), 5 states have internal predecessors, (1566), 0 states have call successors, (0), 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-21 17:28:55,772 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:28:55,773 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:28:55,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 17:28:55,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-21 17:28:55,979 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-21 17:28:55,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:55,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2023100470, now seen corresponding path program 1 times [2022-11-21 17:28:55,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:55,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309094546] [2022-11-21 17:28:55,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:55,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-21 17:28:56,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:28:56,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309094546] [2022-11-21 17:28:56,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309094546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:28:56,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:28:56,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-21 17:28:56,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879495197] [2022-11-21 17:28:56,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:28:56,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 17:28:56,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:56,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 17:28:56,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-21 17:28:56,971 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 380 [2022-11-21 17:28:56,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 357 transitions, 996 flow. Second operand has 13 states, 13 states have (on average 242.15384615384616) internal successors, (3148), 13 states have internal predecessors, (3148), 0 states have call successors, (0), 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-21 17:28:56,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:28:56,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 380 [2022-11-21 17:28:56,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:29:20,217 INFO L130 PetriNetUnfolder]: 39167/112347 cut-off events. [2022-11-21 17:29:20,218 INFO L131 PetriNetUnfolder]: For 983/984 co-relation queries the response was YES. [2022-11-21 17:29:20,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170324 conditions, 112347 events. 39167/112347 cut-off events. For 983/984 co-relation queries the response was YES. Maximal size of possible extension queue 3170. Compared 1622938 event pairs, 7977 based on Foata normal form. 0/100150 useless extension candidates. Maximal degree in co-relation 170056. Up to 33109 conditions per place. [2022-11-21 17:29:21,642 INFO L137 encePairwiseOnDemand]: 359/380 looper letters, 546 selfloop transitions, 72 changer transitions 0/889 dead transitions. [2022-11-21 17:29:21,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 889 transitions, 3377 flow [2022-11-21 17:29:21,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-21 17:29:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-11-21 17:29:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 6630 transitions. [2022-11-21 17:29:21,657 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6978947368421052 [2022-11-21 17:29:21,657 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 6630 transitions. [2022-11-21 17:29:21,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 6630 transitions. [2022-11-21 17:29:21,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:29:21,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 6630 transitions. [2022-11-21 17:29:21,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 265.2) internal successors, (6630), 25 states have internal predecessors, (6630), 0 states have call successors, (0), 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-21 17:29:21,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 380.0) internal successors, (9880), 26 states have internal predecessors, (9880), 0 states have call successors, (0), 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-21 17:29:21,695 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 380.0) internal successors, (9880), 26 states have internal predecessors, (9880), 0 states have call successors, (0), 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-21 17:29:21,696 INFO L175 Difference]: Start difference. First operand has 376 places, 357 transitions, 996 flow. Second operand 25 states and 6630 transitions. [2022-11-21 17:29:21,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 889 transitions, 3377 flow [2022-11-21 17:29:21,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 889 transitions, 3367 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 17:29:21,722 INFO L231 Difference]: Finished difference. Result has 415 places, 443 transitions, 1556 flow [2022-11-21 17:29:21,723 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1556, PETRI_PLACES=415, PETRI_TRANSITIONS=443} [2022-11-21 17:29:21,723 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 90 predicate places. [2022-11-21 17:29:21,723 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 443 transitions, 1556 flow [2022-11-21 17:29:21,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 242.15384615384616) internal successors, (3148), 13 states have internal predecessors, (3148), 0 states have call successors, (0), 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-21 17:29:21,725 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:29:21,725 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:29:21,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 17:29:21,726 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-21 17:29:21,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:21,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1238947357, now seen corresponding path program 1 times [2022-11-21 17:29:21,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:21,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739450293] [2022-11-21 17:29:21,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:21,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-21 17:29:21,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:21,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739450293] [2022-11-21 17:29:21,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739450293] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:29:21,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951553690] [2022-11-21 17:29:21,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:21,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:29:21,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:29:21,873 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:29:21,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 17:29:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:22,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 17:29:22,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:29:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2022-11-21 17:29:22,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:29:22,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951553690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:22,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:29:22,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-21 17:29:22,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098192037] [2022-11-21 17:29:22,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:22,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:29:22,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:22,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:29:22,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:29:22,042 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 380 [2022-11-21 17:29:22,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 443 transitions, 1556 flow. Second operand has 3 states, 3 states have (on average 315.6666666666667) internal successors, (947), 3 states have internal predecessors, (947), 0 states have call successors, (0), 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-21 17:29:22,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:29:22,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 380 [2022-11-21 17:29:22,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:29:23,318 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] t_funEXIT-->L958-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_7|} AuxVars[] AssignedVars[][383], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, t_funThread1of2ForFork0NotInUse, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-21 17:29:23,319 INFO L383 tUnfolder$Statistics]: this new event has 225 ancestors and is cut-off event [2022-11-21 17:29:23,319 INFO L386 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-11-21 17:29:23,319 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-21 17:29:23,319 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-21 17:29:23,534 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] t_funEXIT-->L958-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_7|} AuxVars[] AssignedVars[][383], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, t_funThread1of2ForFork0NotInUse, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread2of2ForFork0InUse, Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), 21#t_funENTRYtrue, Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-21 17:29:23,534 INFO L383 tUnfolder$Statistics]: this new event has 237 ancestors and is cut-off event [2022-11-21 17:29:23,535 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-21 17:29:23,535 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-21 17:29:23,535 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-21 17:29:23,542 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1319] t_funEXIT-->L958-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][416], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 249#t_funENTRYtrue, Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-21 17:29:23,542 INFO L383 tUnfolder$Statistics]: this new event has 237 ancestors and is cut-off event [2022-11-21 17:29:23,542 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-21 17:29:23,542 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-21 17:29:23,542 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-21 17:29:23,840 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] t_funEXIT-->L958-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_7|} AuxVars[] AssignedVars[][383], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, t_funThread1of2ForFork0NotInUse, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread2of2ForFork0InUse, Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 232#L941-10true, 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-21 17:29:23,841 INFO L383 tUnfolder$Statistics]: this new event has 246 ancestors and is cut-off event [2022-11-21 17:29:23,841 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-21 17:29:23,841 INFO L386 tUnfolder$Statistics]: existing Event has 258 ancestors and is cut-off event [2022-11-21 17:29:23,841 INFO L386 tUnfolder$Statistics]: existing Event has 246 ancestors and is cut-off event [2022-11-21 17:29:23,841 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1319] t_funEXIT-->L958-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][416], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 17#L940true, Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-21 17:29:23,842 INFO L383 tUnfolder$Statistics]: this new event has 245 ancestors and is cut-off event [2022-11-21 17:29:23,842 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-21 17:29:23,842 INFO L386 tUnfolder$Statistics]: existing Event has 245 ancestors and is cut-off event [2022-11-21 17:29:23,842 INFO L386 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-11-21 17:29:23,888 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1319] t_funEXIT-->L958-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][416], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, t_funThread1of2ForFork0NotInUse, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-21 17:29:23,889 INFO L383 tUnfolder$Statistics]: this new event has 270 ancestors and is cut-off event [2022-11-21 17:29:23,889 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-21 17:29:23,889 INFO L386 tUnfolder$Statistics]: existing Event has 252 ancestors and is cut-off event [2022-11-21 17:29:23,889 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-21 17:29:23,933 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1319] t_funEXIT-->L958-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][416], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, t_funThread1of2ForFork0NotInUse, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-21 17:29:23,934 INFO L383 tUnfolder$Statistics]: this new event has 252 ancestors and is cut-off event [2022-11-21 17:29:23,934 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-21 17:29:23,934 INFO L386 tUnfolder$Statistics]: existing Event has 270 ancestors and is cut-off event [2022-11-21 17:29:23,934 INFO L386 tUnfolder$Statistics]: existing Event has 252 ancestors and is cut-off event [2022-11-21 17:29:23,934 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-21 17:29:23,935 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1061] L953-17-->L953-18: Formula: (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t_ids~0#1.base_5| 0)) InVars {ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid][387], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, t_funThread1of2ForFork0NotInUse, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread2of2ForFork0InUse, Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), 2234#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 232#L941-10true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 136#L953-18true, Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-21 17:29:23,936 INFO L383 tUnfolder$Statistics]: this new event has 225 ancestors and is cut-off event [2022-11-21 17:29:23,936 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-21 17:29:23,936 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-21 17:29:23,936 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-21 17:29:23,970 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1319] t_funEXIT-->L958-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][416], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, 97#L941-6true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-21 17:29:23,970 INFO L383 tUnfolder$Statistics]: this new event has 254 ancestors and is cut-off event [2022-11-21 17:29:23,971 INFO L386 tUnfolder$Statistics]: existing Event has 254 ancestors and is cut-off event [2022-11-21 17:29:23,971 INFO L386 tUnfolder$Statistics]: existing Event has 212 ancestors and is cut-off event [2022-11-21 17:29:23,971 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-21 17:29:24,096 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1160] L946-4-->L946-5: Formula: (and (= |v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset_1| (+ (* |v_t_funThread1of2ForFork0_~i~0#1_9| 28) |v_~#cache~0.offset_11|)) (= |v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base_1| |v_~#cache~0.base_12|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_11|, ~#cache~0.base=|v_~#cache~0.base_12|, t_funThread1of2ForFork0_~i~0#1=|v_t_funThread1of2ForFork0_~i~0#1_9|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_11|, ~#cache~0.base=|v_~#cache~0.base_12|, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base=|v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base_1|, t_funThread1of2ForFork0_~i~0#1=|v_t_funThread1of2ForFork0_~i~0#1_9|, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset=|v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset_1|} AuxVars[] AssignedVars[t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base][201], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread2of2ForFork0InUse, Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), 181#L946-5true, 280#L959true, Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 232#L941-10true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-21 17:29:24,096 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-21 17:29:24,097 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-21 17:29:24,097 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-21 17:29:24,097 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-21 17:29:24,161 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1061] L953-17-->L953-18: Formula: (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t_ids~0#1.base_5| 0)) InVars {ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid][387], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 153#L941-10true, Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), 2234#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 136#L953-18true, Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-21 17:29:24,161 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-21 17:29:24,161 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-21 17:29:24,161 INFO L386 tUnfolder$Statistics]: existing Event has 228 ancestors and is cut-off event [2022-11-21 17:29:24,162 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-21 17:29:24,162 INFO L130 PetriNetUnfolder]: 659/7493 cut-off events. [2022-11-21 17:29:24,162 INFO L131 PetriNetUnfolder]: For 3509/3738 co-relation queries the response was YES. [2022-11-21 17:29:24,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10297 conditions, 7493 events. 659/7493 cut-off events. For 3509/3738 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 81498 event pairs, 80 based on Foata normal form. 29/6508 useless extension candidates. Maximal degree in co-relation 10101. Up to 251 conditions per place. [2022-11-21 17:29:24,292 INFO L137 encePairwiseOnDemand]: 377/380 looper letters, 14 selfloop transitions, 2 changer transitions 0/447 dead transitions. [2022-11-21 17:29:24,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 447 transitions, 1596 flow [2022-11-21 17:29:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:29:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:29:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2022-11-21 17:29:24,295 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8412280701754385 [2022-11-21 17:29:24,295 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 959 transitions. [2022-11-21 17:29:24,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 959 transitions. [2022-11-21 17:29:24,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:29:24,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 959 transitions. [2022-11-21 17:29:24,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 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-21 17:29:24,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 380.0) internal successors, (1520), 4 states have internal predecessors, (1520), 0 states have call successors, (0), 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-21 17:29:24,300 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 380.0) internal successors, (1520), 4 states have internal predecessors, (1520), 0 states have call successors, (0), 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-21 17:29:24,300 INFO L175 Difference]: Start difference. First operand has 415 places, 443 transitions, 1556 flow. Second operand 3 states and 959 transitions. [2022-11-21 17:29:24,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 447 transitions, 1596 flow [2022-11-21 17:29:24,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 447 transitions, 1593 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 17:29:24,331 INFO L231 Difference]: Finished difference. Result has 416 places, 444 transitions, 1565 flow [2022-11-21 17:29:24,331 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1565, PETRI_PLACES=416, PETRI_TRANSITIONS=444} [2022-11-21 17:29:24,332 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 91 predicate places. [2022-11-21 17:29:24,332 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 444 transitions, 1565 flow [2022-11-21 17:29:24,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.6666666666667) internal successors, (947), 3 states have internal predecessors, (947), 0 states have call successors, (0), 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-21 17:29:24,333 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:29:24,333 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 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] [2022-11-21 17:29:24,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 17:29:24,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:29:24,539 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-21 17:29:24,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:24,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1502322475, now seen corresponding path program 1 times [2022-11-21 17:29:24,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:24,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040722395] [2022-11-21 17:29:24,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:24,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:29:24,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:29:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:29:24,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:29:24,609 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 17:29:24,609 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 35 remaining) [2022-11-21 17:29:24,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 35 remaining) [2022-11-21 17:29:24,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 35 remaining) [2022-11-21 17:29:24,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 35 remaining) [2022-11-21 17:29:24,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 35 remaining) [2022-11-21 17:29:24,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 35 remaining) [2022-11-21 17:29:24,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 35 remaining) [2022-11-21 17:29:24,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 35 remaining) [2022-11-21 17:29:24,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 35 remaining) [2022-11-21 17:29:24,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 35 remaining) [2022-11-21 17:29:24,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 35 remaining) [2022-11-21 17:29:24,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 35 remaining) [2022-11-21 17:29:24,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 35 remaining) [2022-11-21 17:29:24,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 35 remaining) [2022-11-21 17:29:24,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 35 remaining) [2022-11-21 17:29:24,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 35 remaining) [2022-11-21 17:29:24,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 35 remaining) [2022-11-21 17:29:24,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 35 remaining) [2022-11-21 17:29:24,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 35 remaining) [2022-11-21 17:29:24,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 35 remaining) [2022-11-21 17:29:24,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 35 remaining) [2022-11-21 17:29:24,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 35 remaining) [2022-11-21 17:29:24,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 35 remaining) [2022-11-21 17:29:24,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 35 remaining) [2022-11-21 17:29:24,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 35 remaining) [2022-11-21 17:29:24,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 35 remaining) [2022-11-21 17:29:24,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 35 remaining) [2022-11-21 17:29:24,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 35 remaining) [2022-11-21 17:29:24,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 35 remaining) [2022-11-21 17:29:24,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 35 remaining) [2022-11-21 17:29:24,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 35 remaining) [2022-11-21 17:29:24,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 35 remaining) [2022-11-21 17:29:24,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 35 remaining) [2022-11-21 17:29:24,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 35 remaining) [2022-11-21 17:29:24,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 35 remaining) [2022-11-21 17:29:24,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 17:29:24,616 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:29:24,617 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-21 17:29:24,617 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-21 17:29:24,673 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-21 17:29:24,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 396 places, 464 transitions, 958 flow [2022-11-21 17:29:24,874 INFO L130 PetriNetUnfolder]: 168/1050 cut-off events. [2022-11-21 17:29:24,874 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-21 17:29:24,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 1050 events. 168/1050 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5982 event pairs, 1 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 739. Up to 16 conditions per place. [2022-11-21 17:29:24,899 INFO L82 GeneralOperation]: Start removeDead. Operand has 396 places, 464 transitions, 958 flow [2022-11-21 17:29:24,913 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 396 places, 464 transitions, 958 flow [2022-11-21 17:29:24,918 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:29:24,918 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;@643744a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:29:24,919 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-11-21 17:29:24,921 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-21 17:29:24,921 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 17:29:24,921 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:29:24,922 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] [2022-11-21 17:29:24,922 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-21 17:29:24,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:24,922 INFO L85 PathProgramCache]: Analyzing trace with hash 909625557, now seen corresponding path program 1 times [2022-11-21 17:29:24,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:24,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112494450] [2022-11-21 17:29:24,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:24,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:24,957 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-21 17:29:24,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:24,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112494450] [2022-11-21 17:29:24,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112494450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:24,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:24,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:29:24,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883652391] [2022-11-21 17:29:24,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:24,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:29:24,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:24,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:29:24,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:29:24,962 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-21 17:29:24,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 464 transitions, 958 flow. Second operand has 4 states, 4 states have (on average 380.5) internal successors, (1522), 4 states have internal predecessors, (1522), 0 states have call successors, (0), 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-21 17:29:24,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:29:24,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-21 17:29:24,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:29:25,195 INFO L130 PetriNetUnfolder]: 27/905 cut-off events. [2022-11-21 17:29:25,196 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-21 17:29:25,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 905 events. 27/905 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5231 event pairs, 1 based on Foata normal form. 258/1041 useless extension candidates. Maximal degree in co-relation 662. Up to 28 conditions per place. [2022-11-21 17:29:25,218 INFO L137 encePairwiseOnDemand]: 395/464 looper letters, 21 selfloop transitions, 4 changer transitions 0/404 dead transitions. [2022-11-21 17:29:25,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 404 transitions, 888 flow [2022-11-21 17:29:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:29:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 17:29:25,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1986 transitions. [2022-11-21 17:29:25,222 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8560344827586207 [2022-11-21 17:29:25,222 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1986 transitions. [2022-11-21 17:29:25,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1986 transitions. [2022-11-21 17:29:25,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:29:25,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1986 transitions. [2022-11-21 17:29:25,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 397.2) internal successors, (1986), 5 states have internal predecessors, (1986), 0 states have call successors, (0), 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-21 17:29:25,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 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-21 17:29:25,231 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 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-21 17:29:25,232 INFO L175 Difference]: Start difference. First operand has 396 places, 464 transitions, 958 flow. Second operand 5 states and 1986 transitions. [2022-11-21 17:29:25,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 404 transitions, 888 flow [2022-11-21 17:29:25,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 404 transitions, 888 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 17:29:25,240 INFO L231 Difference]: Finished difference. Result has 398 places, 400 transitions, 856 flow [2022-11-21 17:29:25,240 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=856, PETRI_PLACES=398, PETRI_TRANSITIONS=400} [2022-11-21 17:29:25,241 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 2 predicate places. [2022-11-21 17:29:25,241 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 400 transitions, 856 flow [2022-11-21 17:29:25,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 380.5) internal successors, (1522), 4 states have internal predecessors, (1522), 0 states have call successors, (0), 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-21 17:29:25,242 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:29:25,242 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:29:25,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 17:29:25,243 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-21 17:29:25,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:25,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1200505293, now seen corresponding path program 1 times [2022-11-21 17:29:25,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:25,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035209352] [2022-11-21 17:29:25,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:25,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:25,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:29:25,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:25,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035209352] [2022-11-21 17:29:25,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035209352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:25,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:25,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:29:25,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719950631] [2022-11-21 17:29:25,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:25,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:29:25,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:25,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:29:25,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:29:25,285 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-21 17:29:25,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 400 transitions, 856 flow. Second operand has 4 states, 4 states have (on average 382.25) internal successors, (1529), 4 states have internal predecessors, (1529), 0 states have call successors, (0), 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-21 17:29:25,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:29:25,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-21 17:29:25,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:29:25,645 INFO L130 PetriNetUnfolder]: 27/904 cut-off events. [2022-11-21 17:29:25,645 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-11-21 17:29:25,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 904 events. 27/904 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5224 event pairs, 1 based on Foata normal form. 1/786 useless extension candidates. Maximal degree in co-relation 927. Up to 20 conditions per place. [2022-11-21 17:29:25,666 INFO L137 encePairwiseOnDemand]: 458/464 looper letters, 13 selfloop transitions, 8 changer transitions 0/400 dead transitions. [2022-11-21 17:29:25,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 400 transitions, 896 flow [2022-11-21 17:29:25,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:29:25,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 17:29:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1914 transitions. [2022-11-21 17:29:25,669 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825 [2022-11-21 17:29:25,669 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1914 transitions. [2022-11-21 17:29:25,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1914 transitions. [2022-11-21 17:29:25,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:29:25,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1914 transitions. [2022-11-21 17:29:25,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 382.8) internal successors, (1914), 5 states have internal predecessors, (1914), 0 states have call successors, (0), 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-21 17:29:25,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 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-21 17:29:25,678 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 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-21 17:29:25,678 INFO L175 Difference]: Start difference. First operand has 398 places, 400 transitions, 856 flow. Second operand 5 states and 1914 transitions. [2022-11-21 17:29:25,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 400 transitions, 896 flow [2022-11-21 17:29:25,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 400 transitions, 894 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 17:29:25,687 INFO L231 Difference]: Finished difference. Result has 401 places, 400 transitions, 874 flow [2022-11-21 17:29:25,688 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=874, PETRI_PLACES=401, PETRI_TRANSITIONS=400} [2022-11-21 17:29:25,689 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 5 predicate places. [2022-11-21 17:29:25,689 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 400 transitions, 874 flow [2022-11-21 17:29:25,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 382.25) internal successors, (1529), 4 states have internal predecessors, (1529), 0 states have call successors, (0), 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-21 17:29:25,690 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:29:25,690 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] [2022-11-21 17:29:25,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 17:29:25,690 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-21 17:29:25,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:25,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1439043191, now seen corresponding path program 1 times [2022-11-21 17:29:25,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:25,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944676454] [2022-11-21 17:29:25,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:25,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:29:25,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:25,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944676454] [2022-11-21 17:29:25,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944676454] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:29:25,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430787181] [2022-11-21 17:29:25,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:25,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:29:25,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:29:25,751 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:29:25,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 17:29:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:25,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 17:29:25,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:29:25,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:29:25,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:29:25,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430787181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:25,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:29:25,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-21 17:29:25,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263297798] [2022-11-21 17:29:25,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:25,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:29:25,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:25,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:29:25,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:29:25,923 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-21 17:29:25,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 400 transitions, 874 flow. Second operand has 5 states, 5 states have (on average 381.8) internal successors, (1909), 5 states have internal predecessors, (1909), 0 states have call successors, (0), 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-21 17:29:25,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:29:25,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-21 17:29:25,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:29:26,171 INFO L130 PetriNetUnfolder]: 27/903 cut-off events. [2022-11-21 17:29:26,171 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-11-21 17:29:26,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 903 events. 27/903 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5219 event pairs, 1 based on Foata normal form. 1/785 useless extension candidates. Maximal degree in co-relation 925. Up to 23 conditions per place. [2022-11-21 17:29:26,196 INFO L137 encePairwiseOnDemand]: 460/464 looper letters, 15 selfloop transitions, 5 changer transitions 0/399 dead transitions. [2022-11-21 17:29:26,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 399 transitions, 910 flow [2022-11-21 17:29:26,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:29:26,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-21 17:29:26,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1533 transitions. [2022-11-21 17:29:26,200 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8259698275862069 [2022-11-21 17:29:26,200 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1533 transitions. [2022-11-21 17:29:26,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1533 transitions. [2022-11-21 17:29:26,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:29:26,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1533 transitions. [2022-11-21 17:29:26,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 383.25) internal successors, (1533), 4 states have internal predecessors, (1533), 0 states have call successors, (0), 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-21 17:29:26,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 464.0) internal successors, (2320), 5 states have internal predecessors, (2320), 0 states have call successors, (0), 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-21 17:29:26,208 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 464.0) internal successors, (2320), 5 states have internal predecessors, (2320), 0 states have call successors, (0), 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-21 17:29:26,208 INFO L175 Difference]: Start difference. First operand has 401 places, 400 transitions, 874 flow. Second operand 4 states and 1533 transitions. [2022-11-21 17:29:26,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 399 transitions, 910 flow [2022-11-21 17:29:26,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 399 transitions, 898 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 17:29:26,216 INFO L231 Difference]: Finished difference. Result has 400 places, 399 transitions, 868 flow [2022-11-21 17:29:26,216 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=868, PETRI_PLACES=400, PETRI_TRANSITIONS=399} [2022-11-21 17:29:26,217 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 4 predicate places. [2022-11-21 17:29:26,217 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 399 transitions, 868 flow [2022-11-21 17:29:26,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 381.8) internal successors, (1909), 5 states have internal predecessors, (1909), 0 states have call successors, (0), 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-21 17:29:26,218 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:29:26,218 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] [2022-11-21 17:29:26,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 17:29:26,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:29:26,424 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-21 17:29:26,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:26,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1930893337, now seen corresponding path program 1 times [2022-11-21 17:29:26,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:26,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958757803] [2022-11-21 17:29:26,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:26,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:26,477 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-21 17:29:26,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:26,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958757803] [2022-11-21 17:29:26,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958757803] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:29:26,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29581920] [2022-11-21 17:29:26,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:26,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:29:26,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:29:26,479 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:29:26,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 17:29:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:26,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 17:29:26,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:29:26,629 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-21 17:29:26,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:29:26,668 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-21 17:29:26,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29581920] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:29:26,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:29:26,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-21 17:29:26,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584427761] [2022-11-21 17:29:26,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:29:26,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 17:29:26,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:26,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 17:29:26,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-21 17:29:26,675 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-21 17:29:26,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 399 transitions, 868 flow. Second operand has 10 states, 10 states have (on average 381.7) internal successors, (3817), 10 states have internal predecessors, (3817), 0 states have call successors, (0), 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-21 17:29:26,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:29:26,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-21 17:29:26,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:29:26,984 INFO L130 PetriNetUnfolder]: 27/911 cut-off events. [2022-11-21 17:29:26,984 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-11-21 17:29:27,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 911 events. 27/911 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5208 event pairs, 1 based on Foata normal form. 2/794 useless extension candidates. Maximal degree in co-relation 915. Up to 20 conditions per place. [2022-11-21 17:29:27,008 INFO L137 encePairwiseOnDemand]: 458/464 looper letters, 22 selfloop transitions, 9 changer transitions 0/410 dead transitions. [2022-11-21 17:29:27,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 410 transitions, 968 flow [2022-11-21 17:29:27,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 17:29:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-21 17:29:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3444 transitions. [2022-11-21 17:29:27,015 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8247126436781609 [2022-11-21 17:29:27,015 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3444 transitions. [2022-11-21 17:29:27,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3444 transitions. [2022-11-21 17:29:27,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:29:27,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3444 transitions. [2022-11-21 17:29:27,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 382.6666666666667) internal successors, (3444), 9 states have internal predecessors, (3444), 0 states have call successors, (0), 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-21 17:29:27,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 464.0) internal successors, (4640), 10 states have internal predecessors, (4640), 0 states have call successors, (0), 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-21 17:29:27,043 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 464.0) internal successors, (4640), 10 states have internal predecessors, (4640), 0 states have call successors, (0), 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-21 17:29:27,044 INFO L175 Difference]: Start difference. First operand has 400 places, 399 transitions, 868 flow. Second operand 9 states and 3444 transitions. [2022-11-21 17:29:27,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 410 transitions, 968 flow [2022-11-21 17:29:27,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 410 transitions, 954 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 17:29:27,052 INFO L231 Difference]: Finished difference. Result has 409 places, 403 transitions, 914 flow [2022-11-21 17:29:27,052 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=914, PETRI_PLACES=409, PETRI_TRANSITIONS=403} [2022-11-21 17:29:27,053 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 13 predicate places. [2022-11-21 17:29:27,053 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 403 transitions, 914 flow [2022-11-21 17:29:27,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 381.7) internal successors, (3817), 10 states have internal predecessors, (3817), 0 states have call successors, (0), 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-21 17:29:27,055 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:29:27,055 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:29:27,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-21 17:29:27,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:29:27,261 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-21 17:29:27,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:27,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1058192857, now seen corresponding path program 2 times [2022-11-21 17:29:27,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:27,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615067253] [2022-11-21 17:29:27,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:27,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:27,313 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-21 17:29:27,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:27,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615067253] [2022-11-21 17:29:27,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615067253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:27,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:27,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:29:27,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112615343] [2022-11-21 17:29:27,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:27,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:29:27,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:27,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:29:27,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:29:27,317 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-21 17:29:27,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 403 transitions, 914 flow. Second operand has 4 states, 4 states have (on average 380.75) internal successors, (1523), 4 states have internal predecessors, (1523), 0 states have call successors, (0), 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-21 17:29:27,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:29:27,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-21 17:29:27,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:29:27,567 INFO L130 PetriNetUnfolder]: 23/792 cut-off events. [2022-11-21 17:29:27,568 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-11-21 17:29:27,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 792 events. 23/792 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4329 event pairs, 1 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 828. Up to 40 conditions per place. [2022-11-21 17:29:27,591 INFO L137 encePairwiseOnDemand]: 457/464 looper letters, 21 selfloop transitions, 4 changer transitions 0/410 dead transitions. [2022-11-21 17:29:27,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 410 transitions, 978 flow [2022-11-21 17:29:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:29:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 17:29:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1923 transitions. [2022-11-21 17:29:27,595 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8288793103448275 [2022-11-21 17:29:27,595 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1923 transitions. [2022-11-21 17:29:27,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1923 transitions. [2022-11-21 17:29:27,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:29:27,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1923 transitions. [2022-11-21 17:29:27,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 384.6) internal successors, (1923), 5 states have internal predecessors, (1923), 0 states have call successors, (0), 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-21 17:29:27,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 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-21 17:29:27,604 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 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-21 17:29:27,604 INFO L175 Difference]: Start difference. First operand has 409 places, 403 transitions, 914 flow. Second operand 5 states and 1923 transitions. [2022-11-21 17:29:27,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 410 transitions, 978 flow [2022-11-21 17:29:27,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 410 transitions, 962 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-21 17:29:27,612 INFO L231 Difference]: Finished difference. Result has 412 places, 406 transitions, 930 flow [2022-11-21 17:29:27,613 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=930, PETRI_PLACES=412, PETRI_TRANSITIONS=406} [2022-11-21 17:29:27,614 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 16 predicate places. [2022-11-21 17:29:27,614 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 406 transitions, 930 flow [2022-11-21 17:29:27,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 380.75) internal successors, (1523), 4 states have internal predecessors, (1523), 0 states have call successors, (0), 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-21 17:29:27,615 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:29:27,615 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-11-21 17:29:27,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-21 17:29:27,616 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-21 17:29:27,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:27,616 INFO L85 PathProgramCache]: Analyzing trace with hash -111328103, now seen corresponding path program 1 times [2022-11-21 17:29:27,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:27,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075589761] [2022-11-21 17:29:27,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:27,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-21 17:29:27,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:27,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075589761] [2022-11-21 17:29:27,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075589761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:27,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:27,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:29:27,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438053406] [2022-11-21 17:29:27,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:27,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:29:27,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:27,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:29:27,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:29:27,669 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-21 17:29:27,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 406 transitions, 930 flow. Second operand has 4 states, 4 states have (on average 382.75) internal successors, (1531), 4 states have internal predecessors, (1531), 0 states have call successors, (0), 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-21 17:29:27,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:29:27,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-21 17:29:27,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:29:28,066 INFO L130 PetriNetUnfolder]: 23/790 cut-off events. [2022-11-21 17:29:28,067 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-11-21 17:29:28,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 790 events. 23/790 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4318 event pairs, 1 based on Foata normal form. 2/698 useless extension candidates. Maximal degree in co-relation 838. Up to 20 conditions per place. [2022-11-21 17:29:28,088 INFO L137 encePairwiseOnDemand]: 458/464 looper letters, 13 selfloop transitions, 8 changer transitions 0/406 dead transitions. [2022-11-21 17:29:28,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 406 transitions, 970 flow [2022-11-21 17:29:28,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:29:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 17:29:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1914 transitions. [2022-11-21 17:29:28,093 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825 [2022-11-21 17:29:28,093 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1914 transitions. [2022-11-21 17:29:28,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1914 transitions. [2022-11-21 17:29:28,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:29:28,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1914 transitions. [2022-11-21 17:29:28,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 382.8) internal successors, (1914), 5 states have internal predecessors, (1914), 0 states have call successors, (0), 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-21 17:29:28,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 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-21 17:29:28,104 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 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-21 17:29:28,104 INFO L175 Difference]: Start difference. First operand has 412 places, 406 transitions, 930 flow. Second operand 5 states and 1914 transitions. [2022-11-21 17:29:28,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 406 transitions, 970 flow [2022-11-21 17:29:28,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 406 transitions, 968 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 17:29:28,114 INFO L231 Difference]: Finished difference. Result has 415 places, 406 transitions, 948 flow [2022-11-21 17:29:28,115 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=948, PETRI_PLACES=415, PETRI_TRANSITIONS=406} [2022-11-21 17:29:28,116 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 19 predicate places. [2022-11-21 17:29:28,116 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 406 transitions, 948 flow [2022-11-21 17:29:28,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 382.75) internal successors, (1531), 4 states have internal predecessors, (1531), 0 states have call successors, (0), 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-21 17:29:28,117 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:29:28,117 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2022-11-21 17:29:28,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-21 17:29:28,118 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-21 17:29:28,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:28,118 INFO L85 PathProgramCache]: Analyzing trace with hash 843797510, now seen corresponding path program 1 times [2022-11-21 17:29:28,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:28,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915441963] [2022-11-21 17:29:28,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:28,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:28,255 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 17:29:28,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:28,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915441963] [2022-11-21 17:29:28,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915441963] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:29:28,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194366908] [2022-11-21 17:29:28,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:28,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:29:28,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:29:28,258 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:29:28,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-21 17:29:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:28,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 17:29:28,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:29:28,456 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 17:29:28,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:29:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 17:29:28,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194366908] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:29:28,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:29:28,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-21 17:29:28,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331604502] [2022-11-21 17:29:28,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:29:28,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-21 17:29:28,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:28,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 17:29:28,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-21 17:29:28,575 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-21 17:29:28,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 406 transitions, 948 flow. Second operand has 18 states, 18 states have (on average 382.1111111111111) internal successors, (6878), 18 states have internal predecessors, (6878), 0 states have call successors, (0), 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-21 17:29:28,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:29:28,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-21 17:29:28,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:29:29,112 INFO L130 PetriNetUnfolder]: 23/818 cut-off events. [2022-11-21 17:29:29,112 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-11-21 17:29:29,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1034 conditions, 818 events. 23/818 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4308 event pairs, 1 based on Foata normal form. 4/728 useless extension candidates. Maximal degree in co-relation 828. Up to 20 conditions per place. [2022-11-21 17:29:29,135 INFO L137 encePairwiseOnDemand]: 458/464 looper letters, 38 selfloop transitions, 21 changer transitions 0/441 dead transitions. [2022-11-21 17:29:29,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 441 transitions, 1220 flow [2022-11-21 17:29:29,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 17:29:29,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-21 17:29:29,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 8022 transitions. [2022-11-21 17:29:29,151 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8232758620689655 [2022-11-21 17:29:29,152 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 8022 transitions. [2022-11-21 17:29:29,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 8022 transitions. [2022-11-21 17:29:29,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:29:29,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 8022 transitions. [2022-11-21 17:29:29,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 382.0) internal successors, (8022), 21 states have internal predecessors, (8022), 0 states have call successors, (0), 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-21 17:29:29,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 464.0) internal successors, (10208), 22 states have internal predecessors, (10208), 0 states have call successors, (0), 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-21 17:29:29,192 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 464.0) internal successors, (10208), 22 states have internal predecessors, (10208), 0 states have call successors, (0), 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-21 17:29:29,192 INFO L175 Difference]: Start difference. First operand has 415 places, 406 transitions, 948 flow. Second operand 21 states and 8022 transitions. [2022-11-21 17:29:29,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 441 transitions, 1220 flow [2022-11-21 17:29:29,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 441 transitions, 1208 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 17:29:29,203 INFO L231 Difference]: Finished difference. Result has 437 places, 419 transitions, 1092 flow [2022-11-21 17:29:29,205 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1092, PETRI_PLACES=437, PETRI_TRANSITIONS=419} [2022-11-21 17:29:29,206 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 41 predicate places. [2022-11-21 17:29:29,206 INFO L495 AbstractCegarLoop]: Abstraction has has 437 places, 419 transitions, 1092 flow [2022-11-21 17:29:29,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 382.1111111111111) internal successors, (6878), 18 states have internal predecessors, (6878), 0 states have call successors, (0), 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-21 17:29:29,209 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:29:29,209 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 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] [2022-11-21 17:29:29,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-21 17:29:29,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-21 17:29:29,415 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-21 17:29:29,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:29,416 INFO L85 PathProgramCache]: Analyzing trace with hash -619266170, now seen corresponding path program 2 times [2022-11-21 17:29:29,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:29,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79587076] [2022-11-21 17:29:29,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:29,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 17:29:29,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:29,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79587076] [2022-11-21 17:29:29,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79587076] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:29:29,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749510000] [2022-11-21 17:29:29,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:29:29,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:29:29,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:29:29,772 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:29:29,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-21 17:29:29,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:29:29,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:29:29,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 17:29:29,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:29:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 17:29:30,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:29:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 17:29:30,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749510000] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:29:30,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:29:30,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-21 17:29:30,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957637927] [2022-11-21 17:29:30,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:29:30,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-21 17:29:30,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:30,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-21 17:29:30,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-21 17:29:30,304 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-21 17:29:30,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 419 transitions, 1092 flow. Second operand has 23 states, 23 states have (on average 382.3478260869565) internal successors, (8794), 23 states have internal predecessors, (8794), 0 states have call successors, (0), 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-21 17:29:30,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:29:30,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-21 17:29:30,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:29:31,016 INFO L130 PetriNetUnfolder]: 23/839 cut-off events. [2022-11-21 17:29:31,017 INFO L131 PetriNetUnfolder]: For 274/274 co-relation queries the response was YES. [2022-11-21 17:29:31,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 839 events. 23/839 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4319 event pairs, 1 based on Foata normal form. 3/748 useless extension candidates. Maximal degree in co-relation 828. Up to 20 conditions per place. [2022-11-21 17:29:31,041 INFO L137 encePairwiseOnDemand]: 458/464 looper letters, 50 selfloop transitions, 30 changer transitions 0/462 dead transitions. [2022-11-21 17:29:31,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 462 transitions, 1462 flow [2022-11-21 17:29:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-21 17:29:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-21 17:29:31,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 11453 transitions. [2022-11-21 17:29:31,060 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8227729885057471 [2022-11-21 17:29:31,060 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 11453 transitions. [2022-11-21 17:29:31,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 11453 transitions. [2022-11-21 17:29:31,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:29:31,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 11453 transitions. [2022-11-21 17:29:31,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 381.76666666666665) internal successors, (11453), 30 states have internal predecessors, (11453), 0 states have call successors, (0), 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-21 17:29:31,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 464.0) internal successors, (14384), 31 states have internal predecessors, (14384), 0 states have call successors, (0), 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-21 17:29:31,109 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 464.0) internal successors, (14384), 31 states have internal predecessors, (14384), 0 states have call successors, (0), 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-21 17:29:31,109 INFO L175 Difference]: Start difference. First operand has 437 places, 419 transitions, 1092 flow. Second operand 30 states and 11453 transitions. [2022-11-21 17:29:31,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 462 transitions, 1462 flow [2022-11-21 17:29:31,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 462 transitions, 1382 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-21 17:29:31,123 INFO L231 Difference]: Finished difference. Result has 462 places, 429 transitions, 1190 flow [2022-11-21 17:29:31,123 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1190, PETRI_PLACES=462, PETRI_TRANSITIONS=429} [2022-11-21 17:29:31,124 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 66 predicate places. [2022-11-21 17:29:31,124 INFO L495 AbstractCegarLoop]: Abstraction has has 462 places, 429 transitions, 1190 flow [2022-11-21 17:29:31,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 382.3478260869565) internal successors, (8794), 23 states have internal predecessors, (8794), 0 states have call successors, (0), 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-21 17:29:31,126 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:29:31,127 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 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] [2022-11-21 17:29:31,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-21 17:29:31,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-21 17:29:31,333 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-21 17:29:31,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:31,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1386839720, now seen corresponding path program 3 times [2022-11-21 17:29:31,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:31,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866214281] [2022-11-21 17:29:31,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:31,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:31,479 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-21 17:29:31,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:31,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866214281] [2022-11-21 17:29:31,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866214281] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:29:31,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501887043] [2022-11-21 17:29:31,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 17:29:31,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:29:31,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:29:31,482 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:29:31,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-21 17:29:31,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-21 17:29:31,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:29:31,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 17:29:31,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:29:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-21 17:29:31,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:29:31,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501887043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:31,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:29:31,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-21 17:29:31,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985322447] [2022-11-21 17:29:31,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:31,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:29:31,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:31,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:29:31,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:29:31,697 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-21 17:29:31,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 429 transitions, 1190 flow. Second operand has 5 states, 5 states have (on average 382.2) internal successors, (1911), 5 states have internal predecessors, (1911), 0 states have call successors, (0), 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-21 17:29:31,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:29:31,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-21 17:29:31,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:29:32,051 INFO L130 PetriNetUnfolder]: 23/837 cut-off events. [2022-11-21 17:29:32,052 INFO L131 PetriNetUnfolder]: For 235/235 co-relation queries the response was YES. [2022-11-21 17:29:32,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 837 events. 23/837 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4297 event pairs, 1 based on Foata normal form. 2/745 useless extension candidates. Maximal degree in co-relation 846. Up to 30 conditions per place. [2022-11-21 17:29:32,077 INFO L137 encePairwiseOnDemand]: 460/464 looper letters, 15 selfloop transitions, 5 changer transitions 0/428 dead transitions. [2022-11-21 17:29:32,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 428 transitions, 1226 flow [2022-11-21 17:29:32,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:29:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-21 17:29:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1533 transitions. [2022-11-21 17:29:32,084 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8259698275862069 [2022-11-21 17:29:32,084 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1533 transitions. [2022-11-21 17:29:32,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1533 transitions. [2022-11-21 17:29:32,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:29:32,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1533 transitions. [2022-11-21 17:29:32,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 383.25) internal successors, (1533), 4 states have internal predecessors, (1533), 0 states have call successors, (0), 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-21 17:29:32,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 464.0) internal successors, (2320), 5 states have internal predecessors, (2320), 0 states have call successors, (0), 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-21 17:29:32,106 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 464.0) internal successors, (2320), 5 states have internal predecessors, (2320), 0 states have call successors, (0), 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-21 17:29:32,106 INFO L175 Difference]: Start difference. First operand has 462 places, 429 transitions, 1190 flow. Second operand 4 states and 1533 transitions. [2022-11-21 17:29:32,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 428 transitions, 1226 flow [2022-11-21 17:29:32,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 428 transitions, 1180 flow, removed 5 selfloop flow, removed 18 redundant places. [2022-11-21 17:29:32,120 INFO L231 Difference]: Finished difference. Result has 446 places, 428 transitions, 1150 flow [2022-11-21 17:29:32,121 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1150, PETRI_PLACES=446, PETRI_TRANSITIONS=428} [2022-11-21 17:29:32,122 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 50 predicate places. [2022-11-21 17:29:32,122 INFO L495 AbstractCegarLoop]: Abstraction has has 446 places, 428 transitions, 1150 flow [2022-11-21 17:29:32,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 382.2) internal successors, (1911), 5 states have internal predecessors, (1911), 0 states have call successors, (0), 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-21 17:29:32,123 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:29:32,123 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:29:32,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-21 17:29:32,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2d9bedc-5c3b-49fb-8c91-1e31bbf7d858/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-21 17:29:32,329 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-21 17:29:32,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:29:32,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1525818324, now seen corresponding path program 1 times [2022-11-21 17:29:32,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:29:32,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060249046] [2022-11-21 17:29:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:29:32,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:29:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:29:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-21 17:29:33,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:29:33,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060249046] [2022-11-21 17:29:33,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060249046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:29:33,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:29:33,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-21 17:29:33,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341541727] [2022-11-21 17:29:33,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:29:33,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 17:29:33,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:29:33,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 17:29:33,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-21 17:29:33,173 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 464 [2022-11-21 17:29:33,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 428 transitions, 1150 flow. Second operand has 13 states, 13 states have (on average 299.15384615384613) internal successors, (3889), 13 states have internal predecessors, (3889), 0 states have call successors, (0), 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-21 17:29:33,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:29:33,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 464 [2022-11-21 17:29:33,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand