./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro --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 246cd07a930f0cb8d777c2eae74f25d04e3267c275b813f0c0f5232c23299340 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 18:45:15,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:45:15,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:45:15,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:45:15,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:45:15,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:45:15,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:45:15,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:45:15,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:45:15,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:45:15,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:45:15,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:45:15,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:45:15,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:45:15,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:45:15,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:45:15,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:45:15,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:45:15,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:45:15,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:45:15,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:45:15,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:45:15,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:45:15,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:45:15,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:45:15,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:45:15,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:45:15,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:45:15,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:45:15,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:45:15,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:45:15,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:45:15,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:45:15,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:45:15,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:45:15,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:45:15,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:45:15,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:45:15,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:45:15,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:45:15,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:45:15,974 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-18 18:45:16,016 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:45:16,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:45:16,018 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:45:16,018 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:45:16,019 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:45:16,019 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:45:16,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:45:16,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:45:16,021 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:45:16,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:45:16,022 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 18:45:16,022 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 18:45:16,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 18:45:16,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 18:45:16,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:45:16,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 18:45:16,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:45:16,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 18:45:16,024 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 18:45:16,024 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 18:45:16,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 18:45:16,024 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:45:16,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 18:45:16,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:45:16,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:45:16,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:45:16,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:45:16,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:45:16,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:45:16,027 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 18:45:16,028 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 18:45:16,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 18:45:16,028 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 18:45:16,028 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 18:45:16,029 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 18:45:16,029 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_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/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_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro 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 -> 246cd07a930f0cb8d777c2eae74f25d04e3267c275b813f0c0f5232c23299340 [2022-11-18 18:45:16,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:45:16,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:45:16,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:45:16,387 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:45:16,388 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:45:16,389 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2022-11-18 18:45:16,475 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/data/8d0283f7d/1997b304be9344598801c4aec6b40941/FLAG9126fd134 [2022-11-18 18:45:17,201 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:45:17,201 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2022-11-18 18:45:17,230 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/data/8d0283f7d/1997b304be9344598801c4aec6b40941/FLAG9126fd134 [2022-11-18 18:45:17,405 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/data/8d0283f7d/1997b304be9344598801c4aec6b40941 [2022-11-18 18:45:17,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:45:17,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:45:17,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:45:17,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:45:17,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:45:17,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:45:17" (1/1) ... [2022-11-18 18:45:17,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12c04689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:45:17, skipping insertion in model container [2022-11-18 18:45:17,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:45:17" (1/1) ... [2022-11-18 18:45:17,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:45:17,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:45:18,044 WARN L234 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_b763b958-caaa-4759-b0b6-2323ad089aa3/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i[47038,47051] [2022-11-18 18:45:18,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:45:18,078 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:45:18,113 WARN L234 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_b763b958-caaa-4759-b0b6-2323ad089aa3/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i[47038,47051] [2022-11-18 18:45:18,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:45:18,189 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:45:18,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:45:18 WrapperNode [2022-11-18 18:45:18,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:45:18,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:45:18,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:45:18,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:45:18,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:45:18" (1/1) ... [2022-11-18 18:45:18,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:45:18" (1/1) ... [2022-11-18 18:45:18,256 INFO L138 Inliner]: procedures = 271, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 217 [2022-11-18 18:45:18,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:45:18,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:45:18,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:45:18,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:45:18,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:45:18" (1/1) ... [2022-11-18 18:45:18,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:45:18" (1/1) ... [2022-11-18 18:45:18,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:45:18" (1/1) ... [2022-11-18 18:45:18,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:45:18" (1/1) ... [2022-11-18 18:45:18,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:45:18" (1/1) ... [2022-11-18 18:45:18,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:45:18" (1/1) ... [2022-11-18 18:45:18,286 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:45:18" (1/1) ... [2022-11-18 18:45:18,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:45:18" (1/1) ... [2022-11-18 18:45:18,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:45:18,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:45:18,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:45:18,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:45:18,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:45:18" (1/1) ... [2022-11-18 18:45:18,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:45:18,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:45:18,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:45:18,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:45:18,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 18:45:18,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 18:45:18,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 18:45:18,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 18:45:18,388 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-18 18:45:18,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 18:45:18,388 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-18 18:45:18,389 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-18 18:45:18,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 18:45:18,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:45:18,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:45:18,391 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 18:45:18,579 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:45:18,596 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:45:19,024 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:45:19,037 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:45:19,039 INFO L300 CfgBuilder]: Removed 22 assume(true) statements. [2022-11-18 18:45:19,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:45:19 BoogieIcfgContainer [2022-11-18 18:45:19,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:45:19,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:45:19,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:45:19,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:45:19,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:45:17" (1/3) ... [2022-11-18 18:45:19,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afdde42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:45:19, skipping insertion in model container [2022-11-18 18:45:19,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:45:18" (2/3) ... [2022-11-18 18:45:19,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afdde42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:45:19, skipping insertion in model container [2022-11-18 18:45:19,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:45:19" (3/3) ... [2022-11-18 18:45:19,068 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_78-equ_racing.i [2022-11-18 18:45:19,093 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 18:45:19,103 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:45:19,104 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-18 18:45:19,104 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 18:45:19,214 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-18 18:45:19,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 236 transitions, 480 flow [2022-11-18 18:45:19,398 INFO L130 PetriNetUnfolder]: 43/315 cut-off events. [2022-11-18 18:45:19,399 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-18 18:45:19,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 315 events. 43/315 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1027 event pairs, 0 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 153. Up to 8 conditions per place. [2022-11-18 18:45:19,412 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 236 transitions, 480 flow [2022-11-18 18:45:19,432 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 231 transitions, 470 flow [2022-11-18 18:45:19,441 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:45:19,448 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;@4e432e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:45:19,448 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-18 18:45:19,460 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-11-18 18:45:19,463 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 18:45:19,463 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:19,464 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:19,465 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-18 18:45:19,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:19,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1528895984, now seen corresponding path program 1 times [2022-11-18 18:45:19,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:19,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093930460] [2022-11-18 18:45:19,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:19,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:19,929 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-18 18:45:19,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:19,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093930460] [2022-11-18 18:45:19,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093930460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:19,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:19,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:45:19,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108351754] [2022-11-18 18:45:19,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:19,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:45:19,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:19,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:45:19,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:45:20,005 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 236 [2022-11-18 18:45:20,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 231 transitions, 470 flow. Second operand has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:20,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:20,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 236 [2022-11-18 18:45:20,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:20,270 INFO L130 PetriNetUnfolder]: 6/473 cut-off events. [2022-11-18 18:45:20,270 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-18 18:45:20,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 473 events. 6/473 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2316 event pairs, 0 based on Foata normal form. 74/493 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2022-11-18 18:45:20,280 INFO L137 encePairwiseOnDemand]: 203/236 looper letters, 11 selfloop transitions, 8 changer transitions 0/206 dead transitions. [2022-11-18 18:45:20,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 206 transitions, 464 flow [2022-11-18 18:45:20,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 18:45:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 18:45:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1596 transitions. [2022-11-18 18:45:20,308 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8453389830508474 [2022-11-18 18:45:20,309 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1596 transitions. [2022-11-18 18:45:20,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1596 transitions. [2022-11-18 18:45:20,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:20,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1596 transitions. [2022-11-18 18:45:20,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 199.5) internal successors, (1596), 8 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:20,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:20,336 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:20,338 INFO L175 Difference]: Start difference. First operand has 207 places, 231 transitions, 470 flow. Second operand 8 states and 1596 transitions. [2022-11-18 18:45:20,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 206 transitions, 464 flow [2022-11-18 18:45:20,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 206 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 18:45:20,349 INFO L231 Difference]: Finished difference. Result has 211 places, 204 transitions, 432 flow [2022-11-18 18:45:20,371 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=432, PETRI_PLACES=211, PETRI_TRANSITIONS=204} [2022-11-18 18:45:20,375 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 4 predicate places. [2022-11-18 18:45:20,375 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 204 transitions, 432 flow [2022-11-18 18:45:20,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:20,376 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:20,377 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:20,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 18:45:20,377 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-18 18:45:20,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:20,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1528885954, now seen corresponding path program 1 times [2022-11-18 18:45:20,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:20,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249519225] [2022-11-18 18:45:20,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:20,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:20,574 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-18 18:45:20,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:20,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249519225] [2022-11-18 18:45:20,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249519225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:20,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:20,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:45:20,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600193072] [2022-11-18 18:45:20,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:20,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:45:20,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:20,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:45:20,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:45:20,587 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 236 [2022-11-18 18:45:20,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 204 transitions, 432 flow. Second operand has 4 states, 4 states have (on average 194.5) internal successors, (778), 4 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:20,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:20,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 236 [2022-11-18 18:45:20,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:20,750 INFO L130 PetriNetUnfolder]: 6/472 cut-off events. [2022-11-18 18:45:20,750 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-18 18:45:20,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 472 events. 6/472 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2312 event pairs, 0 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 223. Up to 12 conditions per place. [2022-11-18 18:45:20,755 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 11 selfloop transitions, 4 changer transitions 0/203 dead transitions. [2022-11-18 18:45:20,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 203 transitions, 460 flow [2022-11-18 18:45:20,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:45:20,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 18:45:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 981 transitions. [2022-11-18 18:45:20,760 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8313559322033899 [2022-11-18 18:45:20,760 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 981 transitions. [2022-11-18 18:45:20,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 981 transitions. [2022-11-18 18:45:20,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:20,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 981 transitions. [2022-11-18 18:45:20,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 196.2) internal successors, (981), 5 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:20,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:20,768 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:20,769 INFO L175 Difference]: Start difference. First operand has 211 places, 204 transitions, 432 flow. Second operand 5 states and 981 transitions. [2022-11-18 18:45:20,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 203 transitions, 460 flow [2022-11-18 18:45:20,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 203 transitions, 444 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-18 18:45:20,782 INFO L231 Difference]: Finished difference. Result has 207 places, 203 transitions, 422 flow [2022-11-18 18:45:20,783 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=207, PETRI_TRANSITIONS=203} [2022-11-18 18:45:20,784 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2022-11-18 18:45:20,784 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 422 flow [2022-11-18 18:45:20,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.5) internal successors, (778), 4 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:20,785 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:20,786 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:20,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 18:45:20,786 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-18 18:45:20,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:20,789 INFO L85 PathProgramCache]: Analyzing trace with hash 151135674, now seen corresponding path program 1 times [2022-11-18 18:45:20,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:20,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013476202] [2022-11-18 18:45:20,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:20,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:20,931 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-18 18:45:20,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:20,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013476202] [2022-11-18 18:45:20,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013476202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:20,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:20,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 18:45:20,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726410189] [2022-11-18 18:45:20,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:20,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:45:20,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:20,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:45:20,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:45:20,936 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 236 [2022-11-18 18:45:20,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 203 transitions, 422 flow. Second operand has 5 states, 5 states have (on average 192.8) internal successors, (964), 5 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:20,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:20,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 236 [2022-11-18 18:45:20,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:21,054 INFO L130 PetriNetUnfolder]: 6/471 cut-off events. [2022-11-18 18:45:21,054 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-18 18:45:21,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 471 events. 6/471 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2308 event pairs, 0 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 276. Up to 8 conditions per place. [2022-11-18 18:45:21,073 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 12 selfloop transitions, 6 changer transitions 0/204 dead transitions. [2022-11-18 18:45:21,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 204 transitions, 466 flow [2022-11-18 18:45:21,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:45:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 18:45:21,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1165 transitions. [2022-11-18 18:45:21,076 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8227401129943502 [2022-11-18 18:45:21,076 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1165 transitions. [2022-11-18 18:45:21,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1165 transitions. [2022-11-18 18:45:21,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:21,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1165 transitions. [2022-11-18 18:45:21,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 194.16666666666666) internal successors, (1165), 6 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:21,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:21,085 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:21,085 INFO L175 Difference]: Start difference. First operand has 207 places, 203 transitions, 422 flow. Second operand 6 states and 1165 transitions. [2022-11-18 18:45:21,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 204 transitions, 466 flow [2022-11-18 18:45:21,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 204 transitions, 458 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 18:45:21,090 INFO L231 Difference]: Finished difference. Result has 207 places, 202 transitions, 424 flow [2022-11-18 18:45:21,091 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=424, PETRI_PLACES=207, PETRI_TRANSITIONS=202} [2022-11-18 18:45:21,091 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2022-11-18 18:45:21,092 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 202 transitions, 424 flow [2022-11-18 18:45:21,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.8) internal successors, (964), 5 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:21,093 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:21,093 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:21,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 18:45:21,093 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-18 18:45:21,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:21,094 INFO L85 PathProgramCache]: Analyzing trace with hash 150824823, now seen corresponding path program 1 times [2022-11-18 18:45:21,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:21,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493666436] [2022-11-18 18:45:21,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:21,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:21,151 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-18 18:45:21,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:21,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493666436] [2022-11-18 18:45:21,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493666436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:21,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:21,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:45:21,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329092449] [2022-11-18 18:45:21,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:21,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:45:21,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:21,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:45:21,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:45:21,156 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 236 [2022-11-18 18:45:21,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 202 transitions, 424 flow. Second operand has 4 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:21,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:21,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 236 [2022-11-18 18:45:21,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:21,251 INFO L130 PetriNetUnfolder]: 6/470 cut-off events. [2022-11-18 18:45:21,251 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-18 18:45:21,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 470 events. 6/470 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2313 event pairs, 0 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 218. Up to 9 conditions per place. [2022-11-18 18:45:21,255 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 13 selfloop transitions, 3 changer transitions 0/203 dead transitions. [2022-11-18 18:45:21,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 203 transitions, 464 flow [2022-11-18 18:45:21,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 18:45:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-18 18:45:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 789 transitions. [2022-11-18 18:45:21,258 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8358050847457628 [2022-11-18 18:45:21,259 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 789 transitions. [2022-11-18 18:45:21,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 789 transitions. [2022-11-18 18:45:21,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:21,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 789 transitions. [2022-11-18 18:45:21,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.25) internal successors, (789), 4 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:21,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:21,264 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:21,265 INFO L175 Difference]: Start difference. First operand has 207 places, 202 transitions, 424 flow. Second operand 4 states and 789 transitions. [2022-11-18 18:45:21,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 203 transitions, 464 flow [2022-11-18 18:45:21,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 203 transitions, 452 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 18:45:21,269 INFO L231 Difference]: Finished difference. Result has 204 places, 201 transitions, 416 flow [2022-11-18 18:45:21,270 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=416, PETRI_PLACES=204, PETRI_TRANSITIONS=201} [2022-11-18 18:45:21,271 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, -3 predicate places. [2022-11-18 18:45:21,271 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 201 transitions, 416 flow [2022-11-18 18:45:21,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:21,272 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:21,272 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:21,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 18:45:21,273 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-18 18:45:21,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:21,273 INFO L85 PathProgramCache]: Analyzing trace with hash 165110258, now seen corresponding path program 1 times [2022-11-18 18:45:21,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:21,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112650396] [2022-11-18 18:45:21,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:21,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:21,360 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-18 18:45:21,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:21,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112650396] [2022-11-18 18:45:21,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112650396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:21,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:21,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:45:21,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020192416] [2022-11-18 18:45:21,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:21,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:45:21,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:21,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:45:21,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:45:21,364 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 236 [2022-11-18 18:45:21,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 201 transitions, 416 flow. Second operand has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:21,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:21,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 236 [2022-11-18 18:45:21,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:21,456 INFO L130 PetriNetUnfolder]: 4/344 cut-off events. [2022-11-18 18:45:21,456 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-18 18:45:21,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 344 events. 4/344 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1271 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 214. Up to 12 conditions per place. [2022-11-18 18:45:21,460 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 10 selfloop transitions, 4 changer transitions 0/201 dead transitions. [2022-11-18 18:45:21,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 201 transitions, 444 flow [2022-11-18 18:45:21,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:45:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 18:45:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 997 transitions. [2022-11-18 18:45:21,464 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8449152542372881 [2022-11-18 18:45:21,464 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 997 transitions. [2022-11-18 18:45:21,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 997 transitions. [2022-11-18 18:45:21,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:21,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 997 transitions. [2022-11-18 18:45:21,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 199.4) internal successors, (997), 5 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:21,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:21,470 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:21,470 INFO L175 Difference]: Start difference. First operand has 204 places, 201 transitions, 416 flow. Second operand 5 states and 997 transitions. [2022-11-18 18:45:21,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 201 transitions, 444 flow [2022-11-18 18:45:21,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 201 transitions, 438 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 18:45:21,475 INFO L231 Difference]: Finished difference. Result has 204 places, 199 transitions, 418 flow [2022-11-18 18:45:21,476 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=418, PETRI_PLACES=204, PETRI_TRANSITIONS=199} [2022-11-18 18:45:21,476 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, -3 predicate places. [2022-11-18 18:45:21,477 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 199 transitions, 418 flow [2022-11-18 18:45:21,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:21,477 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:21,478 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:21,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 18:45:21,478 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-18 18:45:21,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:21,479 INFO L85 PathProgramCache]: Analyzing trace with hash -454347722, now seen corresponding path program 1 times [2022-11-18 18:45:21,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:21,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922415722] [2022-11-18 18:45:21,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:21,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:45:21,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 18:45:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:45:21,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 18:45:21,543 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 18:45:21,544 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2022-11-18 18:45:21,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2022-11-18 18:45:21,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2022-11-18 18:45:21,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2022-11-18 18:45:21,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2022-11-18 18:45:21,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2022-11-18 18:45:21,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2022-11-18 18:45:21,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2022-11-18 18:45:21,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2022-11-18 18:45:21,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2022-11-18 18:45:21,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2022-11-18 18:45:21,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2022-11-18 18:45:21,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2022-11-18 18:45:21,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2022-11-18 18:45:21,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2022-11-18 18:45:21,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2022-11-18 18:45:21,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2022-11-18 18:45:21,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2022-11-18 18:45:21,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2022-11-18 18:45:21,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2022-11-18 18:45:21,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2022-11-18 18:45:21,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 18:45:21,552 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-18 18:45:21,554 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-18 18:45:21,555 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-18 18:45:21,638 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-18 18:45:21,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 303 transitions, 624 flow [2022-11-18 18:45:21,742 INFO L130 PetriNetUnfolder]: 72/498 cut-off events. [2022-11-18 18:45:21,743 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-18 18:45:21,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 498 events. 72/498 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1960 event pairs, 0 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 317. Up to 12 conditions per place. [2022-11-18 18:45:21,748 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 303 transitions, 624 flow [2022-11-18 18:45:21,757 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 265 places, 301 transitions, 620 flow [2022-11-18 18:45:21,758 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:45:21,760 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;@4e432e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:45:21,761 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-18 18:45:21,767 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-11-18 18:45:21,767 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 18:45:21,767 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:21,767 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:21,768 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-18 18:45:21,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:21,768 INFO L85 PathProgramCache]: Analyzing trace with hash 119872176, now seen corresponding path program 1 times [2022-11-18 18:45:21,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:21,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662933772] [2022-11-18 18:45:21,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:21,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:21,917 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-18 18:45:21,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:21,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662933772] [2022-11-18 18:45:21,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662933772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:21,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:21,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:45:21,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102208393] [2022-11-18 18:45:21,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:21,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:45:21,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:21,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:45:21,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:45:21,922 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 303 [2022-11-18 18:45:21,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 301 transitions, 620 flow. Second operand has 6 states, 6 states have (on average 245.33333333333334) internal successors, (1472), 6 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:21,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:21,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 303 [2022-11-18 18:45:21,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:22,160 INFO L130 PetriNetUnfolder]: 16/791 cut-off events. [2022-11-18 18:45:22,161 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-11-18 18:45:22,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 791 events. 16/791 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4618 event pairs, 0 based on Foata normal form. 176/869 useless extension candidates. Maximal degree in co-relation 502. Up to 12 conditions per place. [2022-11-18 18:45:22,170 INFO L137 encePairwiseOnDemand]: 259/303 looper letters, 15 selfloop transitions, 8 changer transitions 0/266 dead transitions. [2022-11-18 18:45:22,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 266 transitions, 610 flow [2022-11-18 18:45:22,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 18:45:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 18:45:22,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2046 transitions. [2022-11-18 18:45:22,176 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.844059405940594 [2022-11-18 18:45:22,176 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2046 transitions. [2022-11-18 18:45:22,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2046 transitions. [2022-11-18 18:45:22,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:22,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2046 transitions. [2022-11-18 18:45:22,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 255.75) internal successors, (2046), 8 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:22,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:22,188 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:22,188 INFO L175 Difference]: Start difference. First operand has 265 places, 301 transitions, 620 flow. Second operand 8 states and 2046 transitions. [2022-11-18 18:45:22,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 266 transitions, 610 flow [2022-11-18 18:45:22,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 266 transitions, 610 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 18:45:22,194 INFO L231 Difference]: Finished difference. Result has 268 places, 262 transitions, 558 flow [2022-11-18 18:45:22,195 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=558, PETRI_PLACES=268, PETRI_TRANSITIONS=262} [2022-11-18 18:45:22,195 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 3 predicate places. [2022-11-18 18:45:22,196 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 262 transitions, 558 flow [2022-11-18 18:45:22,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.33333333333334) internal successors, (1472), 6 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:22,197 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:22,197 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:22,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 18:45:22,197 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-18 18:45:22,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:22,198 INFO L85 PathProgramCache]: Analyzing trace with hash 119862146, now seen corresponding path program 1 times [2022-11-18 18:45:22,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:22,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120346076] [2022-11-18 18:45:22,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:22,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:22,289 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-18 18:45:22,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:22,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120346076] [2022-11-18 18:45:22,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120346076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:22,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:22,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:45:22,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139994516] [2022-11-18 18:45:22,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:22,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:45:22,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:22,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:45:22,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:45:22,293 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 303 [2022-11-18 18:45:22,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 262 transitions, 558 flow. Second operand has 4 states, 4 states have (on average 247.5) internal successors, (990), 4 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:22,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:22,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 303 [2022-11-18 18:45:22,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:22,462 INFO L130 PetriNetUnfolder]: 16/790 cut-off events. [2022-11-18 18:45:22,462 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-11-18 18:45:22,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 790 events. 16/790 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4612 event pairs, 0 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 507. Up to 20 conditions per place. [2022-11-18 18:45:22,475 INFO L137 encePairwiseOnDemand]: 298/303 looper letters, 13 selfloop transitions, 4 changer transitions 0/261 dead transitions. [2022-11-18 18:45:22,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 261 transitions, 590 flow [2022-11-18 18:45:22,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:45:22,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 18:45:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1248 transitions. [2022-11-18 18:45:22,479 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8237623762376237 [2022-11-18 18:45:22,479 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1248 transitions. [2022-11-18 18:45:22,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1248 transitions. [2022-11-18 18:45:22,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:22,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1248 transitions. [2022-11-18 18:45:22,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 249.6) internal successors, (1248), 5 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:22,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:22,487 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:22,487 INFO L175 Difference]: Start difference. First operand has 268 places, 262 transitions, 558 flow. Second operand 5 states and 1248 transitions. [2022-11-18 18:45:22,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 261 transitions, 590 flow [2022-11-18 18:45:22,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 261 transitions, 574 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-18 18:45:22,494 INFO L231 Difference]: Finished difference. Result has 264 places, 261 transitions, 548 flow [2022-11-18 18:45:22,495 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=548, PETRI_PLACES=264, PETRI_TRANSITIONS=261} [2022-11-18 18:45:22,496 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -1 predicate places. [2022-11-18 18:45:22,497 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 261 transitions, 548 flow [2022-11-18 18:45:22,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 247.5) internal successors, (990), 4 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:22,498 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:22,498 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:22,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 18:45:22,500 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-18 18:45:22,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:22,501 INFO L85 PathProgramCache]: Analyzing trace with hash -578929111, now seen corresponding path program 1 times [2022-11-18 18:45:22,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:22,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792322897] [2022-11-18 18:45:22,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:22,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:22,597 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-18 18:45:22,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:22,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792322897] [2022-11-18 18:45:22,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792322897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:22,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:22,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 18:45:22,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034278649] [2022-11-18 18:45:22,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:22,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:45:22,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:22,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:45:22,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:45:22,603 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 303 [2022-11-18 18:45:22,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 261 transitions, 548 flow. Second operand has 5 states, 5 states have (on average 245.8) internal successors, (1229), 5 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:22,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:22,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 303 [2022-11-18 18:45:22,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:22,859 INFO L130 PetriNetUnfolder]: 16/789 cut-off events. [2022-11-18 18:45:22,859 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-11-18 18:45:22,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 789 events. 16/789 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4617 event pairs, 0 based on Foata normal form. 0/694 useless extension candidates. Maximal degree in co-relation 503. Up to 12 conditions per place. [2022-11-18 18:45:22,872 INFO L137 encePairwiseOnDemand]: 296/303 looper letters, 16 selfloop transitions, 6 changer transitions 0/264 dead transitions. [2022-11-18 18:45:22,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 264 transitions, 612 flow [2022-11-18 18:45:22,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:45:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 18:45:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1487 transitions. [2022-11-18 18:45:22,876 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.817931793179318 [2022-11-18 18:45:22,876 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1487 transitions. [2022-11-18 18:45:22,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1487 transitions. [2022-11-18 18:45:22,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:22,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1487 transitions. [2022-11-18 18:45:22,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:22,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:22,887 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:22,887 INFO L175 Difference]: Start difference. First operand has 264 places, 261 transitions, 548 flow. Second operand 6 states and 1487 transitions. [2022-11-18 18:45:22,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 264 transitions, 612 flow [2022-11-18 18:45:22,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 264 transitions, 604 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 18:45:22,893 INFO L231 Difference]: Finished difference. Result has 264 places, 260 transitions, 550 flow [2022-11-18 18:45:22,893 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=550, PETRI_PLACES=264, PETRI_TRANSITIONS=260} [2022-11-18 18:45:22,896 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -1 predicate places. [2022-11-18 18:45:22,896 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 260 transitions, 550 flow [2022-11-18 18:45:22,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 245.8) internal successors, (1229), 5 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:22,897 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:22,898 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:22,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 18:45:22,898 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-18 18:45:22,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:22,899 INFO L85 PathProgramCache]: Analyzing trace with hash -579239962, now seen corresponding path program 1 times [2022-11-18 18:45:22,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:22,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279786636] [2022-11-18 18:45:22,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:22,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:22,951 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-18 18:45:22,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:22,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279786636] [2022-11-18 18:45:22,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279786636] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:22,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:22,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:45:22,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577077729] [2022-11-18 18:45:22,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:22,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:45:22,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:22,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:45:22,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:45:22,960 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 303 [2022-11-18 18:45:22,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 260 transitions, 550 flow. Second operand has 4 states, 4 states have (on average 247.75) internal successors, (991), 4 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:22,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:22,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 303 [2022-11-18 18:45:22,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:23,149 INFO L130 PetriNetUnfolder]: 16/788 cut-off events. [2022-11-18 18:45:23,149 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-11-18 18:45:23,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 788 events. 16/788 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4619 event pairs, 0 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 502. Up to 13 conditions per place. [2022-11-18 18:45:23,158 INFO L137 encePairwiseOnDemand]: 299/303 looper letters, 17 selfloop transitions, 3 changer transitions 0/263 dead transitions. [2022-11-18 18:45:23,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 263 transitions, 610 flow [2022-11-18 18:45:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 18:45:23,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-18 18:45:23,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1005 transitions. [2022-11-18 18:45:23,162 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8292079207920792 [2022-11-18 18:45:23,162 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1005 transitions. [2022-11-18 18:45:23,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1005 transitions. [2022-11-18 18:45:23,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:23,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1005 transitions. [2022-11-18 18:45:23,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 251.25) internal successors, (1005), 4 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:23,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:23,170 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:23,170 INFO L175 Difference]: Start difference. First operand has 264 places, 260 transitions, 550 flow. Second operand 4 states and 1005 transitions. [2022-11-18 18:45:23,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 263 transitions, 610 flow [2022-11-18 18:45:23,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 263 transitions, 598 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 18:45:23,177 INFO L231 Difference]: Finished difference. Result has 261 places, 259 transitions, 542 flow [2022-11-18 18:45:23,178 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=542, PETRI_PLACES=261, PETRI_TRANSITIONS=259} [2022-11-18 18:45:23,179 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -4 predicate places. [2022-11-18 18:45:23,179 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 259 transitions, 542 flow [2022-11-18 18:45:23,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 247.75) internal successors, (991), 4 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:23,180 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:23,180 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:23,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 18:45:23,180 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-18 18:45:23,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:23,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1173350771, now seen corresponding path program 1 times [2022-11-18 18:45:23,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:23,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523836007] [2022-11-18 18:45:23,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:23,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:23,279 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-18 18:45:23,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:23,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523836007] [2022-11-18 18:45:23,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523836007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:23,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:23,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:45:23,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751786992] [2022-11-18 18:45:23,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:23,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:45:23,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:23,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:45:23,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:45:23,284 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-18 18:45:23,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 259 transitions, 542 flow. Second operand has 4 states, 4 states have (on average 250.75) internal successors, (1003), 4 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:23,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:23,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-18 18:45:23,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:23,456 INFO L130 PetriNetUnfolder]: 12/680 cut-off events. [2022-11-18 18:45:23,457 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-11-18 18:45:23,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 680 events. 12/680 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3613 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 403. Up to 40 conditions per place. [2022-11-18 18:45:23,468 INFO L137 encePairwiseOnDemand]: 296/303 looper letters, 19 selfloop transitions, 4 changer transitions 0/266 dead transitions. [2022-11-18 18:45:23,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 266 transitions, 602 flow [2022-11-18 18:45:23,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:45:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 18:45:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1271 transitions. [2022-11-18 18:45:23,473 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.838943894389439 [2022-11-18 18:45:23,473 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1271 transitions. [2022-11-18 18:45:23,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1271 transitions. [2022-11-18 18:45:23,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:23,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1271 transitions. [2022-11-18 18:45:23,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 254.2) internal successors, (1271), 5 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:23,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:23,481 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:23,482 INFO L175 Difference]: Start difference. First operand has 261 places, 259 transitions, 542 flow. Second operand 5 states and 1271 transitions. [2022-11-18 18:45:23,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 266 transitions, 602 flow [2022-11-18 18:45:23,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 266 transitions, 596 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 18:45:23,492 INFO L231 Difference]: Finished difference. Result has 265 places, 262 transitions, 568 flow [2022-11-18 18:45:23,493 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=568, PETRI_PLACES=265, PETRI_TRANSITIONS=262} [2022-11-18 18:45:23,493 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 0 predicate places. [2022-11-18 18:45:23,493 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 262 transitions, 568 flow [2022-11-18 18:45:23,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 250.75) internal successors, (1003), 4 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:23,495 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:23,495 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:23,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 18:45:23,495 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-18 18:45:23,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1578948222, now seen corresponding path program 1 times [2022-11-18 18:45:23,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:23,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160478916] [2022-11-18 18:45:23,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:23,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:24,015 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-18 18:45:24,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:24,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160478916] [2022-11-18 18:45:24,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160478916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:24,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:24,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 18:45:24,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779426911] [2022-11-18 18:45:24,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:24,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 18:45:24,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:24,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 18:45:24,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-18 18:45:24,020 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 303 [2022-11-18 18:45:24,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 262 transitions, 568 flow. Second operand has 11 states, 11 states have (on average 197.8181818181818) internal successors, (2176), 11 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:24,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:24,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 303 [2022-11-18 18:45:24,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:26,999 INFO L130 PetriNetUnfolder]: 4017/13781 cut-off events. [2022-11-18 18:45:26,999 INFO L131 PetriNetUnfolder]: For 153/153 co-relation queries the response was YES. [2022-11-18 18:45:27,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20193 conditions, 13781 events. 4017/13781 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 163890 event pairs, 942 based on Foata normal form. 0/12379 useless extension candidates. Maximal degree in co-relation 20059. Up to 2982 conditions per place. [2022-11-18 18:45:27,110 INFO L137 encePairwiseOnDemand]: 287/303 looper letters, 223 selfloop transitions, 33 changer transitions 0/447 dead transitions. [2022-11-18 18:45:27,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 447 transitions, 1496 flow [2022-11-18 18:45:27,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 18:45:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-18 18:45:27,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3562 transitions. [2022-11-18 18:45:27,118 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6915162104445739 [2022-11-18 18:45:27,118 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3562 transitions. [2022-11-18 18:45:27,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3562 transitions. [2022-11-18 18:45:27,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:27,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3562 transitions. [2022-11-18 18:45:27,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 209.52941176470588) internal successors, (3562), 17 states have internal predecessors, (3562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:27,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 303.0) internal successors, (5454), 18 states have internal predecessors, (5454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:27,137 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 303.0) internal successors, (5454), 18 states have internal predecessors, (5454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:27,138 INFO L175 Difference]: Start difference. First operand has 265 places, 262 transitions, 568 flow. Second operand 17 states and 3562 transitions. [2022-11-18 18:45:27,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 447 transitions, 1496 flow [2022-11-18 18:45:27,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 447 transitions, 1494 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 18:45:27,148 INFO L231 Difference]: Finished difference. Result has 290 places, 293 transitions, 805 flow [2022-11-18 18:45:27,149 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=805, PETRI_PLACES=290, PETRI_TRANSITIONS=293} [2022-11-18 18:45:27,150 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 25 predicate places. [2022-11-18 18:45:27,150 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 293 transitions, 805 flow [2022-11-18 18:45:27,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 197.8181818181818) internal successors, (2176), 11 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:27,151 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:27,152 INFO L209 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 18:45:27,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 18:45:27,152 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-18 18:45:27,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:27,153 INFO L85 PathProgramCache]: Analyzing trace with hash 412042784, now seen corresponding path program 1 times [2022-11-18 18:45:27,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:27,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939870418] [2022-11-18 18:45:27,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:27,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:27,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:45:27,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:27,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939870418] [2022-11-18 18:45:27,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939870418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:27,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:27,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:45:27,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711018909] [2022-11-18 18:45:27,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:27,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:45:27,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:27,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:45:27,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:45:27,290 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-18 18:45:27,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 293 transitions, 805 flow. Second operand has 4 states, 4 states have (on average 252.75) internal successors, (1011), 4 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:27,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:27,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-18 18:45:27,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:27,551 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#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~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} AuxVars[] AssignedVars[][230], [Black: 334#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 332#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|))), Black: 321#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 340#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 330#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, 320#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), t_funThread2of2ForFork0NotInUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 360#true, Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 346#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 336#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)))]) [2022-11-18 18:45:27,551 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-18 18:45:27,551 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-18 18:45:27,551 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 18:45:27,552 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 18:45:27,618 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#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~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} AuxVars[] AssignedVars[][230], [Black: 334#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 332#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|))), Black: 321#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 340#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 330#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 16#t_funENTRYtrue, t_funThread1of2ForFork0NotInUse, 320#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), t_funThread2of2ForFork0InUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), 360#true, Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 346#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 336#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)))]) [2022-11-18 18:45:27,619 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-18 18:45:27,619 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 18:45:27,619 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 18:45:27,619 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 18:45:27,668 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1022] t_funEXIT-->L1040-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][272], [Black: 334#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 332#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|))), Black: 321#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 340#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 330#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, t_funThread2of2ForFork0NotInUse, 320#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), 360#true, Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 346#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 336#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)))]) [2022-11-18 18:45:27,669 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-18 18:45:27,669 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 18:45:27,669 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-18 18:45:27,669 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-18 18:45:27,671 INFO L130 PetriNetUnfolder]: 123/1466 cut-off events. [2022-11-18 18:45:27,671 INFO L131 PetriNetUnfolder]: For 712/851 co-relation queries the response was YES. [2022-11-18 18:45:27,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2234 conditions, 1466 events. 123/1466 cut-off events. For 712/851 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 11053 event pairs, 26 based on Foata normal form. 19/1340 useless extension candidates. Maximal degree in co-relation 1992. Up to 127 conditions per place. [2022-11-18 18:45:27,694 INFO L137 encePairwiseOnDemand]: 297/303 looper letters, 11 selfloop transitions, 8 changer transitions 0/293 dead transitions. [2022-11-18 18:45:27,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 293 transitions, 841 flow [2022-11-18 18:45:27,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:45:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 18:45:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1262 transitions. [2022-11-18 18:45:27,698 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.833003300330033 [2022-11-18 18:45:27,699 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1262 transitions. [2022-11-18 18:45:27,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1262 transitions. [2022-11-18 18:45:27,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:27,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1262 transitions. [2022-11-18 18:45:27,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 252.4) internal successors, (1262), 5 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:27,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:27,707 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:27,707 INFO L175 Difference]: Start difference. First operand has 290 places, 293 transitions, 805 flow. Second operand 5 states and 1262 transitions. [2022-11-18 18:45:27,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 293 transitions, 841 flow [2022-11-18 18:45:27,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 293 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 18:45:27,719 INFO L231 Difference]: Finished difference. Result has 292 places, 293 transitions, 822 flow [2022-11-18 18:45:27,720 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=822, PETRI_PLACES=292, PETRI_TRANSITIONS=293} [2022-11-18 18:45:27,720 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 27 predicate places. [2022-11-18 18:45:27,721 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 293 transitions, 822 flow [2022-11-18 18:45:27,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 252.75) internal successors, (1011), 4 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:27,721 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:27,722 INFO L209 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 18:45:27,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 18:45:27,722 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-18 18:45:27,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:27,723 INFO L85 PathProgramCache]: Analyzing trace with hash -111574750, now seen corresponding path program 1 times [2022-11-18 18:45:27,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:27,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593708754] [2022-11-18 18:45:27,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:27,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:45:27,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:27,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593708754] [2022-11-18 18:45:27,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593708754] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:45:27,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850695390] [2022-11-18 18:45:27,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:27,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:45:27,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:45:27,867 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:45:27,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 18:45:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:27,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 18:45:27,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:45:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:45:28,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:45:28,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850695390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:28,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 18:45:28,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-18 18:45:28,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361520261] [2022-11-18 18:45:28,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:28,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:45:28,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:28,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:45:28,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-18 18:45:28,103 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-18 18:45:28,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 293 transitions, 822 flow. Second operand has 5 states, 5 states have (on average 252.2) internal successors, (1261), 5 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:28,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:28,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-18 18:45:28,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:28,409 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#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~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} AuxVars[] AssignedVars[][229], [Black: 334#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 332#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|))), Black: 321#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 340#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 330#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, t_funThread2of2ForFork0NotInUse, 320#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), 586#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 360#true, Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 346#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 336#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)))]) [2022-11-18 18:45:28,410 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-18 18:45:28,410 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-18 18:45:28,410 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 18:45:28,410 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 18:45:28,521 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#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~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} AuxVars[] AssignedVars[][229], [Black: 334#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 332#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|))), Black: 321#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 340#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 330#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 16#t_funENTRYtrue, t_funThread1of2ForFork0NotInUse, 320#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), t_funThread2of2ForFork0InUse, 586#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 360#true, Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 346#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 336#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)))]) [2022-11-18 18:45:28,521 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-18 18:45:28,522 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 18:45:28,522 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 18:45:28,522 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 18:45:28,560 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1022] t_funEXIT-->L1040-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][271], [Black: 334#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 332#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|))), Black: 321#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 340#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 330#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, t_funThread2of2ForFork0NotInUse, 320#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), 586#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 360#true, Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 346#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 336#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)))]) [2022-11-18 18:45:28,561 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-18 18:45:28,561 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 18:45:28,561 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-18 18:45:28,561 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-18 18:45:28,562 INFO L130 PetriNetUnfolder]: 123/1465 cut-off events. [2022-11-18 18:45:28,563 INFO L131 PetriNetUnfolder]: For 719/848 co-relation queries the response was YES. [2022-11-18 18:45:28,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 1465 events. 123/1465 cut-off events. For 719/848 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 11026 event pairs, 26 based on Foata normal form. 7/1327 useless extension candidates. Maximal degree in co-relation 2001. Up to 127 conditions per place. [2022-11-18 18:45:28,580 INFO L137 encePairwiseOnDemand]: 299/303 looper letters, 13 selfloop transitions, 5 changer transitions 0/292 dead transitions. [2022-11-18 18:45:28,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 292 transitions, 854 flow [2022-11-18 18:45:28,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 18:45:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-18 18:45:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1011 transitions. [2022-11-18 18:45:28,583 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8341584158415841 [2022-11-18 18:45:28,584 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1011 transitions. [2022-11-18 18:45:28,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1011 transitions. [2022-11-18 18:45:28,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:28,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1011 transitions. [2022-11-18 18:45:28,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 252.75) internal successors, (1011), 4 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:28,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:28,589 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:28,589 INFO L175 Difference]: Start difference. First operand has 292 places, 293 transitions, 822 flow. Second operand 4 states and 1011 transitions. [2022-11-18 18:45:28,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 292 transitions, 854 flow [2022-11-18 18:45:28,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 292 transitions, 842 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 18:45:28,602 INFO L231 Difference]: Finished difference. Result has 291 places, 292 transitions, 816 flow [2022-11-18 18:45:28,602 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=816, PETRI_PLACES=291, PETRI_TRANSITIONS=292} [2022-11-18 18:45:28,604 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 26 predicate places. [2022-11-18 18:45:28,604 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 292 transitions, 816 flow [2022-11-18 18:45:28,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 252.2) internal successors, (1261), 5 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:28,604 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:28,605 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:28,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 18:45:28,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:45:28,811 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-18 18:45:28,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:28,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1577907406, now seen corresponding path program 1 times [2022-11-18 18:45:28,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:28,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745974993] [2022-11-18 18:45:28,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:28,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:28,910 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-18 18:45:28,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:28,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745974993] [2022-11-18 18:45:28,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745974993] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:45:28,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870702171] [2022-11-18 18:45:28,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:28,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:45:28,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:45:28,912 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:45:28,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 18:45:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:29,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 18:45:29,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:45:29,093 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-18 18:45:29,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:45:29,150 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-18 18:45:29,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870702171] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:45:29,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:45:29,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-18 18:45:29,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370939530] [2022-11-18 18:45:29,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:45:29,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 18:45:29,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:29,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 18:45:29,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-18 18:45:29,158 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-18 18:45:29,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 292 transitions, 816 flow. Second operand has 10 states, 10 states have (on average 251.9) internal successors, (2519), 10 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:29,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:29,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-18 18:45:29,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:29,270 INFO L130 PetriNetUnfolder]: 3/307 cut-off events. [2022-11-18 18:45:29,270 INFO L131 PetriNetUnfolder]: For 67/70 co-relation queries the response was YES. [2022-11-18 18:45:29,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 307 events. 3/307 cut-off events. For 67/70 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 807 event pairs, 0 based on Foata normal form. 2/290 useless extension candidates. Maximal degree in co-relation 378. Up to 8 conditions per place. [2022-11-18 18:45:29,272 INFO L137 encePairwiseOnDemand]: 298/303 looper letters, 13 selfloop transitions, 7 changer transitions 0/204 dead transitions. [2022-11-18 18:45:29,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 204 transitions, 588 flow [2022-11-18 18:45:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:45:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 18:45:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2263 transitions. [2022-11-18 18:45:29,278 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8298496516318299 [2022-11-18 18:45:29,278 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2263 transitions. [2022-11-18 18:45:29,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2263 transitions. [2022-11-18 18:45:29,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:29,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2263 transitions. [2022-11-18 18:45:29,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 251.44444444444446) internal successors, (2263), 9 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:29,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 303.0) internal successors, (3030), 10 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:29,289 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 303.0) internal successors, (3030), 10 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:29,289 INFO L175 Difference]: Start difference. First operand has 291 places, 292 transitions, 816 flow. Second operand 9 states and 2263 transitions. [2022-11-18 18:45:29,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 204 transitions, 588 flow [2022-11-18 18:45:29,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 204 transitions, 548 flow, removed 12 selfloop flow, removed 10 redundant places. [2022-11-18 18:45:29,296 INFO L231 Difference]: Finished difference. Result has 216 places, 199 transitions, 510 flow [2022-11-18 18:45:29,296 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=510, PETRI_PLACES=216, PETRI_TRANSITIONS=199} [2022-11-18 18:45:29,297 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -49 predicate places. [2022-11-18 18:45:29,297 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 199 transitions, 510 flow [2022-11-18 18:45:29,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 251.9) internal successors, (2519), 10 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:29,298 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:29,298 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:29,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 18:45:29,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 18:45:29,504 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-18 18:45:29,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:29,504 INFO L85 PathProgramCache]: Analyzing trace with hash 986756205, now seen corresponding path program 1 times [2022-11-18 18:45:29,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:29,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170898413] [2022-11-18 18:45:29,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:29,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:29,690 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-18 18:45:29,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:29,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170898413] [2022-11-18 18:45:29,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170898413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:29,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:29,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:45:29,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941752328] [2022-11-18 18:45:29,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:29,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:45:29,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:29,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:45:29,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:45:29,696 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 303 [2022-11-18 18:45:29,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 199 transitions, 510 flow. Second operand has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:29,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:29,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 303 [2022-11-18 18:45:29,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:30,431 INFO L130 PetriNetUnfolder]: 632/2847 cut-off events. [2022-11-18 18:45:30,431 INFO L131 PetriNetUnfolder]: For 620/641 co-relation queries the response was YES. [2022-11-18 18:45:30,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4669 conditions, 2847 events. 632/2847 cut-off events. For 620/641 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 25959 event pairs, 205 based on Foata normal form. 19/2603 useless extension candidates. Maximal degree in co-relation 2323. Up to 470 conditions per place. [2022-11-18 18:45:30,454 INFO L137 encePairwiseOnDemand]: 289/303 looper letters, 109 selfloop transitions, 32 changer transitions 0/280 dead transitions. [2022-11-18 18:45:30,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 280 transitions, 1062 flow [2022-11-18 18:45:30,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 18:45:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 18:45:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2388 transitions. [2022-11-18 18:45:30,463 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7164716471647165 [2022-11-18 18:45:30,463 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2388 transitions. [2022-11-18 18:45:30,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2388 transitions. [2022-11-18 18:45:30,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:30,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2388 transitions. [2022-11-18 18:45:30,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 217.0909090909091) internal successors, (2388), 11 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:30,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 303.0) internal successors, (3636), 12 states have internal predecessors, (3636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:30,480 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 303.0) internal successors, (3636), 12 states have internal predecessors, (3636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:30,480 INFO L175 Difference]: Start difference. First operand has 216 places, 199 transitions, 510 flow. Second operand 11 states and 2388 transitions. [2022-11-18 18:45:30,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 280 transitions, 1062 flow [2022-11-18 18:45:30,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 280 transitions, 1039 flow, removed 3 selfloop flow, removed 8 redundant places. [2022-11-18 18:45:30,489 INFO L231 Difference]: Finished difference. Result has 225 places, 225 transitions, 730 flow [2022-11-18 18:45:30,490 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=730, PETRI_PLACES=225, PETRI_TRANSITIONS=225} [2022-11-18 18:45:30,491 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -40 predicate places. [2022-11-18 18:45:30,491 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 730 flow [2022-11-18 18:45:30,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:30,492 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:30,492 INFO L209 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 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-18 18:45:30,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 18:45:30,492 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-18 18:45:30,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:30,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1978150363, now seen corresponding path program 1 times [2022-11-18 18:45:30,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:30,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752684642] [2022-11-18 18:45:30,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:30,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:45:30,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 18:45:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:45:30,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 18:45:30,569 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 18:45:30,570 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2022-11-18 18:45:30,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2022-11-18 18:45:30,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2022-11-18 18:45:30,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2022-11-18 18:45:30,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2022-11-18 18:45:30,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2022-11-18 18:45:30,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2022-11-18 18:45:30,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2022-11-18 18:45:30,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2022-11-18 18:45:30,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2022-11-18 18:45:30,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2022-11-18 18:45:30,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2022-11-18 18:45:30,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2022-11-18 18:45:30,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2022-11-18 18:45:30,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 25 remaining) [2022-11-18 18:45:30,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2022-11-18 18:45:30,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2022-11-18 18:45:30,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2022-11-18 18:45:30,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2022-11-18 18:45:30,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2022-11-18 18:45:30,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2022-11-18 18:45:30,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2022-11-18 18:45:30,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2022-11-18 18:45:30,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2022-11-18 18:45:30,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2022-11-18 18:45:30,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 18:45:30,577 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:30,578 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-18 18:45:30,578 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-18 18:45:30,625 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-18 18:45:30,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 370 transitions, 770 flow [2022-11-18 18:45:30,761 INFO L130 PetriNetUnfolder]: 106/722 cut-off events. [2022-11-18 18:45:30,762 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-18 18:45:30,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 722 events. 106/722 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3161 event pairs, 1 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 506. Up to 16 conditions per place. [2022-11-18 18:45:30,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 370 transitions, 770 flow [2022-11-18 18:45:30,783 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 321 places, 368 transitions, 766 flow [2022-11-18 18:45:30,785 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:45:30,786 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;@4e432e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:45:30,786 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-11-18 18:45:30,790 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-11-18 18:45:30,790 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 18:45:30,790 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:30,790 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:30,791 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-18 18:45:30,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:30,791 INFO L85 PathProgramCache]: Analyzing trace with hash -721879760, now seen corresponding path program 1 times [2022-11-18 18:45:30,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:30,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689483990] [2022-11-18 18:45:30,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:30,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:30,885 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-18 18:45:30,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:30,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689483990] [2022-11-18 18:45:30,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689483990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:30,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:30,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:45:30,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908383020] [2022-11-18 18:45:30,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:30,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:45:30,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:30,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:45:30,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:45:30,890 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 370 [2022-11-18 18:45:30,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 368 transitions, 766 flow. Second operand has 6 states, 6 states have (on average 298.3333333333333) internal successors, (1790), 6 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:30,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:30,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 370 [2022-11-18 18:45:30,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:31,193 INFO L130 PetriNetUnfolder]: 30/1181 cut-off events. [2022-11-18 18:45:31,194 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-11-18 18:45:31,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 1181 events. 30/1181 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7516 event pairs, 2 based on Foata normal form. 410/1439 useless extension candidates. Maximal degree in co-relation 834. Up to 24 conditions per place. [2022-11-18 18:45:31,220 INFO L137 encePairwiseOnDemand]: 315/370 looper letters, 19 selfloop transitions, 8 changer transitions 0/323 dead transitions. [2022-11-18 18:45:31,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 323 transitions, 754 flow [2022-11-18 18:45:31,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 18:45:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 18:45:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2496 transitions. [2022-11-18 18:45:31,225 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8432432432432433 [2022-11-18 18:45:31,225 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2496 transitions. [2022-11-18 18:45:31,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2496 transitions. [2022-11-18 18:45:31,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:31,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2496 transitions. [2022-11-18 18:45:31,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 312.0) internal successors, (2496), 8 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:31,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 370.0) internal successors, (3330), 9 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:31,237 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 370.0) internal successors, (3330), 9 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:31,237 INFO L175 Difference]: Start difference. First operand has 321 places, 368 transitions, 766 flow. Second operand 8 states and 2496 transitions. [2022-11-18 18:45:31,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 323 transitions, 754 flow [2022-11-18 18:45:31,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 323 transitions, 754 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 18:45:31,244 INFO L231 Difference]: Finished difference. Result has 323 places, 317 transitions, 680 flow [2022-11-18 18:45:31,244 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=680, PETRI_PLACES=323, PETRI_TRANSITIONS=317} [2022-11-18 18:45:31,245 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 2 predicate places. [2022-11-18 18:45:31,245 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 317 transitions, 680 flow [2022-11-18 18:45:31,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 298.3333333333333) internal successors, (1790), 6 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:31,246 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:31,246 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:31,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 18:45:31,246 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-18 18:45:31,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:31,247 INFO L85 PathProgramCache]: Analyzing trace with hash -721889790, now seen corresponding path program 1 times [2022-11-18 18:45:31,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:31,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085254416] [2022-11-18 18:45:31,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:31,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:31,286 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-18 18:45:31,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:31,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085254416] [2022-11-18 18:45:31,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085254416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:31,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:31,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:45:31,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139682149] [2022-11-18 18:45:31,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:31,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:45:31,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:31,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:45:31,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:45:31,290 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 370 [2022-11-18 18:45:31,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 317 transitions, 680 flow. Second operand has 4 states, 4 states have (on average 300.5) internal successors, (1202), 4 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:31,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:31,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 370 [2022-11-18 18:45:31,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:31,597 INFO L130 PetriNetUnfolder]: 30/1180 cut-off events. [2022-11-18 18:45:31,597 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-11-18 18:45:31,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 1180 events. 30/1180 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7551 event pairs, 2 based on Foata normal form. 0/1029 useless extension candidates. Maximal degree in co-relation 839. Up to 38 conditions per place. [2022-11-18 18:45:31,621 INFO L137 encePairwiseOnDemand]: 365/370 looper letters, 15 selfloop transitions, 4 changer transitions 0/316 dead transitions. [2022-11-18 18:45:31,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 316 transitions, 716 flow [2022-11-18 18:45:31,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:45:31,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 18:45:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1515 transitions. [2022-11-18 18:45:31,626 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8189189189189189 [2022-11-18 18:45:31,626 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1515 transitions. [2022-11-18 18:45:31,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1515 transitions. [2022-11-18 18:45:31,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:31,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1515 transitions. [2022-11-18 18:45:31,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:31,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:31,634 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:31,635 INFO L175 Difference]: Start difference. First operand has 323 places, 317 transitions, 680 flow. Second operand 5 states and 1515 transitions. [2022-11-18 18:45:31,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 316 transitions, 716 flow [2022-11-18 18:45:31,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 316 transitions, 700 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-18 18:45:31,640 INFO L231 Difference]: Finished difference. Result has 319 places, 316 transitions, 670 flow [2022-11-18 18:45:31,641 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=670, PETRI_PLACES=319, PETRI_TRANSITIONS=316} [2022-11-18 18:45:31,641 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -2 predicate places. [2022-11-18 18:45:31,642 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 316 transitions, 670 flow [2022-11-18 18:45:31,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 300.5) internal successors, (1202), 4 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:31,643 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:31,643 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:31,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 18:45:31,644 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-18 18:45:31,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:31,644 INFO L85 PathProgramCache]: Analyzing trace with hash -903434981, now seen corresponding path program 1 times [2022-11-18 18:45:31,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:31,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404666318] [2022-11-18 18:45:31,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:31,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:31,711 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-18 18:45:31,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:31,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404666318] [2022-11-18 18:45:31,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404666318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:31,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:31,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 18:45:31,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578684584] [2022-11-18 18:45:31,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:31,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:45:31,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:31,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:45:31,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:45:31,715 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 370 [2022-11-18 18:45:31,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 316 transitions, 670 flow. Second operand has 5 states, 5 states have (on average 298.8) internal successors, (1494), 5 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:31,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:31,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 370 [2022-11-18 18:45:31,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:32,025 INFO L130 PetriNetUnfolder]: 30/1179 cut-off events. [2022-11-18 18:45:32,026 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-11-18 18:45:32,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 1179 events. 30/1179 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7543 event pairs, 2 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 835. Up to 24 conditions per place. [2022-11-18 18:45:32,051 INFO L137 encePairwiseOnDemand]: 363/370 looper letters, 20 selfloop transitions, 6 changer transitions 0/321 dead transitions. [2022-11-18 18:45:32,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 321 transitions, 756 flow [2022-11-18 18:45:32,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:45:32,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 18:45:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1809 transitions. [2022-11-18 18:45:32,055 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8148648648648649 [2022-11-18 18:45:32,055 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1809 transitions. [2022-11-18 18:45:32,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1809 transitions. [2022-11-18 18:45:32,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:32,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1809 transitions. [2022-11-18 18:45:32,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 301.5) internal successors, (1809), 6 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:32,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 370.0) internal successors, (2590), 7 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:32,065 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 370.0) internal successors, (2590), 7 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:32,065 INFO L175 Difference]: Start difference. First operand has 319 places, 316 transitions, 670 flow. Second operand 6 states and 1809 transitions. [2022-11-18 18:45:32,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 321 transitions, 756 flow [2022-11-18 18:45:32,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 321 transitions, 748 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 18:45:32,072 INFO L231 Difference]: Finished difference. Result has 319 places, 315 transitions, 672 flow [2022-11-18 18:45:32,074 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=672, PETRI_PLACES=319, PETRI_TRANSITIONS=315} [2022-11-18 18:45:32,075 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -2 predicate places. [2022-11-18 18:45:32,075 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 315 transitions, 672 flow [2022-11-18 18:45:32,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 298.8) internal successors, (1494), 5 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:32,076 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:32,076 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:32,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-18 18:45:32,077 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-18 18:45:32,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:32,077 INFO L85 PathProgramCache]: Analyzing trace with hash -903745832, now seen corresponding path program 1 times [2022-11-18 18:45:32,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:32,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150077526] [2022-11-18 18:45:32,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:32,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:32,125 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-18 18:45:32,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:32,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150077526] [2022-11-18 18:45:32,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150077526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:32,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:32,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:45:32,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351759878] [2022-11-18 18:45:32,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:32,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:45:32,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:32,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:45:32,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:45:32,131 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 370 [2022-11-18 18:45:32,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 315 transitions, 672 flow. Second operand has 4 states, 4 states have (on average 300.75) internal successors, (1203), 4 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:32,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:32,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 370 [2022-11-18 18:45:32,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:32,409 INFO L130 PetriNetUnfolder]: 30/1178 cut-off events. [2022-11-18 18:45:32,409 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2022-11-18 18:45:32,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1280 conditions, 1178 events. 30/1178 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7514 event pairs, 2 based on Foata normal form. 0/1029 useless extension candidates. Maximal degree in co-relation 834. Up to 24 conditions per place. [2022-11-18 18:45:32,435 INFO L137 encePairwiseOnDemand]: 366/370 looper letters, 21 selfloop transitions, 3 changer transitions 0/320 dead transitions. [2022-11-18 18:45:32,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 320 transitions, 754 flow [2022-11-18 18:45:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 18:45:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-18 18:45:32,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1221 transitions. [2022-11-18 18:45:32,438 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825 [2022-11-18 18:45:32,438 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1221 transitions. [2022-11-18 18:45:32,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1221 transitions. [2022-11-18 18:45:32,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:32,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1221 transitions. [2022-11-18 18:45:32,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 305.25) internal successors, (1221), 4 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:32,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:32,446 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:32,446 INFO L175 Difference]: Start difference. First operand has 319 places, 315 transitions, 672 flow. Second operand 4 states and 1221 transitions. [2022-11-18 18:45:32,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 320 transitions, 754 flow [2022-11-18 18:45:32,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 320 transitions, 742 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 18:45:32,459 INFO L231 Difference]: Finished difference. Result has 316 places, 314 transitions, 664 flow [2022-11-18 18:45:32,460 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=664, PETRI_PLACES=316, PETRI_TRANSITIONS=314} [2022-11-18 18:45:32,461 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -5 predicate places. [2022-11-18 18:45:32,461 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 314 transitions, 664 flow [2022-11-18 18:45:32,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 300.75) internal successors, (1203), 4 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:32,462 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:32,462 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:32,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-18 18:45:32,462 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-18 18:45:32,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:32,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1242822097, now seen corresponding path program 1 times [2022-11-18 18:45:32,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:32,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747086826] [2022-11-18 18:45:32,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:32,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:32,550 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-18 18:45:32,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:32,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747086826] [2022-11-18 18:45:32,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747086826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:32,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:32,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:45:32,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812820664] [2022-11-18 18:45:32,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:32,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:45:32,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:32,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:45:32,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:45:32,555 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-18 18:45:32,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 314 transitions, 664 flow. Second operand has 4 states, 4 states have (on average 303.75) internal successors, (1215), 4 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:32,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:32,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-18 18:45:32,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:32,903 INFO L130 PetriNetUnfolder]: 26/1070 cut-off events. [2022-11-18 18:45:32,904 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2022-11-18 18:45:32,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 1070 events. 26/1070 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6566 event pairs, 2 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 754. Up to 78 conditions per place. [2022-11-18 18:45:32,929 INFO L137 encePairwiseOnDemand]: 363/370 looper letters, 21 selfloop transitions, 4 changer transitions 0/321 dead transitions. [2022-11-18 18:45:32,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 321 transitions, 728 flow [2022-11-18 18:45:32,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:45:32,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 18:45:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1538 transitions. [2022-11-18 18:45:32,933 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8313513513513513 [2022-11-18 18:45:32,933 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1538 transitions. [2022-11-18 18:45:32,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1538 transitions. [2022-11-18 18:45:32,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:32,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1538 transitions. [2022-11-18 18:45:32,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 307.6) internal successors, (1538), 5 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:32,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:32,942 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:32,942 INFO L175 Difference]: Start difference. First operand has 316 places, 314 transitions, 664 flow. Second operand 5 states and 1538 transitions. [2022-11-18 18:45:32,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 321 transitions, 728 flow [2022-11-18 18:45:32,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 321 transitions, 722 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 18:45:32,950 INFO L231 Difference]: Finished difference. Result has 320 places, 317 transitions, 690 flow [2022-11-18 18:45:32,951 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=690, PETRI_PLACES=320, PETRI_TRANSITIONS=317} [2022-11-18 18:45:32,951 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -1 predicate places. [2022-11-18 18:45:32,951 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 317 transitions, 690 flow [2022-11-18 18:45:32,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 303.75) internal successors, (1215), 4 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:32,952 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:32,953 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:45:32,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-18 18:45:32,953 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-18 18:45:32,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:32,954 INFO L85 PathProgramCache]: Analyzing trace with hash 96355770, now seen corresponding path program 1 times [2022-11-18 18:45:32,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:32,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774311290] [2022-11-18 18:45:32,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:32,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:33,511 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-18 18:45:33,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:33,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774311290] [2022-11-18 18:45:33,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774311290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:33,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:33,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 18:45:33,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314806872] [2022-11-18 18:45:33,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:33,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 18:45:33,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:33,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 18:45:33,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-18 18:45:33,518 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 370 [2022-11-18 18:45:33,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 317 transitions, 690 flow. Second operand has 11 states, 11 states have (on average 243.8181818181818) internal successors, (2682), 11 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:33,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:33,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 370 [2022-11-18 18:45:33,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:56,485 INFO L130 PetriNetUnfolder]: 54582/138425 cut-off events. [2022-11-18 18:45:56,485 INFO L131 PetriNetUnfolder]: For 2468/2468 co-relation queries the response was YES. [2022-11-18 18:45:57,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214396 conditions, 138425 events. 54582/138425 cut-off events. For 2468/2468 co-relation queries the response was YES. Maximal size of possible extension queue 5305. Compared 1968653 event pairs, 11655 based on Foata normal form. 0/126293 useless extension candidates. Maximal degree in co-relation 214261. Up to 38964 conditions per place. [2022-11-18 18:45:58,501 INFO L137 encePairwiseOnDemand]: 353/370 looper letters, 317 selfloop transitions, 39 changer transitions 0/593 dead transitions. [2022-11-18 18:45:58,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 593 transitions, 2060 flow [2022-11-18 18:45:58,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 18:45:58,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-18 18:45:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4444 transitions. [2022-11-18 18:45:58,514 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7065182829888712 [2022-11-18 18:45:58,514 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4444 transitions. [2022-11-18 18:45:58,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4444 transitions. [2022-11-18 18:45:58,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:58,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4444 transitions. [2022-11-18 18:45:58,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 261.4117647058824) internal successors, (4444), 17 states have internal predecessors, (4444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:58,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 370.0) internal successors, (6660), 18 states have internal predecessors, (6660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:58,538 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 370.0) internal successors, (6660), 18 states have internal predecessors, (6660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:58,538 INFO L175 Difference]: Start difference. First operand has 320 places, 317 transitions, 690 flow. Second operand 17 states and 4444 transitions. [2022-11-18 18:45:58,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 593 transitions, 2060 flow [2022-11-18 18:45:58,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 593 transitions, 2058 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 18:45:58,549 INFO L231 Difference]: Finished difference. Result has 345 places, 354 transitions, 971 flow [2022-11-18 18:45:58,550 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=971, PETRI_PLACES=345, PETRI_TRANSITIONS=354} [2022-11-18 18:45:58,550 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 24 predicate places. [2022-11-18 18:45:58,551 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 354 transitions, 971 flow [2022-11-18 18:45:58,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 243.8181818181818) internal successors, (2682), 11 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:58,552 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:58,552 INFO L209 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 18:45:58,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-18 18:45:58,552 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-18 18:45:58,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:58,553 INFO L85 PathProgramCache]: Analyzing trace with hash -836580835, now seen corresponding path program 1 times [2022-11-18 18:45:58,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:58,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018098795] [2022-11-18 18:45:58,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:58,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:45:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:45:58,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:45:58,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018098795] [2022-11-18 18:45:58,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018098795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:45:58,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:45:58,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:45:58,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210072664] [2022-11-18 18:45:58,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:45:58,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:45:58,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:45:58,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:45:58,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:45:58,614 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-18 18:45:58,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 354 transitions, 971 flow. Second operand has 4 states, 4 states have (on average 305.75) internal successors, (1223), 4 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:58,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:45:58,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-18 18:45:58,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:45:58,949 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:45:58,949 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-18 18:45:58,949 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 18:45:58,949 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-18 18:45:58,949 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 18:45:59,133 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 83#t_funENTRYtrue, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:45:59,134 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-18 18:45:59,134 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 18:45:59,134 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 18:45:59,134 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 18:45:59,333 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 83#t_funENTRYtrue, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:45:59,333 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is not cut-off event [2022-11-18 18:45:59,333 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 18:45:59,333 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-18 18:45:59,333 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-18 18:45:59,631 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:45:59,631 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-18 18:45:59,631 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 18:45:59,631 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 18:45:59,631 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 18:45:59,714 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][341], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 149#L1013-10true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse]) [2022-11-18 18:45:59,714 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-18 18:45:59,715 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:45:59,715 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 18:45:59,715 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 18:45:59,715 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 89#L1013-10true, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:45:59,715 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-18 18:45:59,715 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 18:45:59,715 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 18:45:59,715 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:45:59,717 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 89#L1013-10true, t_funThread1of3ForFork0NotInUse, Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:45:59,717 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-18 18:45:59,717 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 18:45:59,717 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 18:45:59,717 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:45:59,718 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:45:59,744 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][313], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 149#L1013-10true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse]) [2022-11-18 18:45:59,744 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-18 18:45:59,744 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-18 18:45:59,744 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-18 18:45:59,744 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-18 18:45:59,745 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 165#L1013-10true, Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:45:59,745 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-18 18:45:59,745 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-18 18:45:59,745 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-18 18:45:59,745 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-18 18:45:59,759 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:45:59,759 INFO L383 tUnfolder$Statistics]: this new event has 239 ancestors and is cut-off event [2022-11-18 18:45:59,759 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 18:45:59,759 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-18 18:45:59,759 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-18 18:45:59,759 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 18:45:59,760 INFO L130 PetriNetUnfolder]: 507/4910 cut-off events. [2022-11-18 18:45:59,761 INFO L131 PetriNetUnfolder]: For 3074/3823 co-relation queries the response was YES. [2022-11-18 18:45:59,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7850 conditions, 4910 events. 507/4910 cut-off events. For 3074/3823 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 49896 event pairs, 124 based on Foata normal form. 59/4433 useless extension candidates. Maximal degree in co-relation 7166. Up to 515 conditions per place. [2022-11-18 18:45:59,850 INFO L137 encePairwiseOnDemand]: 364/370 looper letters, 13 selfloop transitions, 8 changer transitions 0/354 dead transitions. [2022-11-18 18:45:59,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 354 transitions, 1011 flow [2022-11-18 18:45:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:45:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 18:45:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1529 transitions. [2022-11-18 18:45:59,854 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8264864864864865 [2022-11-18 18:45:59,854 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1529 transitions. [2022-11-18 18:45:59,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1529 transitions. [2022-11-18 18:45:59,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:45:59,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1529 transitions. [2022-11-18 18:45:59,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 305.8) internal successors, (1529), 5 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-18 18:45:59,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:59,861 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:59,861 INFO L175 Difference]: Start difference. First operand has 345 places, 354 transitions, 971 flow. Second operand 5 states and 1529 transitions. [2022-11-18 18:45:59,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 354 transitions, 1011 flow [2022-11-18 18:45:59,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 354 transitions, 1008 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 18:45:59,882 INFO L231 Difference]: Finished difference. Result has 347 places, 354 transitions, 988 flow [2022-11-18 18:45:59,883 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=988, PETRI_PLACES=347, PETRI_TRANSITIONS=354} [2022-11-18 18:45:59,884 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 26 predicate places. [2022-11-18 18:45:59,884 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 354 transitions, 988 flow [2022-11-18 18:45:59,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 305.75) internal successors, (1223), 4 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:45:59,884 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:45:59,885 INFO L209 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 18:45:59,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-18 18:45:59,885 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-18 18:45:59,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:45:59,886 INFO L85 PathProgramCache]: Analyzing trace with hash -164200905, now seen corresponding path program 1 times [2022-11-18 18:45:59,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:45:59,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801033629] [2022-11-18 18:45:59,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:45:59,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:45:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:46:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:46:00,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:46:00,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801033629] [2022-11-18 18:46:00,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801033629] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:46:00,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412068912] [2022-11-18 18:46:00,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:46:00,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:46:00,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:46:00,226 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:46:00,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 18:46:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:46:00,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 18:46:00,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:46:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:46:00,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:46:00,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412068912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:46:00,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 18:46:00,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-18 18:46:00,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947613013] [2022-11-18 18:46:00,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:46:00,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:46:00,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:46:00,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:46:00,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-18 18:46:00,412 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-18 18:46:00,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 354 transitions, 988 flow. Second operand has 5 states, 5 states have (on average 305.2) internal successors, (1526), 5 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:46:00,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:46:00,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-18 18:46:00,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:46:00,685 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:46:00,685 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-18 18:46:00,685 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 18:46:00,685 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-18 18:46:00,685 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 18:46:00,824 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 83#t_funENTRYtrue, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:46:00,824 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-18 18:46:00,824 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 18:46:00,824 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 18:46:00,824 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 18:46:00,969 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 83#t_funENTRYtrue, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:46:00,969 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is not cut-off event [2022-11-18 18:46:00,969 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 18:46:00,969 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-18 18:46:00,969 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-18 18:46:01,179 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:46:01,179 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-18 18:46:01,179 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 18:46:01,179 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 18:46:01,179 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 18:46:01,255 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][340], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 149#L1013-10true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse]) [2022-11-18 18:46:01,255 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-18 18:46:01,255 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 18:46:01,256 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 18:46:01,256 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:46:01,256 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 89#L1013-10true, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:46:01,256 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-18 18:46:01,256 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 18:46:01,256 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:46:01,256 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 18:46:01,258 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 89#L1013-10true, t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:46:01,258 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-18 18:46:01,258 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 18:46:01,258 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:46:01,258 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:46:01,259 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 18:46:01,285 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][313], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 149#L1013-10true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse]) [2022-11-18 18:46:01,285 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-18 18:46:01,285 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-18 18:46:01,285 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-18 18:46:01,285 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-18 18:46:01,285 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 165#L1013-10true, Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:46:01,285 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-18 18:46:01,286 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-18 18:46:01,286 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-18 18:46:01,286 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-18 18:46:01,300 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 416#true, 206#L1040-5true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:46:01,301 INFO L383 tUnfolder$Statistics]: this new event has 239 ancestors and is cut-off event [2022-11-18 18:46:01,301 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 18:46:01,301 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-18 18:46:01,301 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-18 18:46:01,301 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 18:46:01,302 INFO L130 PetriNetUnfolder]: 507/4908 cut-off events. [2022-11-18 18:46:01,302 INFO L131 PetriNetUnfolder]: For 3084/3791 co-relation queries the response was YES. [2022-11-18 18:46:01,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7861 conditions, 4908 events. 507/4908 cut-off events. For 3084/3791 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 49917 event pairs, 124 based on Foata normal form. 21/4393 useless extension candidates. Maximal degree in co-relation 7177. Up to 515 conditions per place. [2022-11-18 18:46:01,390 INFO L137 encePairwiseOnDemand]: 366/370 looper letters, 15 selfloop transitions, 5 changer transitions 0/353 dead transitions. [2022-11-18 18:46:01,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 353 transitions, 1024 flow [2022-11-18 18:46:01,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 18:46:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-18 18:46:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1225 transitions. [2022-11-18 18:46:01,396 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8277027027027027 [2022-11-18 18:46:01,396 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1225 transitions. [2022-11-18 18:46:01,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1225 transitions. [2022-11-18 18:46:01,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:46:01,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1225 transitions. [2022-11-18 18:46:01,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 306.25) internal successors, (1225), 4 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:46:01,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:46:01,413 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:46:01,413 INFO L175 Difference]: Start difference. First operand has 347 places, 354 transitions, 988 flow. Second operand 4 states and 1225 transitions. [2022-11-18 18:46:01,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 353 transitions, 1024 flow [2022-11-18 18:46:01,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 353 transitions, 1012 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 18:46:01,434 INFO L231 Difference]: Finished difference. Result has 346 places, 353 transitions, 982 flow [2022-11-18 18:46:01,435 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=972, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=982, PETRI_PLACES=346, PETRI_TRANSITIONS=353} [2022-11-18 18:46:01,435 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 25 predicate places. [2022-11-18 18:46:01,436 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 353 transitions, 982 flow [2022-11-18 18:46:01,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 305.2) internal successors, (1526), 5 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:46:01,437 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:46:01,437 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:46:01,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 18:46:01,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:46:01,642 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-18 18:46:01,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:46:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2069422248, now seen corresponding path program 1 times [2022-11-18 18:46:01,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:46:01,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046786118] [2022-11-18 18:46:01,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:46:01,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:46:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:46:01,714 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-18 18:46:01,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:46:01,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046786118] [2022-11-18 18:46:01,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046786118] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:46:01,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836068758] [2022-11-18 18:46:01,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:46:01,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:46:01,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:46:01,717 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:46:01,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 18:46:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:46:01,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 18:46:01,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:46:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:46:01,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:46:01,934 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-18 18:46:01,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836068758] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:46:01,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:46:01,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-18 18:46:01,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234634847] [2022-11-18 18:46:01,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:46:01,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 18:46:01,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:46:01,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 18:46:01,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-18 18:46:01,939 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-18 18:46:01,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 353 transitions, 982 flow. Second operand has 10 states, 10 states have (on average 304.9) internal successors, (3049), 10 states have internal predecessors, (3049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:46:01,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:46:01,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-18 18:46:01,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:46:02,541 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0InUse, 678#true, t_funThread3of3ForFork0InUse, 83#t_funENTRYtrue, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:46:02,542 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is not cut-off event [2022-11-18 18:46:02,542 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 18:46:02,542 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-18 18:46:02,542 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-18 18:46:02,789 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][327], [t_funThread2of3ForFork0NotInUse, 678#true, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:46:02,789 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-18 18:46:02,790 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 18:46:02,790 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 18:46:02,790 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 18:46:02,792 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 678#true, 83#t_funENTRYtrue, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 206#L1040-5true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:46:02,792 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-18 18:46:02,792 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 18:46:02,792 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 18:46:02,792 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 18:46:02,880 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0NotInUse, 678#true, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 206#L1040-5true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:46:02,881 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-18 18:46:02,881 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-18 18:46:02,881 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-18 18:46:02,881 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-18 18:46:02,884 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 678#true, 83#t_funENTRYtrue, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:46:02,884 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-18 18:46:02,884 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-18 18:46:02,885 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-18 18:46:02,885 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-18 18:46:02,918 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0NotInUse, 678#true, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 89#L1013-10true, t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:46:02,919 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-18 18:46:02,919 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 18:46:02,919 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:46:02,919 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 18:46:02,949 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 678#true, 298#L1013-6true, 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse]) [2022-11-18 18:46:02,950 INFO L383 tUnfolder$Statistics]: this new event has 194 ancestors and is not cut-off event [2022-11-18 18:46:02,950 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is not cut-off event [2022-11-18 18:46:02,950 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is not cut-off event [2022-11-18 18:46:02,950 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is not cut-off event [2022-11-18 18:46:02,955 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 678#true, 162#L1013-7true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse]) [2022-11-18 18:46:02,955 INFO L383 tUnfolder$Statistics]: this new event has 195 ancestors and is not cut-off event [2022-11-18 18:46:02,956 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-18 18:46:02,956 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-18 18:46:02,956 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-18 18:46:02,976 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][327], [t_funThread2of3ForFork0NotInUse, 678#true, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 89#L1013-10true, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:46:02,976 INFO L383 tUnfolder$Statistics]: this new event has 198 ancestors and is not cut-off event [2022-11-18 18:46:02,976 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is not cut-off event [2022-11-18 18:46:02,976 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is not cut-off event [2022-11-18 18:46:02,976 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is not cut-off event [2022-11-18 18:46:02,985 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][327], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 678#true, 149#L1013-10true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse]) [2022-11-18 18:46:02,986 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-18 18:46:02,986 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 18:46:02,986 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 18:46:02,986 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:46:03,001 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][327], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 678#true, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:46:03,002 INFO L383 tUnfolder$Statistics]: this new event has 227 ancestors and is cut-off event [2022-11-18 18:46:03,002 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-18 18:46:03,002 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-18 18:46:03,002 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-18 18:46:03,003 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 678#true, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 206#L1040-5true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:46:03,003 INFO L383 tUnfolder$Statistics]: this new event has 227 ancestors and is cut-off event [2022-11-18 18:46:03,003 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-18 18:46:03,003 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-18 18:46:03,004 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-18 18:46:03,011 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 678#true, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-18 18:46:03,011 INFO L383 tUnfolder$Statistics]: this new event has 215 ancestors and is not cut-off event [2022-11-18 18:46:03,011 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is not cut-off event [2022-11-18 18:46:03,012 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is not cut-off event [2022-11-18 18:46:03,012 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is not cut-off event [2022-11-18 18:46:03,014 INFO L130 PetriNetUnfolder]: 480/3917 cut-off events. [2022-11-18 18:46:03,015 INFO L131 PetriNetUnfolder]: For 2899/3381 co-relation queries the response was YES. [2022-11-18 18:46:03,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6709 conditions, 3917 events. 480/3917 cut-off events. For 2899/3381 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37319 event pairs, 153 based on Foata normal form. 28/3493 useless extension candidates. Maximal degree in co-relation 6526. Up to 487 conditions per place. [2022-11-18 18:46:03,107 INFO L137 encePairwiseOnDemand]: 364/370 looper letters, 22 selfloop transitions, 9 changer transitions 0/364 dead transitions. [2022-11-18 18:46:03,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 364 transitions, 1082 flow [2022-11-18 18:46:03,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:46:03,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 18:46:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2751 transitions. [2022-11-18 18:46:03,117 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8261261261261261 [2022-11-18 18:46:03,117 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2751 transitions. [2022-11-18 18:46:03,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2751 transitions. [2022-11-18 18:46:03,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:46:03,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2751 transitions. [2022-11-18 18:46:03,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 305.6666666666667) internal successors, (2751), 9 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:46:03,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 370.0) internal successors, (3700), 10 states have internal predecessors, (3700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:46:03,134 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 370.0) internal successors, (3700), 10 states have internal predecessors, (3700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:46:03,134 INFO L175 Difference]: Start difference. First operand has 346 places, 353 transitions, 982 flow. Second operand 9 states and 2751 transitions. [2022-11-18 18:46:03,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 364 transitions, 1082 flow [2022-11-18 18:46:03,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 364 transitions, 1068 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 18:46:03,150 INFO L231 Difference]: Finished difference. Result has 355 places, 357 transitions, 1028 flow [2022-11-18 18:46:03,151 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=972, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1028, PETRI_PLACES=355, PETRI_TRANSITIONS=357} [2022-11-18 18:46:03,152 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 34 predicate places. [2022-11-18 18:46:03,152 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 357 transitions, 1028 flow [2022-11-18 18:46:03,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.9) internal successors, (3049), 10 states have internal predecessors, (3049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:46:03,153 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:46:03,153 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:46:03,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 18:46:03,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b763b958-caaa-4759-b0b6-2323ad089aa3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-18 18:46:03,364 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-18 18:46:03,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:46:03,365 INFO L85 PathProgramCache]: Analyzing trace with hash 869056805, now seen corresponding path program 1 times [2022-11-18 18:46:03,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:46:03,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844091435] [2022-11-18 18:46:03,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:46:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:46:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:46:03,584 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-18 18:46:03,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:46:03,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844091435] [2022-11-18 18:46:03,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844091435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:46:03,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:46:03,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:46:03,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957898464] [2022-11-18 18:46:03,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:46:03,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:46:03,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:46:03,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:46:03,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:46:03,589 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 370 [2022-11-18 18:46:03,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 357 transitions, 1028 flow. Second operand has 6 states, 6 states have (on average 259.1666666666667) internal successors, (1555), 6 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:46:03,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:46:03,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 370 [2022-11-18 18:46:03,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand