./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 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/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_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN --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-6b4ec56 [2022-11-20 10:32:27,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:32:27,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:32:27,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:32:27,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:32:27,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:32:27,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:32:27,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:32:27,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:32:27,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:32:27,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:32:27,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:32:27,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:32:27,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:32:27,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:32:27,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:32:27,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:32:27,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:32:27,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:32:27,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:32:27,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:32:27,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:32:27,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:32:27,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:32:27,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:32:27,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:32:27,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:32:27,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:32:27,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:32:27,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:32:27,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:32:27,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:32:27,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:32:27,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:32:27,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:32:27,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:32:27,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:32:27,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:32:27,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:32:27,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:32:27,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:32:27,981 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-20 10:32:28,020 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:32:28,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:32:28,021 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:32:28,021 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:32:28,022 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:32:28,022 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:32:28,023 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:32:28,023 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:32:28,024 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:32:28,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:32:28,025 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:32:28,025 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:32:28,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:32:28,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:32:28,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:32:28,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:32:28,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:32:28,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:32:28,026 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 10:32:28,026 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:32:28,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:32:28,027 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:32:28,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:32:28,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:32:28,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:32:28,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:32:28,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:32:28,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:32:28,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:32:28,029 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:32:28,029 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:32:28,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:32:28,030 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:32:28,030 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:32:28,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:32:28,030 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_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/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_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN 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-20 10:32:28,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:32:28,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:32:28,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:32:28,432 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:32:28,432 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:32:28,434 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2022-11-20 10:32:31,404 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:32:31,814 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:32:31,818 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2022-11-20 10:32:31,877 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/data/451eb1920/81d83e74f19e4c8297afa4ebb83a6df5/FLAGc35cf136f [2022-11-20 10:32:31,902 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/data/451eb1920/81d83e74f19e4c8297afa4ebb83a6df5 [2022-11-20 10:32:31,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:32:31,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:32:31,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:32:31,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:32:31,915 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:32:31,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:32:31" (1/1) ... [2022-11-20 10:32:31,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da4f46c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:31, skipping insertion in model container [2022-11-20 10:32:31,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:32:31" (1/1) ... [2022-11-20 10:32:31,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:32:31,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:32:32,570 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i[47038,47051] [2022-11-20 10:32:32,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:32:32,631 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:32:32,668 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i[47038,47051] [2022-11-20 10:32:32,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:32:32,759 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:32:32,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:32 WrapperNode [2022-11-20 10:32:32,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:32:32,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:32:32,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:32:32,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:32:32,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:32" (1/1) ... [2022-11-20 10:32:32,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:32" (1/1) ... [2022-11-20 10:32:32,828 INFO L138 Inliner]: procedures = 271, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 217 [2022-11-20 10:32:32,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:32:32,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:32:32,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:32:32,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:32:32,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:32" (1/1) ... [2022-11-20 10:32:32,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:32" (1/1) ... [2022-11-20 10:32:32,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:32" (1/1) ... [2022-11-20 10:32:32,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:32" (1/1) ... [2022-11-20 10:32:32,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:32" (1/1) ... [2022-11-20 10:32:32,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:32" (1/1) ... [2022-11-20 10:32:32,885 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:32" (1/1) ... [2022-11-20 10:32:32,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:32" (1/1) ... [2022-11-20 10:32:32,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:32:32,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:32:32,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:32:32,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:32:32,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:32" (1/1) ... [2022-11-20 10:32:32,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:32:32,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:32,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:32:32,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:32:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:32:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:32:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:32:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:32:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 10:32:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:32:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-20 10:32:32,983 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-20 10:32:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:32:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:32:32,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:32:32,986 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:32:33,156 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:32:33,158 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:32:33,648 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:32:33,666 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:32:33,667 INFO L300 CfgBuilder]: Removed 22 assume(true) statements. [2022-11-20 10:32:33,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:32:33 BoogieIcfgContainer [2022-11-20 10:32:33,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:32:33,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:32:33,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:32:33,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:32:33,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:32:31" (1/3) ... [2022-11-20 10:32:33,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2c1da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:32:33, skipping insertion in model container [2022-11-20 10:32:33,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:32" (2/3) ... [2022-11-20 10:32:33,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2c1da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:32:33, skipping insertion in model container [2022-11-20 10:32:33,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:32:33" (3/3) ... [2022-11-20 10:32:33,688 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_78-equ_racing.i [2022-11-20 10:32:33,697 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 10:32:33,708 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:32:33,708 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-20 10:32:33,708 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:32:33,871 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-20 10:32:33,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 236 transitions, 480 flow [2022-11-20 10:32:34,116 INFO L130 PetriNetUnfolder]: 43/315 cut-off events. [2022-11-20 10:32:34,117 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-20 10:32:34,126 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-20 10:32:34,126 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 236 transitions, 480 flow [2022-11-20 10:32:34,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 231 transitions, 470 flow [2022-11-20 10:32:34,162 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:32:34,170 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;@29e5adf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:32:34,170 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-20 10:32:34,181 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-11-20 10:32:34,181 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:32:34,181 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:34,182 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-20 10:32:34,198 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-20 10:32:34,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:34,208 INFO L85 PathProgramCache]: Analyzing trace with hash 687608078, now seen corresponding path program 1 times [2022-11-20 10:32:34,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:34,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567701109] [2022-11-20 10:32:34,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:34,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:34,807 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-20 10:32:34,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:34,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567701109] [2022-11-20 10:32:34,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567701109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:34,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:34,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:32:34,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54692041] [2022-11-20 10:32:34,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:34,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:32:34,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:34,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:32:34,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:32:34,873 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 236 [2022-11-20 10:32:34,880 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-20 10:32:34,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:34,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 236 [2022-11-20 10:32:34,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:35,140 INFO L130 PetriNetUnfolder]: 6/473 cut-off events. [2022-11-20 10:32:35,141 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-20 10:32:35,148 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-20 10:32:35,151 INFO L137 encePairwiseOnDemand]: 203/236 looper letters, 11 selfloop transitions, 8 changer transitions 0/206 dead transitions. [2022-11-20 10:32:35,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 206 transitions, 464 flow [2022-11-20 10:32:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:32:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 10:32:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1596 transitions. [2022-11-20 10:32:35,175 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8453389830508474 [2022-11-20 10:32:35,176 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1596 transitions. [2022-11-20 10:32:35,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1596 transitions. [2022-11-20 10:32:35,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:35,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1596 transitions. [2022-11-20 10:32:35,193 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-20 10:32:35,204 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-20 10:32:35,205 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-20 10:32:35,206 INFO L175 Difference]: Start difference. First operand has 207 places, 231 transitions, 470 flow. Second operand 8 states and 1596 transitions. [2022-11-20 10:32:35,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 206 transitions, 464 flow [2022-11-20 10:32:35,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 206 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 10:32:35,216 INFO L231 Difference]: Finished difference. Result has 211 places, 204 transitions, 432 flow [2022-11-20 10:32:35,219 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-20 10:32:35,222 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 4 predicate places. [2022-11-20 10:32:35,222 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 204 transitions, 432 flow [2022-11-20 10:32:35,223 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-20 10:32:35,223 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:35,224 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-20 10:32:35,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:32:35,224 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-20 10:32:35,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:35,225 INFO L85 PathProgramCache]: Analyzing trace with hash 687598048, now seen corresponding path program 1 times [2022-11-20 10:32:35,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:35,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416401894] [2022-11-20 10:32:35,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:35,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:35,334 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-20 10:32:35,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:35,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416401894] [2022-11-20 10:32:35,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416401894] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:35,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:35,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:32:35,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401331179] [2022-11-20 10:32:35,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:35,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:32:35,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:35,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:32:35,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:32:35,340 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 236 [2022-11-20 10:32:35,341 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-20 10:32:35,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:35,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 236 [2022-11-20 10:32:35,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:35,464 INFO L130 PetriNetUnfolder]: 6/472 cut-off events. [2022-11-20 10:32:35,464 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-20 10:32:35,467 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-20 10:32:35,468 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 11 selfloop transitions, 4 changer transitions 0/203 dead transitions. [2022-11-20 10:32:35,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 203 transitions, 460 flow [2022-11-20 10:32:35,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:32:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:32:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 981 transitions. [2022-11-20 10:32:35,473 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8313559322033899 [2022-11-20 10:32:35,473 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 981 transitions. [2022-11-20 10:32:35,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 981 transitions. [2022-11-20 10:32:35,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:35,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 981 transitions. [2022-11-20 10:32:35,478 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-20 10:32:35,481 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-20 10:32:35,482 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-20 10:32:35,482 INFO L175 Difference]: Start difference. First operand has 211 places, 204 transitions, 432 flow. Second operand 5 states and 981 transitions. [2022-11-20 10:32:35,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 203 transitions, 460 flow [2022-11-20 10:32:35,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 203 transitions, 444 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-20 10:32:35,493 INFO L231 Difference]: Finished difference. Result has 207 places, 203 transitions, 422 flow [2022-11-20 10:32:35,494 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-20 10:32:35,495 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2022-11-20 10:32:35,496 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 422 flow [2022-11-20 10:32:35,497 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-20 10:32:35,497 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:35,497 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-20 10:32:35,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:32:35,498 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-20 10:32:35,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:35,502 INFO L85 PathProgramCache]: Analyzing trace with hash -158985636, now seen corresponding path program 1 times [2022-11-20 10:32:35,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:35,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004388483] [2022-11-20 10:32:35,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:35,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:35,682 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-20 10:32:35,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:35,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004388483] [2022-11-20 10:32:35,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004388483] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:35,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:35,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:32:35,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719258803] [2022-11-20 10:32:35,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:35,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:32:35,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:35,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:32:35,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:32:35,690 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 236 [2022-11-20 10:32:35,692 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-20 10:32:35,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:35,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 236 [2022-11-20 10:32:35,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:35,817 INFO L130 PetriNetUnfolder]: 6/471 cut-off events. [2022-11-20 10:32:35,817 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-20 10:32:35,819 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-20 10:32:35,821 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 12 selfloop transitions, 6 changer transitions 0/204 dead transitions. [2022-11-20 10:32:35,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 204 transitions, 466 flow [2022-11-20 10:32:35,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:32:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 10:32:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1165 transitions. [2022-11-20 10:32:35,824 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8227401129943502 [2022-11-20 10:32:35,824 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1165 transitions. [2022-11-20 10:32:35,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1165 transitions. [2022-11-20 10:32:35,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:35,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1165 transitions. [2022-11-20 10:32:35,829 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-20 10:32:35,832 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-20 10:32:35,833 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-20 10:32:35,833 INFO L175 Difference]: Start difference. First operand has 207 places, 203 transitions, 422 flow. Second operand 6 states and 1165 transitions. [2022-11-20 10:32:35,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 204 transitions, 466 flow [2022-11-20 10:32:35,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 204 transitions, 458 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 10:32:35,838 INFO L231 Difference]: Finished difference. Result has 207 places, 202 transitions, 424 flow [2022-11-20 10:32:35,839 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-20 10:32:35,840 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2022-11-20 10:32:35,840 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 202 transitions, 424 flow [2022-11-20 10:32:35,841 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-20 10:32:35,841 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:35,841 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-20 10:32:35,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:32:35,842 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-20 10:32:35,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:35,842 INFO L85 PathProgramCache]: Analyzing trace with hash -159296487, now seen corresponding path program 1 times [2022-11-20 10:32:35,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:35,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101861293] [2022-11-20 10:32:35,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:35,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:35,899 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-20 10:32:35,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:35,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101861293] [2022-11-20 10:32:35,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101861293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:35,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:35,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:32:35,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694934033] [2022-11-20 10:32:35,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:35,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:32:35,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:35,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:32:35,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:32:35,932 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 236 [2022-11-20 10:32:35,934 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-20 10:32:35,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:35,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 236 [2022-11-20 10:32:35,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:36,055 INFO L130 PetriNetUnfolder]: 6/470 cut-off events. [2022-11-20 10:32:36,056 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-20 10:32:36,058 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-20 10:32:36,060 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 13 selfloop transitions, 3 changer transitions 0/203 dead transitions. [2022-11-20 10:32:36,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 203 transitions, 464 flow [2022-11-20 10:32:36,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:32:36,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 10:32:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 789 transitions. [2022-11-20 10:32:36,064 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8358050847457628 [2022-11-20 10:32:36,065 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 789 transitions. [2022-11-20 10:32:36,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 789 transitions. [2022-11-20 10:32:36,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:36,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 789 transitions. [2022-11-20 10:32:36,069 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-20 10:32:36,072 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-20 10:32:36,073 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-20 10:32:36,073 INFO L175 Difference]: Start difference. First operand has 207 places, 202 transitions, 424 flow. Second operand 4 states and 789 transitions. [2022-11-20 10:32:36,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 203 transitions, 464 flow [2022-11-20 10:32:36,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 203 transitions, 452 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 10:32:36,078 INFO L231 Difference]: Finished difference. Result has 204 places, 201 transitions, 416 flow [2022-11-20 10:32:36,079 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-20 10:32:36,081 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, -3 predicate places. [2022-11-20 10:32:36,082 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 201 transitions, 416 flow [2022-11-20 10:32:36,083 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-20 10:32:36,088 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:36,089 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-20 10:32:36,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:32:36,090 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-20 10:32:36,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:36,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1020026128, now seen corresponding path program 1 times [2022-11-20 10:32:36,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:36,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9348802] [2022-11-20 10:32:36,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:36,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:36,228 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-20 10:32:36,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:36,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9348802] [2022-11-20 10:32:36,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9348802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:36,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:36,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:32:36,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159315178] [2022-11-20 10:32:36,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:36,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:32:36,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:36,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:32:36,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:32:36,233 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 236 [2022-11-20 10:32:36,234 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-20 10:32:36,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:36,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 236 [2022-11-20 10:32:36,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:36,314 INFO L130 PetriNetUnfolder]: 4/344 cut-off events. [2022-11-20 10:32:36,315 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-20 10:32:36,317 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-20 10:32:36,318 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 10 selfloop transitions, 4 changer transitions 0/201 dead transitions. [2022-11-20 10:32:36,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 201 transitions, 444 flow [2022-11-20 10:32:36,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:32:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:32:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 997 transitions. [2022-11-20 10:32:36,322 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8449152542372881 [2022-11-20 10:32:36,322 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 997 transitions. [2022-11-20 10:32:36,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 997 transitions. [2022-11-20 10:32:36,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:36,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 997 transitions. [2022-11-20 10:32:36,325 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-20 10:32:36,328 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-20 10:32:36,328 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-20 10:32:36,328 INFO L175 Difference]: Start difference. First operand has 204 places, 201 transitions, 416 flow. Second operand 5 states and 997 transitions. [2022-11-20 10:32:36,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 201 transitions, 444 flow [2022-11-20 10:32:36,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 201 transitions, 438 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:32:36,334 INFO L231 Difference]: Finished difference. Result has 204 places, 199 transitions, 418 flow [2022-11-20 10:32:36,334 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-20 10:32:36,338 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, -3 predicate places. [2022-11-20 10:32:36,338 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 199 transitions, 418 flow [2022-11-20 10:32:36,339 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-20 10:32:36,339 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:36,339 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-20 10:32:36,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:32:36,340 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-20 10:32:36,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:36,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1555706196, now seen corresponding path program 1 times [2022-11-20 10:32:36,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:36,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222250377] [2022-11-20 10:32:36,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:36,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:32:36,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:32:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:32:36,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:32:36,456 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:32:36,457 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2022-11-20 10:32:36,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2022-11-20 10:32:36,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2022-11-20 10:32:36,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2022-11-20 10:32:36,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2022-11-20 10:32:36,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2022-11-20 10:32:36,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2022-11-20 10:32:36,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2022-11-20 10:32:36,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2022-11-20 10:32:36,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2022-11-20 10:32:36,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2022-11-20 10:32:36,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2022-11-20 10:32:36,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2022-11-20 10:32:36,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2022-11-20 10:32:36,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2022-11-20 10:32:36,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2022-11-20 10:32:36,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2022-11-20 10:32:36,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2022-11-20 10:32:36,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2022-11-20 10:32:36,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2022-11-20 10:32:36,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2022-11-20 10:32:36,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:32:36,473 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-20 10:32:36,476 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-20 10:32:36,476 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-20 10:32:36,541 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 10:32:36,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 303 transitions, 624 flow [2022-11-20 10:32:36,647 INFO L130 PetriNetUnfolder]: 72/498 cut-off events. [2022-11-20 10:32:36,647 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-20 10:32:36,652 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-20 10:32:36,652 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 303 transitions, 624 flow [2022-11-20 10:32:36,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 265 places, 301 transitions, 620 flow [2022-11-20 10:32:36,659 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:32:36,660 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;@29e5adf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:32:36,660 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-20 10:32:36,665 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-11-20 10:32:36,665 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:32:36,666 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:36,666 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:36,666 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-20 10:32:36,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:36,666 INFO L85 PathProgramCache]: Analyzing trace with hash -721415730, now seen corresponding path program 1 times [2022-11-20 10:32:36,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:36,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939851116] [2022-11-20 10:32:36,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:36,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:36,777 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-20 10:32:36,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:36,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939851116] [2022-11-20 10:32:36,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939851116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:36,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:36,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:32:36,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671904950] [2022-11-20 10:32:36,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:36,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:32:36,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:36,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:32:36,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:32:36,791 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 303 [2022-11-20 10:32:36,795 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-20 10:32:36,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:36,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 303 [2022-11-20 10:32:36,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:37,044 INFO L130 PetriNetUnfolder]: 16/791 cut-off events. [2022-11-20 10:32:37,045 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-11-20 10:32:37,055 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-20 10:32:37,060 INFO L137 encePairwiseOnDemand]: 259/303 looper letters, 15 selfloop transitions, 8 changer transitions 0/266 dead transitions. [2022-11-20 10:32:37,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 266 transitions, 610 flow [2022-11-20 10:32:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:32:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 10:32:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2046 transitions. [2022-11-20 10:32:37,065 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.844059405940594 [2022-11-20 10:32:37,066 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2046 transitions. [2022-11-20 10:32:37,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2046 transitions. [2022-11-20 10:32:37,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:37,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2046 transitions. [2022-11-20 10:32:37,074 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-20 10:32:37,079 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-20 10:32:37,080 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-20 10:32:37,081 INFO L175 Difference]: Start difference. First operand has 265 places, 301 transitions, 620 flow. Second operand 8 states and 2046 transitions. [2022-11-20 10:32:37,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 266 transitions, 610 flow [2022-11-20 10:32:37,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 266 transitions, 610 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 10:32:37,086 INFO L231 Difference]: Finished difference. Result has 268 places, 262 transitions, 558 flow [2022-11-20 10:32:37,087 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-20 10:32:37,088 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 3 predicate places. [2022-11-20 10:32:37,088 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 262 transitions, 558 flow [2022-11-20 10:32:37,089 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-20 10:32:37,089 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:37,090 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-20 10:32:37,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:32:37,091 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-20 10:32:37,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:37,092 INFO L85 PathProgramCache]: Analyzing trace with hash -721425760, now seen corresponding path program 1 times [2022-11-20 10:32:37,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:37,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410055221] [2022-11-20 10:32:37,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:37,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:37,178 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-20 10:32:37,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:37,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410055221] [2022-11-20 10:32:37,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410055221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:37,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:37,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:32:37,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224710611] [2022-11-20 10:32:37,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:37,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:32:37,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:37,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:32:37,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:32:37,182 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 303 [2022-11-20 10:32:37,184 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-20 10:32:37,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:37,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 303 [2022-11-20 10:32:37,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:37,373 INFO L130 PetriNetUnfolder]: 16/790 cut-off events. [2022-11-20 10:32:37,373 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-11-20 10:32:37,380 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-20 10:32:37,384 INFO L137 encePairwiseOnDemand]: 298/303 looper letters, 13 selfloop transitions, 4 changer transitions 0/261 dead transitions. [2022-11-20 10:32:37,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 261 transitions, 590 flow [2022-11-20 10:32:37,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:32:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:32:37,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1248 transitions. [2022-11-20 10:32:37,388 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8237623762376237 [2022-11-20 10:32:37,388 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1248 transitions. [2022-11-20 10:32:37,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1248 transitions. [2022-11-20 10:32:37,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:37,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1248 transitions. [2022-11-20 10:32:37,393 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-20 10:32:37,396 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-20 10:32:37,397 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-20 10:32:37,397 INFO L175 Difference]: Start difference. First operand has 268 places, 262 transitions, 558 flow. Second operand 5 states and 1248 transitions. [2022-11-20 10:32:37,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 261 transitions, 590 flow [2022-11-20 10:32:37,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 261 transitions, 574 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-20 10:32:37,402 INFO L231 Difference]: Finished difference. Result has 264 places, 261 transitions, 548 flow [2022-11-20 10:32:37,403 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-20 10:32:37,403 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -1 predicate places. [2022-11-20 10:32:37,403 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 261 transitions, 548 flow [2022-11-20 10:32:37,404 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-20 10:32:37,404 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:37,404 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-20 10:32:37,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:32:37,405 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-20 10:32:37,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:37,405 INFO L85 PathProgramCache]: Analyzing trace with hash -889050421, now seen corresponding path program 1 times [2022-11-20 10:32:37,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:37,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093120551] [2022-11-20 10:32:37,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:37,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:37,505 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-20 10:32:37,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:37,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093120551] [2022-11-20 10:32:37,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093120551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:37,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:37,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:32:37,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060225830] [2022-11-20 10:32:37,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:37,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:32:37,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:37,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:32:37,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:32:37,512 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 303 [2022-11-20 10:32:37,514 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-20 10:32:37,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:37,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 303 [2022-11-20 10:32:37,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:37,727 INFO L130 PetriNetUnfolder]: 16/789 cut-off events. [2022-11-20 10:32:37,727 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-11-20 10:32:37,736 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-20 10:32:37,740 INFO L137 encePairwiseOnDemand]: 296/303 looper letters, 16 selfloop transitions, 6 changer transitions 0/264 dead transitions. [2022-11-20 10:32:37,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 264 transitions, 612 flow [2022-11-20 10:32:37,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:32:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 10:32:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1487 transitions. [2022-11-20 10:32:37,744 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.817931793179318 [2022-11-20 10:32:37,744 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1487 transitions. [2022-11-20 10:32:37,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1487 transitions. [2022-11-20 10:32:37,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:37,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1487 transitions. [2022-11-20 10:32:37,751 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-20 10:32:37,755 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-20 10:32:37,755 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-20 10:32:37,756 INFO L175 Difference]: Start difference. First operand has 264 places, 261 transitions, 548 flow. Second operand 6 states and 1487 transitions. [2022-11-20 10:32:37,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 264 transitions, 612 flow [2022-11-20 10:32:37,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 264 transitions, 604 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 10:32:37,761 INFO L231 Difference]: Finished difference. Result has 264 places, 260 transitions, 550 flow [2022-11-20 10:32:37,762 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-20 10:32:37,763 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -1 predicate places. [2022-11-20 10:32:37,763 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 260 transitions, 550 flow [2022-11-20 10:32:37,765 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-20 10:32:37,765 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:37,766 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-20 10:32:37,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:32:37,767 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-20 10:32:37,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:37,768 INFO L85 PathProgramCache]: Analyzing trace with hash -889361272, now seen corresponding path program 1 times [2022-11-20 10:32:37,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:37,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800207850] [2022-11-20 10:32:37,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:37,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:37,821 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-20 10:32:37,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:37,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800207850] [2022-11-20 10:32:37,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800207850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:37,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:37,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:32:37,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933343714] [2022-11-20 10:32:37,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:37,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:32:37,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:37,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:32:37,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:32:37,826 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 303 [2022-11-20 10:32:37,827 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-20 10:32:37,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:37,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 303 [2022-11-20 10:32:37,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:38,011 INFO L130 PetriNetUnfolder]: 16/788 cut-off events. [2022-11-20 10:32:38,012 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-11-20 10:32:38,020 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-20 10:32:38,024 INFO L137 encePairwiseOnDemand]: 299/303 looper letters, 17 selfloop transitions, 3 changer transitions 0/263 dead transitions. [2022-11-20 10:32:38,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 263 transitions, 610 flow [2022-11-20 10:32:38,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:32:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 10:32:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1005 transitions. [2022-11-20 10:32:38,027 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8292079207920792 [2022-11-20 10:32:38,027 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1005 transitions. [2022-11-20 10:32:38,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1005 transitions. [2022-11-20 10:32:38,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:38,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1005 transitions. [2022-11-20 10:32:38,030 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-20 10:32:38,032 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-20 10:32:38,033 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-20 10:32:38,033 INFO L175 Difference]: Start difference. First operand has 264 places, 260 transitions, 550 flow. Second operand 4 states and 1005 transitions. [2022-11-20 10:32:38,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 263 transitions, 610 flow [2022-11-20 10:32:38,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 263 transitions, 598 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 10:32:38,039 INFO L231 Difference]: Finished difference. Result has 261 places, 259 transitions, 542 flow [2022-11-20 10:32:38,039 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-20 10:32:38,040 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -4 predicate places. [2022-11-20 10:32:38,040 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 259 transitions, 542 flow [2022-11-20 10:32:38,040 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-20 10:32:38,040 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:38,041 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-20 10:32:38,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:32:38,041 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-20 10:32:38,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:38,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2028266641, now seen corresponding path program 1 times [2022-11-20 10:32:38,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:38,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340413199] [2022-11-20 10:32:38,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:38,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:38,106 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-20 10:32:38,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:38,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340413199] [2022-11-20 10:32:38,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340413199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:38,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:38,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:32:38,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935673664] [2022-11-20 10:32:38,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:38,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:32:38,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:38,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:32:38,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:32:38,109 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-20 10:32:38,110 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-20 10:32:38,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:38,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-20 10:32:38,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:38,307 INFO L130 PetriNetUnfolder]: 12/680 cut-off events. [2022-11-20 10:32:38,307 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-11-20 10:32:38,317 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-20 10:32:38,321 INFO L137 encePairwiseOnDemand]: 296/303 looper letters, 19 selfloop transitions, 4 changer transitions 0/266 dead transitions. [2022-11-20 10:32:38,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 266 transitions, 602 flow [2022-11-20 10:32:38,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:32:38,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:32:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1271 transitions. [2022-11-20 10:32:38,327 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.838943894389439 [2022-11-20 10:32:38,328 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1271 transitions. [2022-11-20 10:32:38,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1271 transitions. [2022-11-20 10:32:38,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:38,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1271 transitions. [2022-11-20 10:32:38,332 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-20 10:32:38,346 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-20 10:32:38,355 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-20 10:32:38,356 INFO L175 Difference]: Start difference. First operand has 261 places, 259 transitions, 542 flow. Second operand 5 states and 1271 transitions. [2022-11-20 10:32:38,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 266 transitions, 602 flow [2022-11-20 10:32:38,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 266 transitions, 596 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:32:38,362 INFO L231 Difference]: Finished difference. Result has 265 places, 262 transitions, 568 flow [2022-11-20 10:32:38,364 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-20 10:32:38,365 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 0 predicate places. [2022-11-20 10:32:38,365 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 262 transitions, 568 flow [2022-11-20 10:32:38,366 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-20 10:32:38,366 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:38,366 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-20 10:32:38,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:32:38,367 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-20 10:32:38,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:38,367 INFO L85 PathProgramCache]: Analyzing trace with hash -705965156, now seen corresponding path program 1 times [2022-11-20 10:32:38,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:38,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764151395] [2022-11-20 10:32:38,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:38,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:38,739 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-20 10:32:38,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:38,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764151395] [2022-11-20 10:32:38,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764151395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:38,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:38,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:32:38,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502582073] [2022-11-20 10:32:38,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:38,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:32:38,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:38,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:32:38,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:32:38,745 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 303 [2022-11-20 10:32:38,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 262 transitions, 568 flow. Second operand has 9 states, 9 states have (on average 205.22222222222223) internal successors, (1847), 9 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:38,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:38,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 303 [2022-11-20 10:32:38,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:40,904 INFO L130 PetriNetUnfolder]: 2427/9205 cut-off events. [2022-11-20 10:32:40,905 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2022-11-20 10:32:40,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13293 conditions, 9205 events. 2427/9205 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 105530 event pairs, 546 based on Foata normal form. 0/8408 useless extension candidates. Maximal degree in co-relation 13162. Up to 1836 conditions per place. [2022-11-20 10:32:40,994 INFO L137 encePairwiseOnDemand]: 288/303 looper letters, 185 selfloop transitions, 32 changer transitions 0/415 dead transitions. [2022-11-20 10:32:40,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 415 transitions, 1354 flow [2022-11-20 10:32:40,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:32:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-20 10:32:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3441 transitions. [2022-11-20 10:32:41,003 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7097772277227723 [2022-11-20 10:32:41,003 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3441 transitions. [2022-11-20 10:32:41,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3441 transitions. [2022-11-20 10:32:41,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:41,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3441 transitions. [2022-11-20 10:32:41,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 215.0625) internal successors, (3441), 16 states have internal predecessors, (3441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:41,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 303.0) internal successors, (5151), 17 states have internal predecessors, (5151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:41,026 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 303.0) internal successors, (5151), 17 states have internal predecessors, (5151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:41,027 INFO L175 Difference]: Start difference. First operand has 265 places, 262 transitions, 568 flow. Second operand 16 states and 3441 transitions. [2022-11-20 10:32:41,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 415 transitions, 1354 flow [2022-11-20 10:32:41,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 415 transitions, 1352 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:32:41,037 INFO L231 Difference]: Finished difference. Result has 289 places, 293 transitions, 803 flow [2022-11-20 10:32:41,038 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=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=803, PETRI_PLACES=289, PETRI_TRANSITIONS=293} [2022-11-20 10:32:41,039 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 24 predicate places. [2022-11-20 10:32:41,039 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 293 transitions, 803 flow [2022-11-20 10:32:41,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 205.22222222222223) internal successors, (1847), 9 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:41,040 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:41,040 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-20 10:32:41,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:32:41,041 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-20 10:32:41,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:41,041 INFO L85 PathProgramCache]: Analyzing trace with hash -398556098, now seen corresponding path program 1 times [2022-11-20 10:32:41,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:41,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595601124] [2022-11-20 10:32:41,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:41,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:41,116 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-20 10:32:41,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:41,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595601124] [2022-11-20 10:32:41,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595601124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:41,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:41,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:32:41,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994050254] [2022-11-20 10:32:41,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:41,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:32:41,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:41,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:32:41,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:32:41,120 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-20 10:32:41,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 293 transitions, 803 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-20 10:32:41,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:41,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-20 10:32:41,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:41,400 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: 320#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 328#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 319#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 340#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5)), Black: 330#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, t_funThread2of2ForFork0NotInUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 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: 326#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 338#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 334#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5)), 358#true, Black: 332#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0))]) [2022-11-20 10:32:41,400 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-20 10:32:41,400 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-20 10:32:41,401 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-20 10:32:41,401 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-20 10:32:41,473 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: 320#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 328#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 319#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 340#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5)), Black: 330#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 16#t_funENTRYtrue, t_funThread1of2ForFork0NotInUse, t_funThread2of2ForFork0InUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 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: 326#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 338#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 334#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5)), 358#true, Black: 332#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0))]) [2022-11-20 10:32:41,473 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-20 10:32:41,473 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-20 10:32:41,474 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-20 10:32:41,474 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-20 10:32:41,520 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: 320#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 328#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 340#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5)), 319#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 330#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, t_funThread2of2ForFork0NotInUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 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: 326#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 338#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 334#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5)), 358#true, Black: 332#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0))]) [2022-11-20 10:32:41,521 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-20 10:32:41,521 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-20 10:32:41,521 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:32:41,521 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-20 10:32:41,534 INFO L381 tUnfolder$Statistics]: inserting event number 5 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: 320#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 328#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 340#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5)), 319#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 330#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, t_funThread2of2ForFork0NotInUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 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: 326#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 338#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 334#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5)), 358#true, Black: 332#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0))]) [2022-11-20 10:32:41,535 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-20 10:32:41,535 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-20 10:32:41,535 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-20 10:32:41,535 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 10:32:41,535 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 10:32:41,536 INFO L130 PetriNetUnfolder]: 132/1589 cut-off events. [2022-11-20 10:32:41,536 INFO L131 PetriNetUnfolder]: For 756/978 co-relation queries the response was YES. [2022-11-20 10:32:41,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 1589 events. 132/1589 cut-off events. For 756/978 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 12095 event pairs, 31 based on Foata normal form. 21/1443 useless extension candidates. Maximal degree in co-relation 2175. Up to 139 conditions per place. [2022-11-20 10:32:41,562 INFO L137 encePairwiseOnDemand]: 297/303 looper letters, 11 selfloop transitions, 8 changer transitions 0/293 dead transitions. [2022-11-20 10:32:41,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 293 transitions, 839 flow [2022-11-20 10:32:41,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:32:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:32:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1262 transitions. [2022-11-20 10:32:41,566 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.833003300330033 [2022-11-20 10:32:41,566 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1262 transitions. [2022-11-20 10:32:41,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1262 transitions. [2022-11-20 10:32:41,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:41,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1262 transitions. [2022-11-20 10:32:41,570 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-20 10:32:41,573 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-20 10:32:41,573 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-20 10:32:41,574 INFO L175 Difference]: Start difference. First operand has 289 places, 293 transitions, 803 flow. Second operand 5 states and 1262 transitions. [2022-11-20 10:32:41,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 293 transitions, 839 flow [2022-11-20 10:32:41,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 293 transitions, 838 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:32:41,583 INFO L231 Difference]: Finished difference. Result has 292 places, 293 transitions, 822 flow [2022-11-20 10:32:41,584 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-20 10:32:41,585 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 27 predicate places. [2022-11-20 10:32:41,585 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 293 transitions, 822 flow [2022-11-20 10:32:41,585 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-20 10:32:41,585 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:41,586 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-20 10:32:41,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:32:41,586 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-20 10:32:41,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:41,587 INFO L85 PathProgramCache]: Analyzing trace with hash 529663684, now seen corresponding path program 1 times [2022-11-20 10:32:41,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:41,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227069343] [2022-11-20 10:32:41,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:41,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:41,760 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-20 10:32:41,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:41,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227069343] [2022-11-20 10:32:41,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227069343] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:41,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682813479] [2022-11-20 10:32:41,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:41,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:41,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:41,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:32:41,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:32:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:41,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:32:41,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:32:42,029 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-20 10:32:42,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:32:42,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682813479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:42,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:32:42,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 10:32:42,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798968523] [2022-11-20 10:32:42,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:42,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:32:42,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:42,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:32:42,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:32:42,034 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-20 10:32:42,036 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-20 10:32:42,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:42,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-20 10:32:42,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:42,347 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: 320#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 328#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 340#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5)), 319#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 330#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, 584#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), t_funThread2of2ForFork0NotInUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 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: 326#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 338#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 334#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5)), Black: 332#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 358#true]) [2022-11-20 10:32:42,347 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-20 10:32:42,348 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-20 10:32:42,348 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-20 10:32:42,348 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-20 10:32:42,433 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: 320#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 328#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 340#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5)), 319#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 330#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 16#t_funENTRYtrue, t_funThread1of2ForFork0NotInUse, 584#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), t_funThread2of2ForFork0InUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 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: 326#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 338#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 334#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5)), Black: 332#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 358#true]) [2022-11-20 10:32:42,433 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-20 10:32:42,433 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-20 10:32:42,433 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-20 10:32:42,434 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-20 10:32:42,494 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: 320#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 328#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 340#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5)), 319#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 330#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, 584#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), t_funThread2of2ForFork0NotInUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 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: 326#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 338#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 334#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5)), Black: 332#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 358#true]) [2022-11-20 10:32:42,495 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-20 10:32:42,495 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-20 10:32:42,495 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:32:42,495 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-20 10:32:42,511 INFO L381 tUnfolder$Statistics]: inserting event number 5 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: 320#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 328#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 340#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5)), 319#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 330#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, 584#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), t_funThread2of2ForFork0NotInUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 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: 326#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 338#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 334#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5)), 358#true, Black: 332#(and (= 1 (select |#valid| 5)) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of2ForFork0_#t~mem6#1| 0))]) [2022-11-20 10:32:42,511 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-20 10:32:42,512 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-20 10:32:42,512 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-20 10:32:42,512 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 10:32:42,512 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 10:32:42,513 INFO L130 PetriNetUnfolder]: 132/1588 cut-off events. [2022-11-20 10:32:42,514 INFO L131 PetriNetUnfolder]: For 763/975 co-relation queries the response was YES. [2022-11-20 10:32:42,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2404 conditions, 1588 events. 132/1588 cut-off events. For 763/975 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 12198 event pairs, 31 based on Foata normal form. 9/1430 useless extension candidates. Maximal degree in co-relation 2185. Up to 139 conditions per place. [2022-11-20 10:32:42,542 INFO L137 encePairwiseOnDemand]: 299/303 looper letters, 13 selfloop transitions, 5 changer transitions 0/292 dead transitions. [2022-11-20 10:32:42,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 292 transitions, 854 flow [2022-11-20 10:32:42,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:32:42,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 10:32:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1011 transitions. [2022-11-20 10:32:42,546 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8341584158415841 [2022-11-20 10:32:42,546 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1011 transitions. [2022-11-20 10:32:42,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1011 transitions. [2022-11-20 10:32:42,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:42,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1011 transitions. [2022-11-20 10:32:42,550 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-20 10:32:42,553 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-20 10:32:42,554 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-20 10:32:42,554 INFO L175 Difference]: Start difference. First operand has 292 places, 293 transitions, 822 flow. Second operand 4 states and 1011 transitions. [2022-11-20 10:32:42,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 292 transitions, 854 flow [2022-11-20 10:32:42,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 292 transitions, 842 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:32:42,566 INFO L231 Difference]: Finished difference. Result has 291 places, 292 transitions, 816 flow [2022-11-20 10:32:42,567 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-20 10:32:42,568 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 26 predicate places. [2022-11-20 10:32:42,568 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 292 transitions, 816 flow [2022-11-20 10:32:42,569 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-20 10:32:42,569 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:42,569 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-20 10:32:42,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:32:42,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 10:32:42,776 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-20 10:32:42,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:42,776 INFO L85 PathProgramCache]: Analyzing trace with hash 471904340, now seen corresponding path program 1 times [2022-11-20 10:32:42,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:42,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108164600] [2022-11-20 10:32:42,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:42,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:42,900 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-20 10:32:42,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:42,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108164600] [2022-11-20 10:32:42,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108164600] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:42,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989772314] [2022-11-20 10:32:42,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:42,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:42,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:42,902 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:32:42,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:32:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:43,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:32:43,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:32:43,107 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-20 10:32:43,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:32:43,178 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-20 10:32:43,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989772314] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:32:43,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:32:43,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 10:32:43,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009964347] [2022-11-20 10:32:43,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:32:43,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:32:43,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:43,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:32:43,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:32:43,188 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-20 10:32:43,191 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-20 10:32:43,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:43,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-20 10:32:43,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:43,336 INFO L130 PetriNetUnfolder]: 3/307 cut-off events. [2022-11-20 10:32:43,336 INFO L131 PetriNetUnfolder]: For 66/70 co-relation queries the response was YES. [2022-11-20 10:32:43,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 307 events. 3/307 cut-off events. For 66/70 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 806 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-20 10:32:43,339 INFO L137 encePairwiseOnDemand]: 298/303 looper letters, 13 selfloop transitions, 7 changer transitions 0/204 dead transitions. [2022-11-20 10:32:43,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 204 transitions, 588 flow [2022-11-20 10:32:43,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:32:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 10:32:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2263 transitions. [2022-11-20 10:32:43,346 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8298496516318299 [2022-11-20 10:32:43,346 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2263 transitions. [2022-11-20 10:32:43,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2263 transitions. [2022-11-20 10:32:43,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:43,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2263 transitions. [2022-11-20 10:32:43,352 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-20 10:32:43,357 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-20 10:32:43,358 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-20 10:32:43,358 INFO L175 Difference]: Start difference. First operand has 291 places, 292 transitions, 816 flow. Second operand 9 states and 2263 transitions. [2022-11-20 10:32:43,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 204 transitions, 588 flow [2022-11-20 10:32:43,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 204 transitions, 548 flow, removed 12 selfloop flow, removed 10 redundant places. [2022-11-20 10:32:43,363 INFO L231 Difference]: Finished difference. Result has 216 places, 199 transitions, 510 flow [2022-11-20 10:32:43,364 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-20 10:32:43,365 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -49 predicate places. [2022-11-20 10:32:43,365 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 199 transitions, 510 flow [2022-11-20 10:32:43,366 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-20 10:32:43,366 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:43,366 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-20 10:32:43,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:32:43,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 10:32:43,572 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-20 10:32:43,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:43,573 INFO L85 PathProgramCache]: Analyzing trace with hash -310183793, now seen corresponding path program 1 times [2022-11-20 10:32:43,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:43,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258728953] [2022-11-20 10:32:43,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:43,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:43,785 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-20 10:32:43,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:43,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258728953] [2022-11-20 10:32:43,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258728953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:43,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:43,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:32:43,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647122413] [2022-11-20 10:32:43,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:43,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:32:43,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:43,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:32:43,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:32:43,789 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 303 [2022-11-20 10:32:43,790 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-20 10:32:43,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:43,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 303 [2022-11-20 10:32:43,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:44,500 INFO L130 PetriNetUnfolder]: 632/2835 cut-off events. [2022-11-20 10:32:44,500 INFO L131 PetriNetUnfolder]: For 608/629 co-relation queries the response was YES. [2022-11-20 10:32:44,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4657 conditions, 2835 events. 632/2835 cut-off events. For 608/629 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 25811 event pairs, 203 based on Foata normal form. 19/2591 useless extension candidates. Maximal degree in co-relation 2317. Up to 475 conditions per place. [2022-11-20 10:32:44,532 INFO L137 encePairwiseOnDemand]: 289/303 looper letters, 109 selfloop transitions, 32 changer transitions 0/280 dead transitions. [2022-11-20 10:32:44,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 280 transitions, 1062 flow [2022-11-20 10:32:44,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:32:44,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 10:32:44,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2388 transitions. [2022-11-20 10:32:44,541 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7164716471647165 [2022-11-20 10:32:44,541 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2388 transitions. [2022-11-20 10:32:44,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2388 transitions. [2022-11-20 10:32:44,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:44,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2388 transitions. [2022-11-20 10:32:44,549 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-20 10:32:44,557 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-20 10:32:44,559 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-20 10:32:44,559 INFO L175 Difference]: Start difference. First operand has 216 places, 199 transitions, 510 flow. Second operand 11 states and 2388 transitions. [2022-11-20 10:32:44,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 280 transitions, 1062 flow [2022-11-20 10:32:44,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 280 transitions, 1039 flow, removed 3 selfloop flow, removed 8 redundant places. [2022-11-20 10:32:44,571 INFO L231 Difference]: Finished difference. Result has 225 places, 225 transitions, 730 flow [2022-11-20 10:32:44,572 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-20 10:32:44,572 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -40 predicate places. [2022-11-20 10:32:44,572 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 730 flow [2022-11-20 10:32:44,573 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-20 10:32:44,573 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:44,574 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-20 10:32:44,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 10:32:44,574 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-20 10:32:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:44,575 INFO L85 PathProgramCache]: Analyzing trace with hash 766382659, now seen corresponding path program 1 times [2022-11-20 10:32:44,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:44,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906895975] [2022-11-20 10:32:44,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:44,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:32:44,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:32:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:32:44,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:32:44,657 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:32:44,658 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2022-11-20 10:32:44,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2022-11-20 10:32:44,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2022-11-20 10:32:44,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2022-11-20 10:32:44,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2022-11-20 10:32:44,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2022-11-20 10:32:44,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2022-11-20 10:32:44,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2022-11-20 10:32:44,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2022-11-20 10:32:44,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2022-11-20 10:32:44,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2022-11-20 10:32:44,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2022-11-20 10:32:44,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2022-11-20 10:32:44,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2022-11-20 10:32:44,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 25 remaining) [2022-11-20 10:32:44,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2022-11-20 10:32:44,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2022-11-20 10:32:44,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2022-11-20 10:32:44,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2022-11-20 10:32:44,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2022-11-20 10:32:44,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2022-11-20 10:32:44,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2022-11-20 10:32:44,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2022-11-20 10:32:44,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2022-11-20 10:32:44,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2022-11-20 10:32:44,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 10:32:44,665 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:44,666 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-20 10:32:44,666 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-20 10:32:44,708 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 10:32:44,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 370 transitions, 770 flow [2022-11-20 10:32:44,855 INFO L130 PetriNetUnfolder]: 106/722 cut-off events. [2022-11-20 10:32:44,856 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-20 10:32:44,868 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-20 10:32:44,868 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 370 transitions, 770 flow [2022-11-20 10:32:44,877 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 321 places, 368 transitions, 766 flow [2022-11-20 10:32:44,878 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:32:44,878 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;@29e5adf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:32:44,878 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-11-20 10:32:44,882 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-11-20 10:32:44,882 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:32:44,883 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:44,883 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-20 10:32:44,883 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-20 10:32:44,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:44,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1563167666, now seen corresponding path program 1 times [2022-11-20 10:32:44,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:44,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447732992] [2022-11-20 10:32:44,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:44,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:44,956 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-20 10:32:44,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:44,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447732992] [2022-11-20 10:32:44,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447732992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:44,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:44,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:32:44,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382121284] [2022-11-20 10:32:44,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:44,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:32:44,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:44,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:32:44,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:32:44,960 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 370 [2022-11-20 10:32:44,962 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-20 10:32:44,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:44,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 370 [2022-11-20 10:32:44,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:45,310 INFO L130 PetriNetUnfolder]: 30/1181 cut-off events. [2022-11-20 10:32:45,311 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-11-20 10:32:45,330 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-20 10:32:45,336 INFO L137 encePairwiseOnDemand]: 315/370 looper letters, 19 selfloop transitions, 8 changer transitions 0/323 dead transitions. [2022-11-20 10:32:45,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 323 transitions, 754 flow [2022-11-20 10:32:45,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:32:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 10:32:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2496 transitions. [2022-11-20 10:32:45,342 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8432432432432433 [2022-11-20 10:32:45,343 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2496 transitions. [2022-11-20 10:32:45,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2496 transitions. [2022-11-20 10:32:45,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:45,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2496 transitions. [2022-11-20 10:32:45,353 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-20 10:32:45,359 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-20 10:32:45,360 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-20 10:32:45,360 INFO L175 Difference]: Start difference. First operand has 321 places, 368 transitions, 766 flow. Second operand 8 states and 2496 transitions. [2022-11-20 10:32:45,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 323 transitions, 754 flow [2022-11-20 10:32:45,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 323 transitions, 754 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 10:32:45,366 INFO L231 Difference]: Finished difference. Result has 323 places, 317 transitions, 680 flow [2022-11-20 10:32:45,367 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-20 10:32:45,367 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 2 predicate places. [2022-11-20 10:32:45,367 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 317 transitions, 680 flow [2022-11-20 10:32:45,368 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-20 10:32:45,368 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:45,368 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-20 10:32:45,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 10:32:45,369 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-20 10:32:45,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:45,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1563177696, now seen corresponding path program 1 times [2022-11-20 10:32:45,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:45,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080824322] [2022-11-20 10:32:45,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:45,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:45,411 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-20 10:32:45,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:45,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080824322] [2022-11-20 10:32:45,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080824322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:45,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:45,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:32:45,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140280886] [2022-11-20 10:32:45,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:45,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:32:45,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:45,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:32:45,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:32:45,415 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 370 [2022-11-20 10:32:45,416 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-20 10:32:45,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:45,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 370 [2022-11-20 10:32:45,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:45,718 INFO L130 PetriNetUnfolder]: 30/1180 cut-off events. [2022-11-20 10:32:45,719 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-11-20 10:32:45,737 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-20 10:32:45,743 INFO L137 encePairwiseOnDemand]: 365/370 looper letters, 15 selfloop transitions, 4 changer transitions 0/316 dead transitions. [2022-11-20 10:32:45,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 316 transitions, 716 flow [2022-11-20 10:32:45,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:32:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:32:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1515 transitions. [2022-11-20 10:32:45,746 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8189189189189189 [2022-11-20 10:32:45,747 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1515 transitions. [2022-11-20 10:32:45,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1515 transitions. [2022-11-20 10:32:45,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:45,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1515 transitions. [2022-11-20 10:32:45,751 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-20 10:32:45,754 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-20 10:32:45,756 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-20 10:32:45,756 INFO L175 Difference]: Start difference. First operand has 323 places, 317 transitions, 680 flow. Second operand 5 states and 1515 transitions. [2022-11-20 10:32:45,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 316 transitions, 716 flow [2022-11-20 10:32:45,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 316 transitions, 700 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-20 10:32:45,762 INFO L231 Difference]: Finished difference. Result has 319 places, 316 transitions, 670 flow [2022-11-20 10:32:45,763 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-20 10:32:45,764 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -2 predicate places. [2022-11-20 10:32:45,764 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 316 transitions, 670 flow [2022-11-20 10:32:45,764 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-20 10:32:45,765 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:45,765 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-20 10:32:45,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 10:32:45,765 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-20 10:32:45,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:45,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1213556291, now seen corresponding path program 1 times [2022-11-20 10:32:45,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:45,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513713830] [2022-11-20 10:32:45,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:45,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:32:45,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:45,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513713830] [2022-11-20 10:32:45,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513713830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:45,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:45,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:32:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641710291] [2022-11-20 10:32:45,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:45,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:32:45,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:45,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:32:45,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:32:45,834 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 370 [2022-11-20 10:32:45,835 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-20 10:32:45,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:45,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 370 [2022-11-20 10:32:45,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:46,148 INFO L130 PetriNetUnfolder]: 30/1179 cut-off events. [2022-11-20 10:32:46,148 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-11-20 10:32:46,169 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-20 10:32:46,175 INFO L137 encePairwiseOnDemand]: 363/370 looper letters, 20 selfloop transitions, 6 changer transitions 0/321 dead transitions. [2022-11-20 10:32:46,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 321 transitions, 756 flow [2022-11-20 10:32:46,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:32:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 10:32:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1809 transitions. [2022-11-20 10:32:46,178 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8148648648648649 [2022-11-20 10:32:46,178 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1809 transitions. [2022-11-20 10:32:46,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1809 transitions. [2022-11-20 10:32:46,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:46,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1809 transitions. [2022-11-20 10:32:46,182 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-20 10:32:46,185 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-20 10:32:46,186 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-20 10:32:46,186 INFO L175 Difference]: Start difference. First operand has 319 places, 316 transitions, 670 flow. Second operand 6 states and 1809 transitions. [2022-11-20 10:32:46,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 321 transitions, 756 flow [2022-11-20 10:32:46,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 321 transitions, 748 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 10:32:46,192 INFO L231 Difference]: Finished difference. Result has 319 places, 315 transitions, 672 flow [2022-11-20 10:32:46,193 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-20 10:32:46,193 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -2 predicate places. [2022-11-20 10:32:46,193 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 315 transitions, 672 flow [2022-11-20 10:32:46,194 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-20 10:32:46,194 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:46,194 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-20 10:32:46,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 10:32:46,195 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-20 10:32:46,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:46,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1213867142, now seen corresponding path program 1 times [2022-11-20 10:32:46,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:46,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070917040] [2022-11-20 10:32:46,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:46,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,235 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-20 10:32:46,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:46,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070917040] [2022-11-20 10:32:46,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070917040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:46,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:46,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:32:46,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60906647] [2022-11-20 10:32:46,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:46,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:32:46,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:46,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:32:46,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:32:46,238 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 370 [2022-11-20 10:32:46,240 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-20 10:32:46,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:46,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 370 [2022-11-20 10:32:46,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:46,552 INFO L130 PetriNetUnfolder]: 30/1178 cut-off events. [2022-11-20 10:32:46,552 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2022-11-20 10:32:46,572 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-20 10:32:46,579 INFO L137 encePairwiseOnDemand]: 366/370 looper letters, 21 selfloop transitions, 3 changer transitions 0/320 dead transitions. [2022-11-20 10:32:46,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 320 transitions, 754 flow [2022-11-20 10:32:46,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:32:46,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 10:32:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1221 transitions. [2022-11-20 10:32:46,582 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825 [2022-11-20 10:32:46,582 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1221 transitions. [2022-11-20 10:32:46,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1221 transitions. [2022-11-20 10:32:46,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:46,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1221 transitions. [2022-11-20 10:32:46,585 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-20 10:32:46,587 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-20 10:32:46,588 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-20 10:32:46,588 INFO L175 Difference]: Start difference. First operand has 319 places, 315 transitions, 672 flow. Second operand 4 states and 1221 transitions. [2022-11-20 10:32:46,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 320 transitions, 754 flow [2022-11-20 10:32:46,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 320 transitions, 742 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 10:32:46,595 INFO L231 Difference]: Finished difference. Result has 316 places, 314 transitions, 664 flow [2022-11-20 10:32:46,596 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-20 10:32:46,597 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -5 predicate places. [2022-11-20 10:32:46,597 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 314 transitions, 664 flow [2022-11-20 10:32:46,598 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-20 10:32:46,598 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:46,598 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-20 10:32:46,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 10:32:46,598 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-20 10:32:46,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:46,599 INFO L85 PathProgramCache]: Analyzing trace with hash -387906227, now seen corresponding path program 1 times [2022-11-20 10:32:46,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:46,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039525574] [2022-11-20 10:32:46,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:46,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,710 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-20 10:32:46,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:46,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039525574] [2022-11-20 10:32:46,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039525574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:46,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:46,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:32:46,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382410964] [2022-11-20 10:32:46,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:46,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:32:46,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:46,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:32:46,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:32:46,715 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-20 10:32:46,717 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-20 10:32:46,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:46,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-20 10:32:46,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:47,100 INFO L130 PetriNetUnfolder]: 26/1070 cut-off events. [2022-11-20 10:32:47,100 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2022-11-20 10:32:47,120 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-20 10:32:47,126 INFO L137 encePairwiseOnDemand]: 363/370 looper letters, 21 selfloop transitions, 4 changer transitions 0/321 dead transitions. [2022-11-20 10:32:47,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 321 transitions, 728 flow [2022-11-20 10:32:47,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:32:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:32:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1538 transitions. [2022-11-20 10:32:47,131 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8313513513513513 [2022-11-20 10:32:47,131 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1538 transitions. [2022-11-20 10:32:47,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1538 transitions. [2022-11-20 10:32:47,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:47,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1538 transitions. [2022-11-20 10:32:47,138 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-20 10:32:47,143 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-20 10:32:47,144 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-20 10:32:47,144 INFO L175 Difference]: Start difference. First operand has 316 places, 314 transitions, 664 flow. Second operand 5 states and 1538 transitions. [2022-11-20 10:32:47,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 321 transitions, 728 flow [2022-11-20 10:32:47,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 321 transitions, 722 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:32:47,151 INFO L231 Difference]: Finished difference. Result has 320 places, 317 transitions, 690 flow [2022-11-20 10:32:47,152 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-20 10:32:47,152 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -1 predicate places. [2022-11-20 10:32:47,152 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 317 transitions, 690 flow [2022-11-20 10:32:47,153 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-20 10:32:47,153 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:47,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] [2022-11-20 10:32:47,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 10:32:47,154 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-20 10:32:47,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:47,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2106409688, now seen corresponding path program 1 times [2022-11-20 10:32:47,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:47,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324672109] [2022-11-20 10:32:47,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:47,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:47,451 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-20 10:32:47,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:47,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324672109] [2022-11-20 10:32:47,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324672109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:47,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:47,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:32:47,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417635116] [2022-11-20 10:32:47,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:47,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:32:47,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:47,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:32:47,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:32:47,457 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 370 [2022-11-20 10:32:47,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 317 transitions, 690 flow. Second operand has 9 states, 9 states have (on average 253.33333333333334) internal successors, (2280), 9 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:47,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:47,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 370 [2022-11-20 10:32:47,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:33:01,560 INFO L130 PetriNetUnfolder]: 25022/75736 cut-off events. [2022-11-20 10:33:01,560 INFO L131 PetriNetUnfolder]: For 2578/2578 co-relation queries the response was YES. [2022-11-20 10:33:02,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112382 conditions, 75736 events. 25022/75736 cut-off events. For 2578/2578 co-relation queries the response was YES. Maximal size of possible extension queue 2996. Compared 1091363 event pairs, 5957 based on Foata normal form. 0/69776 useless extension candidates. Maximal degree in co-relation 112250. Up to 18069 conditions per place. [2022-11-20 10:33:02,632 INFO L137 encePairwiseOnDemand]: 354/370 looper letters, 251 selfloop transitions, 38 changer transitions 0/535 dead transitions. [2022-11-20 10:33:02,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 535 transitions, 1810 flow [2022-11-20 10:33:02,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:33:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-20 10:33:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4281 transitions. [2022-11-20 10:33:02,643 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7231418918918919 [2022-11-20 10:33:02,643 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4281 transitions. [2022-11-20 10:33:02,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4281 transitions. [2022-11-20 10:33:02,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:33:02,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4281 transitions. [2022-11-20 10:33:02,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 267.5625) internal successors, (4281), 16 states have internal predecessors, (4281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:33:02,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 370.0) internal successors, (6290), 17 states have internal predecessors, (6290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:33:02,664 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 370.0) internal successors, (6290), 17 states have internal predecessors, (6290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:33:02,664 INFO L175 Difference]: Start difference. First operand has 320 places, 317 transitions, 690 flow. Second operand 16 states and 4281 transitions. [2022-11-20 10:33:02,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 535 transitions, 1810 flow [2022-11-20 10:33:02,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 535 transitions, 1808 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:33:02,677 INFO L231 Difference]: Finished difference. Result has 344 places, 354 transitions, 969 flow [2022-11-20 10:33:02,678 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=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=969, PETRI_PLACES=344, PETRI_TRANSITIONS=354} [2022-11-20 10:33:02,679 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 23 predicate places. [2022-11-20 10:33:02,679 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 354 transitions, 969 flow [2022-11-20 10:33:02,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 253.33333333333334) internal successors, (2280), 9 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:33:02,680 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:33:02,680 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-20 10:33:02,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 10:33:02,681 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-20 10:33:02,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:02,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1647179717, now seen corresponding path program 1 times [2022-11-20 10:33:02,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:02,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26707761] [2022-11-20 10:33:02,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:02,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:02,743 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-20 10:33:02,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:02,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26707761] [2022-11-20 10:33:02,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26707761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:33:02,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:33:02,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:33:02,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124163499] [2022-11-20 10:33:02,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:02,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:33:02,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:02,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:33:02,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:33:02,747 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-20 10:33:02,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 354 transitions, 969 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-20 10:33:02,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:33:02,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-20 10:33:02,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:33:03,288 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, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:03,288 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-20 10:33:03,288 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-20 10:33:03,289 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-20 10:33:03,289 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-20 10:33:03,463 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, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:03,464 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-20 10:33:03,464 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-20 10:33:03,464 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-20 10:33:03,464 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-20 10:33:03,636 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, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:03,636 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is not cut-off event [2022-11-20 10:33:03,636 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-20 10:33:03,636 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-20 10:33:03,636 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-20 10:33:03,739 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, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:03,739 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-20 10:33:03,739 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-20 10:33:03,739 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:33:03,740 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-20 10:33:03,840 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, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:03,840 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-20 10:33:03,840 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:33:03,840 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:33:03,840 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-20 10:33:03,845 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_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 83#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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:03,845 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-20 10:33:03,846 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:33:03,846 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:33:03,846 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-20 10:33:03,991 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, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 49#t_funENTRYtrue, Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0InUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:03,991 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-20 10:33:03,991 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 10:33:03,991 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-20 10:33:03,991 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 10:33:03,993 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, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:03,994 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-20 10:33:03,994 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 10:33:03,994 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-20 10:33:03,994 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-20 10:33:03,994 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 10:33:04,061 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_funThread3of3ForFork0InUse, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:04,062 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-20 10:33:04,062 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-20 10:33:04,062 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-20 10:33:04,062 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-20 10:33:04,076 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, 298#L1013-6true, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 392#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5)), t_funThread1of3ForFork0InUse]) [2022-11-20 10:33:04,076 INFO L383 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-11-20 10:33:04,076 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-20 10:33:04,076 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-20 10:33:04,077 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-20 10:33:04,085 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, 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), Black: 400#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse, 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0))]) [2022-11-20 10:33:04,085 INFO L383 tUnfolder$Statistics]: this new event has 207 ancestors and is cut-off event [2022-11-20 10:33:04,086 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-20 10:33:04,086 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-20 10:33:04,086 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-20 10:33:04,096 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, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:04,096 INFO L383 tUnfolder$Statistics]: this new event has 208 ancestors and is cut-off event [2022-11-20 10:33:04,096 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:33:04,096 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:33:04,097 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-20 10:33:04,097 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-20 10:33:04,099 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_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 83#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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:04,099 INFO L383 tUnfolder$Statistics]: this new event has 208 ancestors and is cut-off event [2022-11-20 10:33:04,099 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 10:33:04,099 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 10:33:04,100 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-20 10:33:04,100 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-20 10:33:04,110 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), Black: 400#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse, 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0))]) [2022-11-20 10:33:04,110 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-20 10:33:04,111 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:04,111 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 10:33:04,111 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:04,114 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_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 165#L1013-10true, Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:04,114 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-20 10:33:04,114 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:04,114 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 10:33:04,114 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:04,166 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), Black: 400#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse, 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0))]) [2022-11-20 10:33:04,166 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-20 10:33:04,166 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-20 10:33:04,167 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-20 10:33:04,167 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-20 10:33:04,167 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, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 165#L1013-10true, Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:04,167 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-20 10:33:04,167 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-20 10:33:04,168 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:04,168 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 10:33:04,169 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_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 165#L1013-10true, Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:04,170 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-20 10:33:04,170 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-20 10:33:04,170 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:04,170 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 10:33:04,170 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-20 10:33:04,178 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, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:04,178 INFO L383 tUnfolder$Statistics]: this new event has 227 ancestors and is cut-off event [2022-11-20 10:33:04,178 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-20 10:33:04,178 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-20 10:33:04,179 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-20 10:33:04,182 INFO L130 PetriNetUnfolder]: 573/5045 cut-off events. [2022-11-20 10:33:04,182 INFO L131 PetriNetUnfolder]: For 3183/4289 co-relation queries the response was YES. [2022-11-20 10:33:04,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8196 conditions, 5045 events. 573/5045 cut-off events. For 3183/4289 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 51452 event pairs, 154 based on Foata normal form. 52/4498 useless extension candidates. Maximal degree in co-relation 7460. Up to 573 conditions per place. [2022-11-20 10:33:04,269 INFO L137 encePairwiseOnDemand]: 364/370 looper letters, 13 selfloop transitions, 8 changer transitions 0/354 dead transitions. [2022-11-20 10:33:04,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 354 transitions, 1009 flow [2022-11-20 10:33:04,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:33:04,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:33:04,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1529 transitions. [2022-11-20 10:33:04,274 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8264864864864865 [2022-11-20 10:33:04,274 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1529 transitions. [2022-11-20 10:33:04,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1529 transitions. [2022-11-20 10:33:04,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:33:04,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1529 transitions. [2022-11-20 10:33:04,279 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-20 10:33:04,282 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-20 10:33:04,283 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-20 10:33:04,283 INFO L175 Difference]: Start difference. First operand has 344 places, 354 transitions, 969 flow. Second operand 5 states and 1529 transitions. [2022-11-20 10:33:04,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 354 transitions, 1009 flow [2022-11-20 10:33:04,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 354 transitions, 1008 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:33:04,303 INFO L231 Difference]: Finished difference. Result has 347 places, 354 transitions, 988 flow [2022-11-20 10:33:04,304 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-20 10:33:04,305 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 26 predicate places. [2022-11-20 10:33:04,305 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 354 transitions, 988 flow [2022-11-20 10:33:04,306 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-20 10:33:04,306 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:33:04,306 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-20 10:33:04,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 10:33:04,307 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-20 10:33:04,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:04,307 INFO L85 PathProgramCache]: Analyzing trace with hash 477037529, now seen corresponding path program 1 times [2022-11-20 10:33:04,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:04,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166405255] [2022-11-20 10:33:04,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:04,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:04,451 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-20 10:33:04,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:04,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166405255] [2022-11-20 10:33:04,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166405255] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:04,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347413285] [2022-11-20 10:33:04,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:04,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:04,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:33:04,454 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:33:04,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:33:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:04,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:33:04,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:33:04,636 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-20 10:33:04,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:33:04,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347413285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:33:04,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:33:04,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 10:33:04,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753342240] [2022-11-20 10:33:04,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:04,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:33:04,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:04,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:33:04,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:33:04,641 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-20 10:33:04,643 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-20 10:33:04,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:33:04,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-20 10:33:04,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:33:05,051 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, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:05,051 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-20 10:33:05,052 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-20 10:33:05,052 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-20 10:33:05,052 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-20 10:33:05,253 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, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:05,254 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-20 10:33:05,254 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-20 10:33:05,254 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-20 10:33:05,254 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-20 10:33:05,512 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, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:05,512 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is not cut-off event [2022-11-20 10:33:05,513 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-20 10:33:05,513 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-20 10:33:05,513 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-20 10:33:05,667 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, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:05,667 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-20 10:33:05,668 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:33:05,668 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-20 10:33:05,668 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-20 10:33:05,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_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:05,970 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-20 10:33:05,970 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-20 10:33:05,970 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:33:05,970 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:33:05,975 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_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 83#t_funENTRYtrue, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:05,975 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-20 10:33:05,975 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:33:05,975 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:33:05,976 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-20 10:33:05,979 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, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 49#t_funENTRYtrue, Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0InUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:05,979 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-20 10:33:05,979 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 10:33:05,979 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-20 10:33:05,979 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 10:33:05,981 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, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:05,981 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-20 10:33:05,981 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 10:33:05,981 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 10:33:05,981 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-20 10:33:05,981 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-20 10:33:06,035 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_funThread3of3ForFork0InUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:06,035 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-20 10:33:06,036 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-20 10:33:06,036 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-20 10:33:06,036 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-20 10:33:06,046 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, 298#L1013-6true, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 392#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5)), t_funThread1of3ForFork0InUse]) [2022-11-20 10:33:06,046 INFO L383 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-11-20 10:33:06,046 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-20 10:33:06,046 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-20 10:33:06,047 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-20 10:33:06,051 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, 162#L1013-7true, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse, 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0))]) [2022-11-20 10:33:06,051 INFO L383 tUnfolder$Statistics]: this new event has 207 ancestors and is cut-off event [2022-11-20 10:33:06,051 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-20 10:33:06,052 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-20 10:33:06,052 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-20 10:33:06,057 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, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:06,057 INFO L383 tUnfolder$Statistics]: this new event has 208 ancestors and is cut-off event [2022-11-20 10:33:06,058 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-20 10:33:06,058 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-20 10:33:06,058 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:33:06,058 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:33:06,059 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_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 83#t_funENTRYtrue, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:06,059 INFO L383 tUnfolder$Statistics]: this new event has 208 ancestors and is cut-off event [2022-11-20 10:33:06,059 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 10:33:06,059 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-20 10:33:06,059 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-20 10:33:06,059 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 10:33:06,066 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, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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), Black: 400#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse, 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0))]) [2022-11-20 10:33:06,066 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-20 10:33:06,067 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 10:33:06,067 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:06,067 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:06,069 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_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 165#L1013-10true, Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:06,069 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-20 10:33:06,069 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:06,070 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 10:33:06,070 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:06,107 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, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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), Black: 400#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse, 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0))]) [2022-11-20 10:33:06,107 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-20 10:33:06,107 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-20 10:33:06,108 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-20 10:33:06,108 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-20 10:33:06,108 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, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 165#L1013-10true, Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:06,108 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-20 10:33:06,108 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:06,108 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 10:33:06,108 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-20 10:33:06,109 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_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 165#L1013-10true, Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:06,109 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-20 10:33:06,109 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-20 10:33:06,110 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:06,110 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 10:33:06,110 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-20 10:33:06,116 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, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:06,116 INFO L383 tUnfolder$Statistics]: this new event has 227 ancestors and is cut-off event [2022-11-20 10:33:06,116 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-20 10:33:06,117 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-20 10:33:06,117 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-20 10:33:06,119 INFO L130 PetriNetUnfolder]: 573/5043 cut-off events. [2022-11-20 10:33:06,120 INFO L131 PetriNetUnfolder]: For 3192/4258 co-relation queries the response was YES. [2022-11-20 10:33:06,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8208 conditions, 5043 events. 573/5043 cut-off events. For 3192/4258 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 51568 event pairs, 154 based on Foata normal form. 20/4464 useless extension candidates. Maximal degree in co-relation 7472. Up to 573 conditions per place. [2022-11-20 10:33:06,232 INFO L137 encePairwiseOnDemand]: 366/370 looper letters, 15 selfloop transitions, 5 changer transitions 0/353 dead transitions. [2022-11-20 10:33:06,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 353 transitions, 1024 flow [2022-11-20 10:33:06,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:33:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 10:33:06,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1225 transitions. [2022-11-20 10:33:06,235 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8277027027027027 [2022-11-20 10:33:06,235 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1225 transitions. [2022-11-20 10:33:06,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1225 transitions. [2022-11-20 10:33:06,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:33:06,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1225 transitions. [2022-11-20 10:33:06,238 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-20 10:33:06,240 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-20 10:33:06,241 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-20 10:33:06,241 INFO L175 Difference]: Start difference. First operand has 347 places, 354 transitions, 988 flow. Second operand 4 states and 1225 transitions. [2022-11-20 10:33:06,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 353 transitions, 1024 flow [2022-11-20 10:33:06,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 353 transitions, 1012 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:33:06,258 INFO L231 Difference]: Finished difference. Result has 346 places, 353 transitions, 982 flow [2022-11-20 10:33:06,259 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-20 10:33:06,259 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 25 predicate places. [2022-11-20 10:33:06,260 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 353 transitions, 982 flow [2022-11-20 10:33:06,260 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-20 10:33:06,260 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:33:06,261 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-20 10:33:06,272 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:33:06,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 10:33:06,467 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-20 10:33:06,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:06,468 INFO L85 PathProgramCache]: Analyzing trace with hash -175733302, now seen corresponding path program 1 times [2022-11-20 10:33:06,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:06,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898440736] [2022-11-20 10:33:06,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:06,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:06,548 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-20 10:33:06,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:06,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898440736] [2022-11-20 10:33:06,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898440736] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:06,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539313585] [2022-11-20 10:33:06,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:06,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:06,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:33:06,551 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:33:06,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:33:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:06,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:33:06,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:33:06,731 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-20 10:33:06,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:33:06,783 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-20 10:33:06,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539313585] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:33:06,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:33:06,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 10:33:06,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516789291] [2022-11-20 10:33:06,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:33:06,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:33:06,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:06,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:33:06,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:33:06,789 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-20 10:33:06,792 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-20 10:33:06,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:33:06,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-20 10:33:06,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:33:07,399 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_funThread3of3ForFork0InUse, 83#t_funENTRYtrue, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 102#t_funENTRYtrue, 676#true, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:07,399 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is not cut-off event [2022-11-20 10:33:07,399 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-20 10:33:07,399 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-20 10:33:07,400 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-20 10:33:07,927 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_funThread3of3ForFork0InUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 102#t_funENTRYtrue, 676#true, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:07,928 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-20 10:33:07,928 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-20 10:33:07,928 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:33:07,928 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:33:07,930 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, 83#t_funENTRYtrue, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:07,931 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-20 10:33:07,931 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:33:07,931 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-20 10:33:07,931 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:33:07,941 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_funThread3of3ForFork0InUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 89#L1013-10true, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:07,942 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-20 10:33:07,942 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:07,942 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 10:33:07,942 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:08,022 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_funThread3of3ForFork0InUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 102#t_funENTRYtrue, 676#true, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:08,022 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-20 10:33:08,022 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-20 10:33:08,022 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-20 10:33:08,022 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-20 10:33:08,025 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, 83#t_funENTRYtrue, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:08,025 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-20 10:33:08,025 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-20 10:33:08,025 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-20 10:33:08,026 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-20 10:33:08,031 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, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, 49#t_funENTRYtrue, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), t_funThread1of3ForFork0InUse]) [2022-11-20 10:33:08,031 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-20 10:33:08,031 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-20 10:33:08,031 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-20 10:33:08,031 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-20 10:33:08,059 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[][329], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 89#L1013-10true, t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:08,059 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-20 10:33:08,059 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:08,059 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 10:33:08,059 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:08,060 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 10:33:08,093 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, 298#L1013-6true, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 392#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5)), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0InUse]) [2022-11-20 10:33:08,094 INFO L383 tUnfolder$Statistics]: this new event has 194 ancestors and is not cut-off event [2022-11-20 10:33:08,094 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is not cut-off event [2022-11-20 10:33:08,094 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is not cut-off event [2022-11-20 10:33:08,094 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is not cut-off event [2022-11-20 10:33:08,100 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, 162#L1013-7true, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0InUse]) [2022-11-20 10:33:08,101 INFO L383 tUnfolder$Statistics]: this new event has 195 ancestors and is not cut-off event [2022-11-20 10:33:08,101 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-20 10:33:08,101 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-20 10:33:08,101 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-20 10:33:08,127 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, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 149#L1013-10true, 676#true, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0InUse]) [2022-11-20 10:33:08,127 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-20 10:33:08,127 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:08,128 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 10:33:08,128 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:08,128 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, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 165#L1013-10true, Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:08,128 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-20 10:33:08,128 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:08,128 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 10:33:08,128 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:08,130 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[][329], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 165#L1013-10true, Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:08,130 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-20 10:33:08,130 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:08,130 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 10:33:08,130 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:33:08,130 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-20 10:33:08,142 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, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:08,142 INFO L383 tUnfolder$Statistics]: this new event has 227 ancestors and is cut-off event [2022-11-20 10:33:08,142 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-20 10:33:08,142 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-20 10:33:08,142 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-20 10:33:08,143 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, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:08,143 INFO L383 tUnfolder$Statistics]: this new event has 227 ancestors and is cut-off event [2022-11-20 10:33:08,143 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-20 10:33:08,143 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-20 10:33:08,143 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-20 10:33:08,151 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, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:08,151 INFO L383 tUnfolder$Statistics]: this new event has 215 ancestors and is not cut-off event [2022-11-20 10:33:08,151 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is not cut-off event [2022-11-20 10:33:08,151 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is not cut-off event [2022-11-20 10:33:08,151 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is not cut-off event [2022-11-20 10:33:08,160 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[][329], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, 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 (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 390#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 398#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 386#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 388#(and (= 1 (select |#valid| 5)) (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#B~0.base| 5) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-11-20 10:33:08,161 INFO L383 tUnfolder$Statistics]: this new event has 251 ancestors and is cut-off event [2022-11-20 10:33:08,161 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-20 10:33:08,161 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-20 10:33:08,161 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-20 10:33:08,161 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-20 10:33:08,161 INFO L130 PetriNetUnfolder]: 495/4208 cut-off events. [2022-11-20 10:33:08,162 INFO L131 PetriNetUnfolder]: For 2937/3413 co-relation queries the response was YES. [2022-11-20 10:33:08,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7048 conditions, 4208 events. 495/4208 cut-off events. For 2937/3413 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 40746 event pairs, 152 based on Foata normal form. 28/3740 useless extension candidates. Maximal degree in co-relation 6865. Up to 493 conditions per place. [2022-11-20 10:33:08,242 INFO L137 encePairwiseOnDemand]: 364/370 looper letters, 22 selfloop transitions, 9 changer transitions 0/364 dead transitions. [2022-11-20 10:33:08,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 364 transitions, 1082 flow [2022-11-20 10:33:08,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:33:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 10:33:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2751 transitions. [2022-11-20 10:33:08,246 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8261261261261261 [2022-11-20 10:33:08,246 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2751 transitions. [2022-11-20 10:33:08,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2751 transitions. [2022-11-20 10:33:08,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:33:08,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2751 transitions. [2022-11-20 10:33:08,252 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-20 10:33:08,256 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-20 10:33:08,258 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-20 10:33:08,258 INFO L175 Difference]: Start difference. First operand has 346 places, 353 transitions, 982 flow. Second operand 9 states and 2751 transitions. [2022-11-20 10:33:08,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 364 transitions, 1082 flow [2022-11-20 10:33:08,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 364 transitions, 1068 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:33:08,274 INFO L231 Difference]: Finished difference. Result has 355 places, 357 transitions, 1028 flow [2022-11-20 10:33:08,274 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-20 10:33:08,275 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 34 predicate places. [2022-11-20 10:33:08,275 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 357 transitions, 1028 flow [2022-11-20 10:33:08,276 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-20 10:33:08,276 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:33:08,276 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-20 10:33:08,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-20 10:33:08,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-20 10:33:08,482 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-20 10:33:08,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash -427883193, now seen corresponding path program 1 times [2022-11-20 10:33:08,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:08,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988119117] [2022-11-20 10:33:08,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:08,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:08,668 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-20 10:33:08,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:08,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988119117] [2022-11-20 10:33:08,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988119117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:33:08,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:33:08,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:33:08,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140869910] [2022-11-20 10:33:08,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:08,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:33:08,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:08,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:33:08,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:33:08,672 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 370 [2022-11-20 10:33:08,674 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-20 10:33:08,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:33:08,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 370 [2022-11-20 10:33:08,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:33:36,661 INFO L130 PetriNetUnfolder]: 41300/126659 cut-off events. [2022-11-20 10:33:36,661 INFO L131 PetriNetUnfolder]: For 136646/142897 co-relation queries the response was YES. [2022-11-20 10:33:38,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245252 conditions, 126659 events. 41300/126659 cut-off events. For 136646/142897 co-relation queries the response was YES. Maximal size of possible extension queue 4779. Compared 1943798 event pairs, 14945 based on Foata normal form. 677/113854 useless extension candidates. Maximal degree in co-relation 236120. Up to 23672 conditions per place. [2022-11-20 10:33:38,824 INFO L137 encePairwiseOnDemand]: 352/370 looper letters, 251 selfloop transitions, 55 changer transitions 0/570 dead transitions. [2022-11-20 10:33:38,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 570 transitions, 2531 flow [2022-11-20 10:33:38,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:33:38,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 10:33:38,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3058 transitions. [2022-11-20 10:33:38,830 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7513513513513513 [2022-11-20 10:33:38,830 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3058 transitions. [2022-11-20 10:33:38,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3058 transitions. [2022-11-20 10:33:38,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:33:38,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3058 transitions. [2022-11-20 10:33:38,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 278.0) internal successors, (3058), 11 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:33:38,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 370.0) internal successors, (4440), 12 states have internal predecessors, (4440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:33:38,846 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 370.0) internal successors, (4440), 12 states have internal predecessors, (4440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:33:38,846 INFO L175 Difference]: Start difference. First operand has 355 places, 357 transitions, 1028 flow. Second operand 11 states and 3058 transitions. [2022-11-20 10:33:38,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 570 transitions, 2531 flow [2022-11-20 10:33:40,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 570 transitions, 2515 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-20 10:33:40,260 INFO L231 Difference]: Finished difference. Result has 368 places, 404 transitions, 1540 flow [2022-11-20 10:33:40,261 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1540, PETRI_PLACES=368, PETRI_TRANSITIONS=404} [2022-11-20 10:33:40,262 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 47 predicate places. [2022-11-20 10:33:40,262 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 404 transitions, 1540 flow [2022-11-20 10:33:40,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-20 10:33:40,263 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:33:40,263 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:40,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-20 10:33:40,264 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-20 10:33:40,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:40,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1290205626, now seen corresponding path program 1 times [2022-11-20 10:33:40,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:40,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293543894] [2022-11-20 10:33:40,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:40,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:33:40,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:40,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293543894] [2022-11-20 10:33:40,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293543894] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:40,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482452612] [2022-11-20 10:33:40,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:40,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:40,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:33:40,547 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:33:40,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19484e95-a268-4391-bc44-8c85343a8724/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:33:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:40,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 10:33:40,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:33:40,934 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:33:40,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 10:33:40,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:33:41,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:33:41,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 10:33:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:33:41,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:33:41,281 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_292 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_292) |c_~#B~0.base|) |c_~#B~0.offset|) 2147483647)) is different from false [2022-11-20 10:33:41,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-11-20 10:33:41,912 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 10:33:41,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-20 10:33:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2022-11-20 10:33:41,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482452612] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:33:41,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:33:41,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-11-20 10:33:41,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854264648] [2022-11-20 10:33:41,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:33:41,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 10:33:41,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:41,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 10:33:41,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=272, Unknown=1, NotChecked=34, Total=380 [2022-11-20 10:33:41,926 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 370 [2022-11-20 10:33:41,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 404 transitions, 1540 flow. Second operand has 20 states, 20 states have (on average 253.0) internal successors, (5060), 20 states have internal predecessors, (5060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:33:41,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:33:41,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 370 [2022-11-20 10:33:41,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand