./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 19:50:46,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:50:46,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:50:46,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:50:46,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:50:46,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:50:46,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:50:46,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:50:46,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:50:46,113 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:50:46,114 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:50:46,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:50:46,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:50:46,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:50:46,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:50:46,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:50:46,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:50:46,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:50:46,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:50:46,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:50:46,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:50:46,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:50:46,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:50:46,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:50:46,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:50:46,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:50:46,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:50:46,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:50:46,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:50:46,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:50:46,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:50:46,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:50:46,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:50:46,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:50:46,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:50:46,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:50:46,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:50:46,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:50:46,170 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:50:46,171 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:50:46,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:50:46,172 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-18 19:50:46,219 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:50:46,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:50:46,221 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:50:46,221 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:50:46,222 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:50:46,222 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:50:46,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:50:46,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:50:46,224 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:50:46,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:50:46,225 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:50:46,225 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 19:50:46,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:50:46,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:50:46,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:50:46,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:50:46,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:50:46,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:50:46,227 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 19:50:46,227 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:50:46,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:50:46,228 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:50:46,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:50:46,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:50:46,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:50:46,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:50:46,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:50:46,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:50:46,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:50:46,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:50:46,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:50:46,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:50:46,233 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:50:46,233 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:50:46,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:50:46,233 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_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f [2022-11-18 19:50:46,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:50:46,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:50:46,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:50:46,606 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:50:46,607 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:50:46,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2022-11-18 19:50:46,702 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/data/7096ceea1/c7780946808c43598ee4e58998ad6b79/FLAG2ddf85c41 [2022-11-18 19:50:47,424 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:50:47,425 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2022-11-18 19:50:47,450 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/data/7096ceea1/c7780946808c43598ee4e58998ad6b79/FLAG2ddf85c41 [2022-11-18 19:50:47,654 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/data/7096ceea1/c7780946808c43598ee4e58998ad6b79 [2022-11-18 19:50:47,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:50:47,659 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:50:47,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:50:47,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:50:47,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:50:47,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:50:47" (1/1) ... [2022-11-18 19:50:47,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a453edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:47, skipping insertion in model container [2022-11-18 19:50:47,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:50:47" (1/1) ... [2022-11-18 19:50:47,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:50:47,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:50:48,372 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2022-11-18 19:50:48,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:50:48,420 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:50:48,461 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2022-11-18 19:50:48,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:50:48,540 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:50:48,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:48 WrapperNode [2022-11-18 19:50:48,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:50:48,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:50:48,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:50:48,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:50:48,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:48" (1/1) ... [2022-11-18 19:50:48,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:48" (1/1) ... [2022-11-18 19:50:48,618 INFO L138 Inliner]: procedures = 271, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 266 [2022-11-18 19:50:48,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:50:48,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:50:48,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:50:48,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:50:48,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:48" (1/1) ... [2022-11-18 19:50:48,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:48" (1/1) ... [2022-11-18 19:50:48,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:48" (1/1) ... [2022-11-18 19:50:48,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:48" (1/1) ... [2022-11-18 19:50:48,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:48" (1/1) ... [2022-11-18 19:50:48,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:48" (1/1) ... [2022-11-18 19:50:48,660 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:48" (1/1) ... [2022-11-18 19:50:48,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:48" (1/1) ... [2022-11-18 19:50:48,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:50:48,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:50:48,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:50:48,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:50:48,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:48" (1/1) ... [2022-11-18 19:50:48,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:50:48,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:50:48,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:50:48,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:50:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:50:48,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:50:48,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:50:48,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:50:48,790 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-18 19:50:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:50:48,794 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-18 19:50:48,794 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-18 19:50:48,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:50:48,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:50:48,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:50:48,797 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 19:50:49,109 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:50:49,112 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:50:49,652 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:50:49,692 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:50:49,692 INFO L300 CfgBuilder]: Removed 35 assume(true) statements. [2022-11-18 19:50:49,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:50:49 BoogieIcfgContainer [2022-11-18 19:50:49,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:50:49,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:50:49,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:50:49,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:50:49,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:50:47" (1/3) ... [2022-11-18 19:50:49,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4067e15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:50:49, skipping insertion in model container [2022-11-18 19:50:49,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:50:48" (2/3) ... [2022-11-18 19:50:49,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4067e15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:50:49, skipping insertion in model container [2022-11-18 19:50:49,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:50:49" (3/3) ... [2022-11-18 19:50:49,707 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2022-11-18 19:50:49,717 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 19:50:49,730 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:50:49,730 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-11-18 19:50:49,730 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 19:50:49,901 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-18 19:50:49,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 251 places, 293 transitions, 594 flow [2022-11-18 19:50:50,107 INFO L130 PetriNetUnfolder]: 73/447 cut-off events. [2022-11-18 19:50:50,108 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-18 19:50:50,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 447 events. 73/447 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2144 event pairs, 0 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 245. Up to 8 conditions per place. [2022-11-18 19:50:50,127 INFO L82 GeneralOperation]: Start removeDead. Operand has 251 places, 293 transitions, 594 flow [2022-11-18 19:50:50,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 290 transitions, 588 flow [2022-11-18 19:50:50,150 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:50:50,158 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;@2d2e6001, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:50:50,158 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-11-18 19:50:50,166 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-18 19:50:50,167 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:50:50,168 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:50:50,169 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:50,169 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-18 19:50:50,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:50,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1687812199, now seen corresponding path program 1 times [2022-11-18 19:50:50,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:50,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073492706] [2022-11-18 19:50:50,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:50,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:50,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:50,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:50,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073492706] [2022-11-18 19:50:50,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073492706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:50,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:50,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:50:50,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873244124] [2022-11-18 19:50:50,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:50,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:50:50,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:50,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:50:50,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:50:50,673 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 293 [2022-11-18 19:50:50,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 290 transitions, 588 flow. Second operand has 4 states, 4 states have (on average 239.5) internal successors, (958), 4 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:50,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:50:50,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 293 [2022-11-18 19:50:50,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:50:50,933 INFO L130 PetriNetUnfolder]: 9/383 cut-off events. [2022-11-18 19:50:50,934 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-18 19:50:50,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 383 events. 9/383 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1731 event pairs, 0 based on Foata normal form. 62/396 useless extension candidates. Maximal degree in co-relation 207. Up to 15 conditions per place. [2022-11-18 19:50:50,945 INFO L137 encePairwiseOnDemand]: 248/293 looper letters, 17 selfloop transitions, 4 changer transitions 0/256 dead transitions. [2022-11-18 19:50:50,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 256 transitions, 562 flow [2022-11-18 19:50:50,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:50:50,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 19:50:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1253 transitions. [2022-11-18 19:50:50,980 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8552901023890785 [2022-11-18 19:50:50,981 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1253 transitions. [2022-11-18 19:50:50,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1253 transitions. [2022-11-18 19:50:50,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:50:51,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1253 transitions. [2022-11-18 19:50:51,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 250.6) internal successors, (1253), 5 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:51,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:51,070 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:51,073 INFO L175 Difference]: Start difference. First operand has 249 places, 290 transitions, 588 flow. Second operand 5 states and 1253 transitions. [2022-11-18 19:50:51,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 256 transitions, 562 flow [2022-11-18 19:50:51,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 256 transitions, 562 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 19:50:51,091 INFO L231 Difference]: Finished difference. Result has 253 places, 252 transitions, 538 flow [2022-11-18 19:50:51,094 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=538, PETRI_PLACES=253, PETRI_TRANSITIONS=252} [2022-11-18 19:50:51,098 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 4 predicate places. [2022-11-18 19:50:51,099 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 252 transitions, 538 flow [2022-11-18 19:50:51,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 239.5) internal successors, (958), 4 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:51,101 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:50:51,101 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:51,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:50:51,102 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-18 19:50:51,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:51,104 INFO L85 PathProgramCache]: Analyzing trace with hash -239776336, now seen corresponding path program 1 times [2022-11-18 19:50:51,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:51,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709171606] [2022-11-18 19:50:51,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:51,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:50:51,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:51,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709171606] [2022-11-18 19:50:51,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709171606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:51,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:51,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:50:51,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956033934] [2022-11-18 19:50:51,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:51,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:50:51,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:51,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:50:51,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:50:51,331 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 293 [2022-11-18 19:50:51,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 252 transitions, 538 flow. Second operand has 4 states, 4 states have (on average 241.25) internal successors, (965), 4 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:51,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:50:51,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 293 [2022-11-18 19:50:51,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:50:51,470 INFO L130 PetriNetUnfolder]: 9/382 cut-off events. [2022-11-18 19:50:51,471 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-18 19:50:51,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 382 events. 9/382 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1733 event pairs, 0 based on Foata normal form. 1/337 useless extension candidates. Maximal degree in co-relation 372. Up to 7 conditions per place. [2022-11-18 19:50:51,476 INFO L137 encePairwiseOnDemand]: 287/293 looper letters, 9 selfloop transitions, 8 changer transitions 0/252 dead transitions. [2022-11-18 19:50:51,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 252 transitions, 570 flow [2022-11-18 19:50:51,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:50:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 19:50:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1205 transitions. [2022-11-18 19:50:51,480 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8225255972696246 [2022-11-18 19:50:51,480 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1205 transitions. [2022-11-18 19:50:51,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1205 transitions. [2022-11-18 19:50:51,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:50:51,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1205 transitions. [2022-11-18 19:50:51,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:51,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:51,490 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:51,490 INFO L175 Difference]: Start difference. First operand has 253 places, 252 transitions, 538 flow. Second operand 5 states and 1205 transitions. [2022-11-18 19:50:51,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 252 transitions, 570 flow [2022-11-18 19:50:51,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 252 transitions, 568 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 19:50:51,498 INFO L231 Difference]: Finished difference. Result has 256 places, 252 transitions, 556 flow [2022-11-18 19:50:51,499 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=556, PETRI_PLACES=256, PETRI_TRANSITIONS=252} [2022-11-18 19:50:51,500 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 7 predicate places. [2022-11-18 19:50:51,500 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 252 transitions, 556 flow [2022-11-18 19:50:51,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 241.25) internal successors, (965), 4 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:51,501 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:50:51,501 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:51,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:50:51,502 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-18 19:50:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:51,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1156868917, now seen corresponding path program 1 times [2022-11-18 19:50:51,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:51,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194920968] [2022-11-18 19:50:51,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:51,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:51,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:51,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194920968] [2022-11-18 19:50:51,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194920968] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:50:51,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673408283] [2022-11-18 19:50:51,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:51,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:50:51,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:50:51,745 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:50:51,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 19:50:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:51,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 19:50:51,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:50:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:52,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:50:52,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673408283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:52,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:50:52,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-18 19:50:52,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339304760] [2022-11-18 19:50:52,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:52,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:50:52,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:52,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:50:52,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:50:52,039 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 293 [2022-11-18 19:50:52,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 252 transitions, 556 flow. Second operand has 5 states, 5 states have (on average 240.8) internal successors, (1204), 5 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:52,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:50:52,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 293 [2022-11-18 19:50:52,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:50:52,230 INFO L130 PetriNetUnfolder]: 9/381 cut-off events. [2022-11-18 19:50:52,230 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-18 19:50:52,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 381 events. 9/381 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1717 event pairs, 0 based on Foata normal form. 1/336 useless extension candidates. Maximal degree in co-relation 370. Up to 10 conditions per place. [2022-11-18 19:50:52,236 INFO L137 encePairwiseOnDemand]: 289/293 looper letters, 11 selfloop transitions, 5 changer transitions 0/251 dead transitions. [2022-11-18 19:50:52,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 251 transitions, 584 flow [2022-11-18 19:50:52,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:50:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-18 19:50:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 965 transitions. [2022-11-18 19:50:52,240 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8233788395904437 [2022-11-18 19:50:52,241 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 965 transitions. [2022-11-18 19:50:52,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 965 transitions. [2022-11-18 19:50:52,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:50:52,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 965 transitions. [2022-11-18 19:50:52,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 241.25) internal successors, (965), 4 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:52,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:52,251 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:52,251 INFO L175 Difference]: Start difference. First operand has 256 places, 252 transitions, 556 flow. Second operand 4 states and 965 transitions. [2022-11-18 19:50:52,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 251 transitions, 584 flow [2022-11-18 19:50:52,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 251 transitions, 572 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 19:50:52,260 INFO L231 Difference]: Finished difference. Result has 255 places, 251 transitions, 550 flow [2022-11-18 19:50:52,261 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=550, PETRI_PLACES=255, PETRI_TRANSITIONS=251} [2022-11-18 19:50:52,264 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 6 predicate places. [2022-11-18 19:50:52,264 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 251 transitions, 550 flow [2022-11-18 19:50:52,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 240.8) internal successors, (1204), 5 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:52,266 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:50:52,266 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:52,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-18 19:50:52,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:50:52,472 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-18 19:50:52,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:52,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1074044146, now seen corresponding path program 1 times [2022-11-18 19:50:52,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:52,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344097537] [2022-11-18 19:50:52,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:52,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:52,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:52,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344097537] [2022-11-18 19:50:52,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344097537] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:50:52,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599010839] [2022-11-18 19:50:52,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:52,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:50:52,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:50:52,610 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:50:52,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 19:50:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:52,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 19:50:52,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:50:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:52,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:50:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:52,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599010839] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:50:52,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:50:52,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-18 19:50:52,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898083271] [2022-11-18 19:50:52,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:50:52,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 19:50:52,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:52,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 19:50:52,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:50:52,869 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 293 [2022-11-18 19:50:52,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 251 transitions, 550 flow. Second operand has 10 states, 10 states have (on average 240.7) internal successors, (2407), 10 states have internal predecessors, (2407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:52,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:50:52,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 293 [2022-11-18 19:50:52,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:50:53,115 INFO L130 PetriNetUnfolder]: 9/389 cut-off events. [2022-11-18 19:50:53,116 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-18 19:50:53,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 389 events. 9/389 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1715 event pairs, 0 based on Foata normal form. 2/345 useless extension candidates. Maximal degree in co-relation 360. Up to 7 conditions per place. [2022-11-18 19:50:53,121 INFO L137 encePairwiseOnDemand]: 287/293 looper letters, 18 selfloop transitions, 9 changer transitions 0/262 dead transitions. [2022-11-18 19:50:53,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 262 transitions, 642 flow [2022-11-18 19:50:53,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:50:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 19:50:53,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2171 transitions. [2022-11-18 19:50:53,128 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8232840348881304 [2022-11-18 19:50:53,128 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2171 transitions. [2022-11-18 19:50:53,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2171 transitions. [2022-11-18 19:50:53,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:50:53,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2171 transitions. [2022-11-18 19:50:53,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 241.22222222222223) internal successors, (2171), 9 states have internal predecessors, (2171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:53,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 293.0) internal successors, (2930), 10 states have internal predecessors, (2930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:53,146 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 293.0) internal successors, (2930), 10 states have internal predecessors, (2930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:53,146 INFO L175 Difference]: Start difference. First operand has 255 places, 251 transitions, 550 flow. Second operand 9 states and 2171 transitions. [2022-11-18 19:50:53,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 262 transitions, 642 flow [2022-11-18 19:50:53,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 262 transitions, 628 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 19:50:53,154 INFO L231 Difference]: Finished difference. Result has 264 places, 255 transitions, 596 flow [2022-11-18 19:50:53,155 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=596, PETRI_PLACES=264, PETRI_TRANSITIONS=255} [2022-11-18 19:50:53,157 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 15 predicate places. [2022-11-18 19:50:53,157 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 255 transitions, 596 flow [2022-11-18 19:50:53,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 240.7) internal successors, (2407), 10 states have internal predecessors, (2407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:53,158 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:50:53,159 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:53,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 19:50:53,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:50:53,366 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-18 19:50:53,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:53,367 INFO L85 PathProgramCache]: Analyzing trace with hash -475199278, now seen corresponding path program 2 times [2022-11-18 19:50:53,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:53,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575706391] [2022-11-18 19:50:53,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:53,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 19:50:53,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:53,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575706391] [2022-11-18 19:50:53,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575706391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:53,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:53,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:50:53,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290331364] [2022-11-18 19:50:53,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:53,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:50:53,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:53,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:50:53,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:50:53,556 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 293 [2022-11-18 19:50:53,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 255 transitions, 596 flow. Second operand has 4 states, 4 states have (on average 239.75) internal successors, (959), 4 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:53,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:50:53,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 293 [2022-11-18 19:50:53,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:50:53,666 INFO L130 PetriNetUnfolder]: 6/264 cut-off events. [2022-11-18 19:50:53,667 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-11-18 19:50:53,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 264 events. 6/264 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 814 event pairs, 0 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 247. Up to 7 conditions per place. [2022-11-18 19:50:53,673 INFO L137 encePairwiseOnDemand]: 286/293 looper letters, 10 selfloop transitions, 4 changer transitions 0/255 dead transitions. [2022-11-18 19:50:53,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 255 transitions, 624 flow [2022-11-18 19:50:53,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:50:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 19:50:53,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1207 transitions. [2022-11-18 19:50:53,677 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8238907849829351 [2022-11-18 19:50:53,677 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1207 transitions. [2022-11-18 19:50:53,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1207 transitions. [2022-11-18 19:50:53,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:50:53,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1207 transitions. [2022-11-18 19:50:53,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 241.4) internal successors, (1207), 5 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:53,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:53,685 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:53,685 INFO L175 Difference]: Start difference. First operand has 264 places, 255 transitions, 596 flow. Second operand 5 states and 1207 transitions. [2022-11-18 19:50:53,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 255 transitions, 624 flow [2022-11-18 19:50:53,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 255 transitions, 608 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-18 19:50:53,697 INFO L231 Difference]: Finished difference. Result has 263 places, 253 transitions, 588 flow [2022-11-18 19:50:53,697 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=588, PETRI_PLACES=263, PETRI_TRANSITIONS=253} [2022-11-18 19:50:53,700 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 14 predicate places. [2022-11-18 19:50:53,700 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 253 transitions, 588 flow [2022-11-18 19:50:53,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 239.75) internal successors, (959), 4 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:53,701 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:50:53,701 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:53,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:50:53,702 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-18 19:50:53,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:53,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1969892839, now seen corresponding path program 1 times [2022-11-18 19:50:53,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:53,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527830264] [2022-11-18 19:50:53,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:53,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:53,880 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 19:50:53,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:53,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527830264] [2022-11-18 19:50:53,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527830264] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:50:53,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851480691] [2022-11-18 19:50:53,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:53,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:50:53,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:50:53,883 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:50:53,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 19:50:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:53,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 19:50:54,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:50:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 19:50:54,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:50:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 19:50:54,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851480691] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:50:54,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:50:54,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-18 19:50:54,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534475805] [2022-11-18 19:50:54,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:50:54,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 19:50:54,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:54,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 19:50:54,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-18 19:50:54,271 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 293 [2022-11-18 19:50:54,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 253 transitions, 588 flow. Second operand has 18 states, 18 states have (on average 241.05555555555554) internal successors, (4339), 18 states have internal predecessors, (4339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:54,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:50:54,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 293 [2022-11-18 19:50:54,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:50:54,631 INFO L130 PetriNetUnfolder]: 6/292 cut-off events. [2022-11-18 19:50:54,631 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-11-18 19:50:54,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 292 events. 6/292 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 814 event pairs, 0 based on Foata normal form. 4/270 useless extension candidates. Maximal degree in co-relation 240. Up to 9 conditions per place. [2022-11-18 19:50:54,637 INFO L137 encePairwiseOnDemand]: 287/293 looper letters, 34 selfloop transitions, 21 changer transitions 0/288 dead transitions. [2022-11-18 19:50:54,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 288 transitions, 852 flow [2022-11-18 19:50:54,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 19:50:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-18 19:50:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5057 transitions. [2022-11-18 19:50:54,650 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8218755078823338 [2022-11-18 19:50:54,650 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 5057 transitions. [2022-11-18 19:50:54,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 5057 transitions. [2022-11-18 19:50:54,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:50:54,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 5057 transitions. [2022-11-18 19:50:54,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 240.8095238095238) internal successors, (5057), 21 states have internal predecessors, (5057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:54,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 293.0) internal successors, (6446), 22 states have internal predecessors, (6446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:54,725 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 293.0) internal successors, (6446), 22 states have internal predecessors, (6446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:54,726 INFO L175 Difference]: Start difference. First operand has 263 places, 253 transitions, 588 flow. Second operand 21 states and 5057 transitions. [2022-11-18 19:50:54,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 288 transitions, 852 flow [2022-11-18 19:50:54,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 288 transitions, 844 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 19:50:54,736 INFO L231 Difference]: Finished difference. Result has 284 places, 266 transitions, 736 flow [2022-11-18 19:50:54,736 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=736, PETRI_PLACES=284, PETRI_TRANSITIONS=266} [2022-11-18 19:50:54,740 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 35 predicate places. [2022-11-18 19:50:54,740 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 266 transitions, 736 flow [2022-11-18 19:50:54,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 241.05555555555554) internal successors, (4339), 18 states have internal predecessors, (4339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:54,752 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:50:54,753 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:54,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 19:50:54,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-18 19:50:54,969 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-18 19:50:54,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:54,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1855590873, now seen corresponding path program 2 times [2022-11-18 19:50:54,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:54,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887187773] [2022-11-18 19:50:54,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:54,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 19:50:55,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:55,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887187773] [2022-11-18 19:50:55,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887187773] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:50:55,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267089110] [2022-11-18 19:50:55,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:50:55,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:50:55,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:50:55,398 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:50:55,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 19:50:55,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:50:55,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:50:55,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 19:50:55,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:50:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 19:50:55,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:50:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 19:50:55,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267089110] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:50:55,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:50:55,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-18 19:50:55,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393875768] [2022-11-18 19:50:55,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:50:55,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 19:50:55,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:55,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 19:50:55,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-18 19:50:55,978 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 293 [2022-11-18 19:50:55,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 266 transitions, 736 flow. Second operand has 23 states, 23 states have (on average 241.30434782608697) internal successors, (5550), 23 states have internal predecessors, (5550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:55,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:50:55,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 293 [2022-11-18 19:50:55,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:50:56,542 INFO L130 PetriNetUnfolder]: 6/313 cut-off events. [2022-11-18 19:50:56,542 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2022-11-18 19:50:56,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 313 events. 6/313 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 816 event pairs, 0 based on Foata normal form. 3/290 useless extension candidates. Maximal degree in co-relation 334. Up to 12 conditions per place. [2022-11-18 19:50:56,547 INFO L137 encePairwiseOnDemand]: 287/293 looper letters, 46 selfloop transitions, 30 changer transitions 0/309 dead transitions. [2022-11-18 19:50:56,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 309 transitions, 1098 flow [2022-11-18 19:50:56,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-18 19:50:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-18 19:50:56,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 7219 transitions. [2022-11-18 19:50:56,563 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8212741751990899 [2022-11-18 19:50:56,563 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 7219 transitions. [2022-11-18 19:50:56,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 7219 transitions. [2022-11-18 19:50:56,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:50:56,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 7219 transitions. [2022-11-18 19:50:56,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 240.63333333333333) internal successors, (7219), 30 states have internal predecessors, (7219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:56,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 293.0) internal successors, (9083), 31 states have internal predecessors, (9083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:56,605 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 293.0) internal successors, (9083), 31 states have internal predecessors, (9083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:56,606 INFO L175 Difference]: Start difference. First operand has 284 places, 266 transitions, 736 flow. Second operand 30 states and 7219 transitions. [2022-11-18 19:50:56,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 309 transitions, 1098 flow [2022-11-18 19:50:56,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 309 transitions, 1018 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-18 19:50:56,616 INFO L231 Difference]: Finished difference. Result has 309 places, 276 transitions, 834 flow [2022-11-18 19:50:56,617 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=834, PETRI_PLACES=309, PETRI_TRANSITIONS=276} [2022-11-18 19:50:56,618 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 60 predicate places. [2022-11-18 19:50:56,618 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 276 transitions, 834 flow [2022-11-18 19:50:56,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 241.30434782608697) internal successors, (5550), 23 states have internal predecessors, (5550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:56,621 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:50:56,621 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:56,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 19:50:56,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-18 19:50:56,828 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-18 19:50:56,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:56,828 INFO L85 PathProgramCache]: Analyzing trace with hash 44998914, now seen corresponding path program 3 times [2022-11-18 19:50:56,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:56,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151012435] [2022-11-18 19:50:56,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:56,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:50:56,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 19:50:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:50:56,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 19:50:56,954 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 19:50:56,956 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2022-11-18 19:50:56,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 29 remaining) [2022-11-18 19:50:56,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 29 remaining) [2022-11-18 19:50:56,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 29 remaining) [2022-11-18 19:50:56,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 29 remaining) [2022-11-18 19:50:56,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 29 remaining) [2022-11-18 19:50:56,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 29 remaining) [2022-11-18 19:50:56,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 29 remaining) [2022-11-18 19:50:56,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 29 remaining) [2022-11-18 19:50:56,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 29 remaining) [2022-11-18 19:50:56,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 29 remaining) [2022-11-18 19:50:56,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 29 remaining) [2022-11-18 19:50:56,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 29 remaining) [2022-11-18 19:50:56,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 29 remaining) [2022-11-18 19:50:56,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 29 remaining) [2022-11-18 19:50:56,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 29 remaining) [2022-11-18 19:50:56,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 29 remaining) [2022-11-18 19:50:56,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 29 remaining) [2022-11-18 19:50:56,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 29 remaining) [2022-11-18 19:50:56,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 29 remaining) [2022-11-18 19:50:56,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 29 remaining) [2022-11-18 19:50:56,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 29 remaining) [2022-11-18 19:50:56,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 29 remaining) [2022-11-18 19:50:56,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 29 remaining) [2022-11-18 19:50:56,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 29 remaining) [2022-11-18 19:50:56,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 29 remaining) [2022-11-18 19:50:56,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 29 remaining) [2022-11-18 19:50:56,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 29 remaining) [2022-11-18 19:50:56,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 29 remaining) [2022-11-18 19:50:56,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 19:50:56,971 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2022-11-18 19:50:56,974 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-18 19:50:56,974 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-18 19:50:57,034 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-18 19:50:57,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 377 transitions, 772 flow [2022-11-18 19:50:57,177 INFO L130 PetriNetUnfolder]: 118/722 cut-off events. [2022-11-18 19:50:57,177 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-18 19:50:57,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 722 events. 118/722 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3910 event pairs, 0 based on Foata normal form. 0/546 useless extension candidates. Maximal degree in co-relation 449. Up to 12 conditions per place. [2022-11-18 19:50:57,190 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 377 transitions, 772 flow [2022-11-18 19:50:57,204 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 322 places, 377 transitions, 772 flow [2022-11-18 19:50:57,205 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:50:57,206 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;@2d2e6001, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:50:57,206 INFO L358 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2022-11-18 19:50:57,210 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-18 19:50:57,210 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:50:57,210 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:50:57,210 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:57,211 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-18 19:50:57,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:57,234 INFO L85 PathProgramCache]: Analyzing trace with hash 204609856, now seen corresponding path program 1 times [2022-11-18 19:50:57,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:57,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084275632] [2022-11-18 19:50:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:57,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:57,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:57,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084275632] [2022-11-18 19:50:57,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084275632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:57,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:57,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:50:57,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759378300] [2022-11-18 19:50:57,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:57,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:50:57,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:57,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:50:57,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:50:57,318 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 377 [2022-11-18 19:50:57,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 377 transitions, 772 flow. Second operand has 4 states, 4 states have (on average 308.5) internal successors, (1234), 4 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:57,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:50:57,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 377 [2022-11-18 19:50:57,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:50:57,529 INFO L130 PetriNetUnfolder]: 17/620 cut-off events. [2022-11-18 19:50:57,530 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-18 19:50:57,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 620 events. 17/620 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3342 event pairs, 0 based on Foata normal form. 125/662 useless extension candidates. Maximal degree in co-relation 409. Up to 19 conditions per place. [2022-11-18 19:50:57,544 INFO L137 encePairwiseOnDemand]: 320/377 looper letters, 19 selfloop transitions, 4 changer transitions 0/330 dead transitions. [2022-11-18 19:50:57,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 330 transitions, 724 flow [2022-11-18 19:50:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:50:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 19:50:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1612 transitions. [2022-11-18 19:50:57,550 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8551724137931035 [2022-11-18 19:50:57,550 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1612 transitions. [2022-11-18 19:50:57,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1612 transitions. [2022-11-18 19:50:57,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:50:57,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1612 transitions. [2022-11-18 19:50:57,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 322.4) internal successors, (1612), 5 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:57,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:57,562 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:57,562 INFO L175 Difference]: Start difference. First operand has 322 places, 377 transitions, 772 flow. Second operand 5 states and 1612 transitions. [2022-11-18 19:50:57,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 330 transitions, 724 flow [2022-11-18 19:50:57,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 330 transitions, 724 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 19:50:57,571 INFO L231 Difference]: Finished difference. Result has 325 places, 326 transitions, 696 flow [2022-11-18 19:50:57,572 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=696, PETRI_PLACES=325, PETRI_TRANSITIONS=326} [2022-11-18 19:50:57,573 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 3 predicate places. [2022-11-18 19:50:57,573 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 326 transitions, 696 flow [2022-11-18 19:50:57,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 308.5) internal successors, (1234), 4 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:57,574 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:50:57,574 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:57,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 19:50:57,575 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-18 19:50:57,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:57,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1033228592, now seen corresponding path program 1 times [2022-11-18 19:50:57,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:57,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347927136] [2022-11-18 19:50:57,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:57,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:50:57,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:57,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347927136] [2022-11-18 19:50:57,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347927136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:57,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:57,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:50:57,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238742383] [2022-11-18 19:50:57,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:57,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:50:57,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:57,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:50:57,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:50:57,624 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 377 [2022-11-18 19:50:57,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 326 transitions, 696 flow. Second operand has 4 states, 4 states have (on average 310.25) internal successors, (1241), 4 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:57,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:50:57,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 377 [2022-11-18 19:50:57,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:50:57,791 INFO L130 PetriNetUnfolder]: 17/619 cut-off events. [2022-11-18 19:50:57,791 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-18 19:50:57,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 619 events. 17/619 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3324 event pairs, 0 based on Foata normal form. 1/540 useless extension candidates. Maximal degree in co-relation 620. Up to 11 conditions per place. [2022-11-18 19:50:57,805 INFO L137 encePairwiseOnDemand]: 371/377 looper letters, 11 selfloop transitions, 8 changer transitions 0/326 dead transitions. [2022-11-18 19:50:57,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 326 transitions, 732 flow [2022-11-18 19:50:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:50:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 19:50:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1552 transitions. [2022-11-18 19:50:57,811 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.823342175066313 [2022-11-18 19:50:57,811 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1552 transitions. [2022-11-18 19:50:57,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1552 transitions. [2022-11-18 19:50:57,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:50:57,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1552 transitions. [2022-11-18 19:50:57,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 310.4) internal successors, (1552), 5 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:57,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:57,822 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:57,822 INFO L175 Difference]: Start difference. First operand has 325 places, 326 transitions, 696 flow. Second operand 5 states and 1552 transitions. [2022-11-18 19:50:57,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 326 transitions, 732 flow [2022-11-18 19:50:57,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 326 transitions, 730 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 19:50:57,830 INFO L231 Difference]: Finished difference. Result has 328 places, 326 transitions, 714 flow [2022-11-18 19:50:57,831 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=714, PETRI_PLACES=328, PETRI_TRANSITIONS=326} [2022-11-18 19:50:57,832 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 6 predicate places. [2022-11-18 19:50:57,832 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 326 transitions, 714 flow [2022-11-18 19:50:57,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 310.25) internal successors, (1241), 4 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:57,833 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:50:57,833 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:57,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 19:50:57,833 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-18 19:50:57,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:57,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1965314162, now seen corresponding path program 1 times [2022-11-18 19:50:57,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:57,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871868923] [2022-11-18 19:50:57,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:57,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:57,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:57,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871868923] [2022-11-18 19:50:57,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871868923] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:50:57,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162288555] [2022-11-18 19:50:57,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:57,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:50:57,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:50:57,915 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:50:57,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 19:50:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:58,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 19:50:58,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:50:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:58,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:50:58,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162288555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:58,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:50:58,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-18 19:50:58,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214354284] [2022-11-18 19:50:58,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:58,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:50:58,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:58,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:50:58,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:50:58,113 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 377 [2022-11-18 19:50:58,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 326 transitions, 714 flow. Second operand has 5 states, 5 states have (on average 309.8) internal successors, (1549), 5 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:58,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:50:58,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 377 [2022-11-18 19:50:58,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:50:58,275 INFO L130 PetriNetUnfolder]: 17/618 cut-off events. [2022-11-18 19:50:58,275 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-11-18 19:50:58,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 618 events. 17/618 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3329 event pairs, 0 based on Foata normal form. 1/539 useless extension candidates. Maximal degree in co-relation 618. Up to 14 conditions per place. [2022-11-18 19:50:58,289 INFO L137 encePairwiseOnDemand]: 373/377 looper letters, 13 selfloop transitions, 5 changer transitions 0/325 dead transitions. [2022-11-18 19:50:58,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 325 transitions, 746 flow [2022-11-18 19:50:58,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:50:58,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-18 19:50:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1243 transitions. [2022-11-18 19:50:58,294 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8242705570291777 [2022-11-18 19:50:58,294 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1243 transitions. [2022-11-18 19:50:58,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1243 transitions. [2022-11-18 19:50:58,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:50:58,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1243 transitions. [2022-11-18 19:50:58,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 310.75) internal successors, (1243), 4 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:58,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:58,302 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:58,302 INFO L175 Difference]: Start difference. First operand has 328 places, 326 transitions, 714 flow. Second operand 4 states and 1243 transitions. [2022-11-18 19:50:58,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 325 transitions, 746 flow [2022-11-18 19:50:58,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 325 transitions, 734 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 19:50:58,310 INFO L231 Difference]: Finished difference. Result has 327 places, 325 transitions, 708 flow [2022-11-18 19:50:58,311 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=708, PETRI_PLACES=327, PETRI_TRANSITIONS=325} [2022-11-18 19:50:58,312 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 5 predicate places. [2022-11-18 19:50:58,312 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 325 transitions, 708 flow [2022-11-18 19:50:58,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 309.8) internal successors, (1549), 5 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:58,313 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:50:58,313 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:58,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 19:50:58,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-18 19:50:58,529 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-18 19:50:58,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:58,529 INFO L85 PathProgramCache]: Analyzing trace with hash -417133539, now seen corresponding path program 1 times [2022-11-18 19:50:58,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:58,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700015937] [2022-11-18 19:50:58,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:58,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:58,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:58,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700015937] [2022-11-18 19:50:58,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700015937] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:50:58,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371772206] [2022-11-18 19:50:58,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:58,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:50:58,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:50:58,591 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:50:58,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 19:50:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:58,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 19:50:58,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:50:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:58,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:50:58,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:58,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371772206] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:50:58,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:50:58,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-18 19:50:58,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494775216] [2022-11-18 19:50:58,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:50:58,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 19:50:58,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:58,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 19:50:58,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:50:58,784 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 377 [2022-11-18 19:50:58,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 325 transitions, 708 flow. Second operand has 10 states, 10 states have (on average 309.7) internal successors, (3097), 10 states have internal predecessors, (3097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:58,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:50:58,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 377 [2022-11-18 19:50:58,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:50:59,014 INFO L130 PetriNetUnfolder]: 17/626 cut-off events. [2022-11-18 19:50:59,014 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-18 19:50:59,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 626 events. 17/626 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3301 event pairs, 0 based on Foata normal form. 2/548 useless extension candidates. Maximal degree in co-relation 608. Up to 11 conditions per place. [2022-11-18 19:50:59,036 INFO L137 encePairwiseOnDemand]: 371/377 looper letters, 20 selfloop transitions, 9 changer transitions 0/336 dead transitions. [2022-11-18 19:50:59,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 336 transitions, 804 flow [2022-11-18 19:50:59,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:50:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 19:50:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2794 transitions. [2022-11-18 19:50:59,046 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8234600648393752 [2022-11-18 19:50:59,047 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2794 transitions. [2022-11-18 19:50:59,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2794 transitions. [2022-11-18 19:50:59,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:50:59,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2794 transitions. [2022-11-18 19:50:59,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 310.44444444444446) internal successors, (2794), 9 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:59,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 377.0) internal successors, (3770), 10 states have internal predecessors, (3770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:59,065 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 377.0) internal successors, (3770), 10 states have internal predecessors, (3770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:59,065 INFO L175 Difference]: Start difference. First operand has 327 places, 325 transitions, 708 flow. Second operand 9 states and 2794 transitions. [2022-11-18 19:50:59,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 336 transitions, 804 flow [2022-11-18 19:50:59,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 336 transitions, 790 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 19:50:59,073 INFO L231 Difference]: Finished difference. Result has 336 places, 329 transitions, 754 flow [2022-11-18 19:50:59,074 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=754, PETRI_PLACES=336, PETRI_TRANSITIONS=329} [2022-11-18 19:50:59,075 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 14 predicate places. [2022-11-18 19:50:59,075 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 329 transitions, 754 flow [2022-11-18 19:50:59,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 309.7) internal successors, (3097), 10 states have internal predecessors, (3097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:59,076 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:50:59,077 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:59,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 19:50:59,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:50:59,283 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-18 19:50:59,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:59,283 INFO L85 PathProgramCache]: Analyzing trace with hash 679389725, now seen corresponding path program 2 times [2022-11-18 19:50:59,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:59,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215869481] [2022-11-18 19:50:59,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:59,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 19:50:59,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:59,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215869481] [2022-11-18 19:50:59,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215869481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:59,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:59,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:50:59,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327441689] [2022-11-18 19:50:59,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:59,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:50:59,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:59,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:50:59,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:50:59,367 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 377 [2022-11-18 19:50:59,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 329 transitions, 754 flow. Second operand has 4 states, 4 states have (on average 308.75) internal successors, (1235), 4 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:59,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:50:59,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 377 [2022-11-18 19:50:59,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:50:59,529 INFO L130 PetriNetUnfolder]: 13/510 cut-off events. [2022-11-18 19:50:59,529 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-18 19:50:59,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 510 events. 13/510 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2452 event pairs, 0 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 514. Up to 21 conditions per place. [2022-11-18 19:50:59,542 INFO L137 encePairwiseOnDemand]: 370/377 looper letters, 19 selfloop transitions, 4 changer transitions 0/336 dead transitions. [2022-11-18 19:50:59,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 336 transitions, 814 flow [2022-11-18 19:50:59,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:50:59,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 19:50:59,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1561 transitions. [2022-11-18 19:50:59,546 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8281167108753316 [2022-11-18 19:50:59,546 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1561 transitions. [2022-11-18 19:50:59,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1561 transitions. [2022-11-18 19:50:59,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:50:59,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1561 transitions. [2022-11-18 19:50:59,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 312.2) internal successors, (1561), 5 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:59,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:59,555 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:59,556 INFO L175 Difference]: Start difference. First operand has 336 places, 329 transitions, 754 flow. Second operand 5 states and 1561 transitions. [2022-11-18 19:50:59,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 336 transitions, 814 flow [2022-11-18 19:50:59,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 336 transitions, 798 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-18 19:50:59,564 INFO L231 Difference]: Finished difference. Result has 339 places, 332 transitions, 770 flow [2022-11-18 19:50:59,565 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=770, PETRI_PLACES=339, PETRI_TRANSITIONS=332} [2022-11-18 19:50:59,566 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 17 predicate places. [2022-11-18 19:50:59,566 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 332 transitions, 770 flow [2022-11-18 19:50:59,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 308.75) internal successors, (1235), 4 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:59,567 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:50:59,567 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:59,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 19:50:59,568 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-18 19:50:59,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:59,568 INFO L85 PathProgramCache]: Analyzing trace with hash -705075548, now seen corresponding path program 1 times [2022-11-18 19:50:59,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:59,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635565879] [2022-11-18 19:50:59,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:59,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-18 19:50:59,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:59,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635565879] [2022-11-18 19:50:59,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635565879] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:59,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:59,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:50:59,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613312696] [2022-11-18 19:50:59,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:59,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:50:59,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:59,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:50:59,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:50:59,631 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 377 [2022-11-18 19:50:59,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 332 transitions, 770 flow. Second operand has 4 states, 4 states have (on average 310.75) internal successors, (1243), 4 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:59,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:50:59,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 377 [2022-11-18 19:50:59,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:50:59,797 INFO L130 PetriNetUnfolder]: 13/509 cut-off events. [2022-11-18 19:50:59,797 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-11-18 19:50:59,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 509 events. 13/509 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2443 event pairs, 0 based on Foata normal form. 1/452 useless extension candidates. Maximal degree in co-relation 521. Up to 10 conditions per place. [2022-11-18 19:50:59,809 INFO L137 encePairwiseOnDemand]: 371/377 looper letters, 11 selfloop transitions, 8 changer transitions 0/332 dead transitions. [2022-11-18 19:50:59,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 332 transitions, 806 flow [2022-11-18 19:50:59,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:50:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 19:50:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1552 transitions. [2022-11-18 19:50:59,813 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.823342175066313 [2022-11-18 19:50:59,814 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1552 transitions. [2022-11-18 19:50:59,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1552 transitions. [2022-11-18 19:50:59,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:50:59,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1552 transitions. [2022-11-18 19:50:59,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 310.4) internal successors, (1552), 5 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:59,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:59,822 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:59,822 INFO L175 Difference]: Start difference. First operand has 339 places, 332 transitions, 770 flow. Second operand 5 states and 1552 transitions. [2022-11-18 19:50:59,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 332 transitions, 806 flow [2022-11-18 19:50:59,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 332 transitions, 804 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 19:50:59,831 INFO L231 Difference]: Finished difference. Result has 342 places, 332 transitions, 788 flow [2022-11-18 19:50:59,832 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=788, PETRI_PLACES=342, PETRI_TRANSITIONS=332} [2022-11-18 19:50:59,833 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 20 predicate places. [2022-11-18 19:50:59,833 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 332 transitions, 788 flow [2022-11-18 19:50:59,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 310.75) internal successors, (1243), 4 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:59,834 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:50:59,834 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:59,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 19:50:59,834 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-18 19:50:59,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:59,835 INFO L85 PathProgramCache]: Analyzing trace with hash -382504469, now seen corresponding path program 1 times [2022-11-18 19:50:59,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:59,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263436052] [2022-11-18 19:50:59,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:59,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 19:50:59,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:59,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263436052] [2022-11-18 19:50:59,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263436052] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:50:59,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738531562] [2022-11-18 19:50:59,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:59,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:50:59,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:50:59,997 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:51:00,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 19:51:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:00,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 19:51:00,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:51:00,190 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 19:51:00,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:51:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 19:51:00,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738531562] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:51:00,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:51:00,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-18 19:51:00,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254024185] [2022-11-18 19:51:00,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:51:00,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 19:51:00,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:00,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 19:51:00,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-18 19:51:00,324 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 377 [2022-11-18 19:51:00,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 332 transitions, 788 flow. Second operand has 18 states, 18 states have (on average 310.1111111111111) internal successors, (5582), 18 states have internal predecessors, (5582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:00,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:00,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 377 [2022-11-18 19:51:00,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:00,746 INFO L130 PetriNetUnfolder]: 13/537 cut-off events. [2022-11-18 19:51:00,746 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-11-18 19:51:00,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 537 events. 13/537 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2447 event pairs, 0 based on Foata normal form. 4/483 useless extension candidates. Maximal degree in co-relation 515. Up to 11 conditions per place. [2022-11-18 19:51:00,758 INFO L137 encePairwiseOnDemand]: 371/377 looper letters, 36 selfloop transitions, 21 changer transitions 0/367 dead transitions. [2022-11-18 19:51:00,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 367 transitions, 1056 flow [2022-11-18 19:51:00,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 19:51:00,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-18 19:51:00,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6508 transitions. [2022-11-18 19:51:00,769 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8220285461664772 [2022-11-18 19:51:00,769 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 6508 transitions. [2022-11-18 19:51:00,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 6508 transitions. [2022-11-18 19:51:00,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:00,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 6508 transitions. [2022-11-18 19:51:00,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 309.9047619047619) internal successors, (6508), 21 states have internal predecessors, (6508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:00,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 377.0) internal successors, (8294), 22 states have internal predecessors, (8294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:00,803 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 377.0) internal successors, (8294), 22 states have internal predecessors, (8294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:00,803 INFO L175 Difference]: Start difference. First operand has 342 places, 332 transitions, 788 flow. Second operand 21 states and 6508 transitions. [2022-11-18 19:51:00,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 367 transitions, 1056 flow [2022-11-18 19:51:00,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 367 transitions, 1044 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 19:51:00,813 INFO L231 Difference]: Finished difference. Result has 364 places, 345 transitions, 932 flow [2022-11-18 19:51:00,813 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=932, PETRI_PLACES=364, PETRI_TRANSITIONS=345} [2022-11-18 19:51:00,814 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 42 predicate places. [2022-11-18 19:51:00,814 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 345 transitions, 932 flow [2022-11-18 19:51:00,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 310.1111111111111) internal successors, (5582), 18 states have internal predecessors, (5582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:00,816 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:00,817 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:00,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 19:51:01,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 19:51:01,023 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-18 19:51:01,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:01,024 INFO L85 PathProgramCache]: Analyzing trace with hash -514640405, now seen corresponding path program 2 times [2022-11-18 19:51:01,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:01,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755107383] [2022-11-18 19:51:01,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:01,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 19:51:01,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:01,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755107383] [2022-11-18 19:51:01,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755107383] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:51:01,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339094885] [2022-11-18 19:51:01,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:51:01,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:51:01,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:51:01,448 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:51:01,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 19:51:01,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:51:01,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:51:01,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 19:51:01,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:51:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 19:51:01,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:51:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 19:51:01,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339094885] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:51:01,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:51:01,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-18 19:51:01,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379117633] [2022-11-18 19:51:01,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:51:01,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 19:51:01,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:01,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 19:51:01,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-18 19:51:02,006 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 377 [2022-11-18 19:51:02,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 345 transitions, 932 flow. Second operand has 23 states, 23 states have (on average 310.3478260869565) internal successors, (7138), 23 states have internal predecessors, (7138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:02,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:02,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 377 [2022-11-18 19:51:02,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:02,598 INFO L130 PetriNetUnfolder]: 13/558 cut-off events. [2022-11-18 19:51:02,598 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2022-11-18 19:51:02,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 558 events. 13/558 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2448 event pairs, 0 based on Foata normal form. 3/503 useless extension candidates. Maximal degree in co-relation 572. Up to 12 conditions per place. [2022-11-18 19:51:02,611 INFO L137 encePairwiseOnDemand]: 371/377 looper letters, 48 selfloop transitions, 30 changer transitions 0/388 dead transitions. [2022-11-18 19:51:02,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 388 transitions, 1298 flow [2022-11-18 19:51:02,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-18 19:51:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-18 19:51:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9291 transitions. [2022-11-18 19:51:02,625 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8214854111405836 [2022-11-18 19:51:02,626 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 9291 transitions. [2022-11-18 19:51:02,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 9291 transitions. [2022-11-18 19:51:02,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:02,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 9291 transitions. [2022-11-18 19:51:02,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 309.7) internal successors, (9291), 30 states have internal predecessors, (9291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:02,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 377.0) internal successors, (11687), 31 states have internal predecessors, (11687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:02,668 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 377.0) internal successors, (11687), 31 states have internal predecessors, (11687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:02,668 INFO L175 Difference]: Start difference. First operand has 364 places, 345 transitions, 932 flow. Second operand 30 states and 9291 transitions. [2022-11-18 19:51:02,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 388 transitions, 1298 flow [2022-11-18 19:51:02,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 388 transitions, 1218 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-18 19:51:02,679 INFO L231 Difference]: Finished difference. Result has 389 places, 355 transitions, 1030 flow [2022-11-18 19:51:02,680 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1030, PETRI_PLACES=389, PETRI_TRANSITIONS=355} [2022-11-18 19:51:02,681 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 67 predicate places. [2022-11-18 19:51:02,681 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 355 transitions, 1030 flow [2022-11-18 19:51:02,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 310.3478260869565) internal successors, (7138), 23 states have internal predecessors, (7138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:02,683 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:02,683 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:02,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 19:51:02,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 19:51:02,890 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-18 19:51:02,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:02,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2125618267, now seen corresponding path program 3 times [2022-11-18 19:51:02,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:02,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048764330] [2022-11-18 19:51:02,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:02,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-18 19:51:03,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:03,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048764330] [2022-11-18 19:51:03,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048764330] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:51:03,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493983765] [2022-11-18 19:51:03,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 19:51:03,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:51:03,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:51:03,104 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:51:03,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 19:51:03,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-18 19:51:03,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:51:03,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 19:51:03,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:51:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-18 19:51:03,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:51:03,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493983765] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:51:03,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:51:03,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-18 19:51:03,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365794581] [2022-11-18 19:51:03,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:51:03,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:51:03,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:03,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:51:03,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:51:03,338 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 377 [2022-11-18 19:51:03,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 355 transitions, 1030 flow. Second operand has 5 states, 5 states have (on average 310.2) internal successors, (1551), 5 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:03,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:03,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 377 [2022-11-18 19:51:03,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:03,557 INFO L130 PetriNetUnfolder]: 13/557 cut-off events. [2022-11-18 19:51:03,557 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-11-18 19:51:03,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 557 events. 13/557 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2435 event pairs, 0 based on Foata normal form. 1/500 useless extension candidates. Maximal degree in co-relation 530. Up to 17 conditions per place. [2022-11-18 19:51:03,569 INFO L137 encePairwiseOnDemand]: 373/377 looper letters, 13 selfloop transitions, 5 changer transitions 0/354 dead transitions. [2022-11-18 19:51:03,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 354 transitions, 1062 flow [2022-11-18 19:51:03,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:51:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-18 19:51:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1243 transitions. [2022-11-18 19:51:03,572 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8242705570291777 [2022-11-18 19:51:03,573 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1243 transitions. [2022-11-18 19:51:03,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1243 transitions. [2022-11-18 19:51:03,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:03,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1243 transitions. [2022-11-18 19:51:03,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 310.75) internal successors, (1243), 4 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:03,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:03,583 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:03,584 INFO L175 Difference]: Start difference. First operand has 389 places, 355 transitions, 1030 flow. Second operand 4 states and 1243 transitions. [2022-11-18 19:51:03,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 354 transitions, 1062 flow [2022-11-18 19:51:03,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 354 transitions, 1016 flow, removed 5 selfloop flow, removed 18 redundant places. [2022-11-18 19:51:03,595 INFO L231 Difference]: Finished difference. Result has 373 places, 354 transitions, 990 flow [2022-11-18 19:51:03,595 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=990, PETRI_PLACES=373, PETRI_TRANSITIONS=354} [2022-11-18 19:51:03,596 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 51 predicate places. [2022-11-18 19:51:03,596 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 354 transitions, 990 flow [2022-11-18 19:51:03,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 310.2) internal successors, (1551), 5 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:03,597 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:03,597 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:03,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-18 19:51:03,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:51:03,804 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-18 19:51:03,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:03,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1096350380, now seen corresponding path program 1 times [2022-11-18 19:51:03,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:03,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215124962] [2022-11-18 19:51:03,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:03,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-18 19:51:04,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:04,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215124962] [2022-11-18 19:51:04,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215124962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:51:04,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:51:04,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 19:51:04,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807065587] [2022-11-18 19:51:04,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:51:04,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 19:51:04,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:04,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 19:51:04,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:51:04,459 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 377 [2022-11-18 19:51:04,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 354 transitions, 990 flow. Second operand has 11 states, 11 states have (on average 266.3636363636364) internal successors, (2930), 11 states have internal predecessors, (2930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:04,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:04,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 377 [2022-11-18 19:51:04,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:15,186 INFO L130 PetriNetUnfolder]: 11432/43314 cut-off events. [2022-11-18 19:51:15,186 INFO L131 PetriNetUnfolder]: For 774/784 co-relation queries the response was YES. [2022-11-18 19:51:15,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60093 conditions, 43314 events. 11432/43314 cut-off events. For 774/784 co-relation queries the response was YES. Maximal size of possible extension queue 1363. Compared 602310 event pairs, 1828 based on Foata normal form. 1/37372 useless extension candidates. Maximal degree in co-relation 59826. Up to 8352 conditions per place. [2022-11-18 19:51:15,983 INFO L137 encePairwiseOnDemand]: 357/377 looper letters, 320 selfloop transitions, 71 changer transitions 0/686 dead transitions. [2022-11-18 19:51:15,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 686 transitions, 2517 flow [2022-11-18 19:51:15,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 19:51:15,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-18 19:51:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 6739 transitions. [2022-11-18 19:51:15,999 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7448054818744474 [2022-11-18 19:51:15,999 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 6739 transitions. [2022-11-18 19:51:15,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 6739 transitions. [2022-11-18 19:51:16,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:16,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 6739 transitions. [2022-11-18 19:51:16,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 280.7916666666667) internal successors, (6739), 24 states have internal predecessors, (6739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:16,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 377.0) internal successors, (9425), 25 states have internal predecessors, (9425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:16,031 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 377.0) internal successors, (9425), 25 states have internal predecessors, (9425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:16,031 INFO L175 Difference]: Start difference. First operand has 373 places, 354 transitions, 990 flow. Second operand 24 states and 6739 transitions. [2022-11-18 19:51:16,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 686 transitions, 2517 flow [2022-11-18 19:51:16,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 686 transitions, 2507 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 19:51:16,053 INFO L231 Difference]: Finished difference. Result has 411 places, 440 transitions, 1548 flow [2022-11-18 19:51:16,054 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1548, PETRI_PLACES=411, PETRI_TRANSITIONS=440} [2022-11-18 19:51:16,054 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 89 predicate places. [2022-11-18 19:51:16,055 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 440 transitions, 1548 flow [2022-11-18 19:51:16,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 266.3636363636364) internal successors, (2930), 11 states have internal predecessors, (2930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:16,056 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:16,056 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:16,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 19:51:16,057 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-18 19:51:16,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:16,057 INFO L85 PathProgramCache]: Analyzing trace with hash 255317849, now seen corresponding path program 1 times [2022-11-18 19:51:16,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:16,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297186509] [2022-11-18 19:51:16,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:16,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-18 19:51:16,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:16,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297186509] [2022-11-18 19:51:16,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297186509] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:51:16,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859018999] [2022-11-18 19:51:16,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:16,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:51:16,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:51:16,199 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:51:16,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 19:51:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:16,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 19:51:16,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:51:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2022-11-18 19:51:16,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:51:16,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859018999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:51:16,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:51:16,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-18 19:51:16,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663795783] [2022-11-18 19:51:16,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:51:16,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:51:16,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:16,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:51:16,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:51:16,387 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 377 [2022-11-18 19:51:16,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 440 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:16,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:16,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 377 [2022-11-18 19:51:16,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:17,790 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1308] t_funEXIT-->L958-4: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#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~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_7|} AuxVars[] AssignedVars[][380], [t_funThread1of2ForFork0NotInUse, Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), 2296#true, t_funThread2of2ForFork0NotInUse, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 744#true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 268#L958-4true, Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-18 19:51:17,790 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-18 19:51:17,790 INFO L386 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-11-18 19:51:17,790 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 19:51:17,790 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 19:51:18,049 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1308] t_funEXIT-->L958-4: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#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~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_7|} AuxVars[] AssignedVars[][380], [t_funThread1of2ForFork0NotInUse, 2296#true, Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), 18#t_funENTRYtrue, t_funThread2of2ForFork0InUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 744#true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 268#L958-4true, Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-18 19:51:18,049 INFO L383 tUnfolder$Statistics]: this new event has 234 ancestors and is cut-off event [2022-11-18 19:51:18,050 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 19:51:18,050 INFO L386 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-11-18 19:51:18,050 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 19:51:18,060 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] t_funEXIT-->L958-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][414], [Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), 2296#true, t_funThread1of2ForFork0InUse, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0NotInUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 744#true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 268#L958-4true, Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), 249#t_funENTRYtrue, Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-18 19:51:18,061 INFO L383 tUnfolder$Statistics]: this new event has 234 ancestors and is cut-off event [2022-11-18 19:51:18,061 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-18 19:51:18,061 INFO L386 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-11-18 19:51:18,061 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 19:51:18,143 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] t_funEXIT-->L958-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][414], [Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread1of2ForFork0InUse, 2296#true, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0NotInUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 744#true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, 37#L947-2true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 268#L958-4true, Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-18 19:51:18,143 INFO L383 tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event [2022-11-18 19:51:18,143 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 19:51:18,143 INFO L386 tUnfolder$Statistics]: existing Event has 228 ancestors and is cut-off event [2022-11-18 19:51:18,143 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-18 19:51:18,358 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1308] t_funEXIT-->L958-4: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#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~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_7|} AuxVars[] AssignedVars[][380], [t_funThread1of2ForFork0NotInUse, Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), 2296#true, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0InUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 744#true, 231#L941-10true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 268#L958-4true, Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-18 19:51:18,358 INFO L383 tUnfolder$Statistics]: this new event has 243 ancestors and is cut-off event [2022-11-18 19:51:18,359 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-18 19:51:18,359 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-18 19:51:18,359 INFO L386 tUnfolder$Statistics]: existing Event has 255 ancestors and is cut-off event [2022-11-18 19:51:18,360 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] t_funEXIT-->L958-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][414], [Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread1of2ForFork0InUse, 2296#true, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0NotInUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 744#true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 14#L940true, Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 268#L958-4true, Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-18 19:51:18,360 INFO L383 tUnfolder$Statistics]: this new event has 242 ancestors and is cut-off event [2022-11-18 19:51:18,360 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-18 19:51:18,360 INFO L386 tUnfolder$Statistics]: existing Event has 230 ancestors and is cut-off event [2022-11-18 19:51:18,360 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-18 19:51:18,440 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] t_funEXIT-->L958-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][414], [t_funThread1of2ForFork0NotInUse, Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), 2296#true, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0NotInUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 744#true, 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 268#L958-4true, Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-18 19:51:18,441 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-18 19:51:18,441 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 19:51:18,441 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-18 19:51:18,441 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-18 19:51:18,500 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([891] L954-17-->L954-18: Formula: (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t_ids~0#1.base_5| 0)) InVars {ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid][376], [t_funThread1of2ForFork0NotInUse, Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), 2296#true, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0InUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 2230#(= 3 |~#cache~0.base|), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 744#true, 231#L941-10true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 12#L954-18true, 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-18 19:51:18,500 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-18 19:51:18,500 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 19:51:18,500 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 19:51:18,500 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-18 19:51:18,501 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1309] t_funEXIT-->L958-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][414], [t_funThread1of2ForFork0NotInUse, Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), 2296#true, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0NotInUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 744#true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 268#L958-4true, Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-18 19:51:18,501 INFO L383 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-11-18 19:51:18,501 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-18 19:51:18,501 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 19:51:18,501 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-18 19:51:18,501 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-18 19:51:18,542 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] t_funEXIT-->L958-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][414], [Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), 2296#true, t_funThread1of2ForFork0InUse, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0NotInUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 744#true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 97#L941-6true, Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 268#L958-4true, Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-18 19:51:18,543 INFO L383 tUnfolder$Statistics]: this new event has 251 ancestors and is cut-off event [2022-11-18 19:51:18,543 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-18 19:51:18,543 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-18 19:51:18,543 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-18 19:51:18,734 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1150] L947-1-->L947-2: Formula: (and (= (+ (* |v_t_funThread1of2ForFork0_~i~0#1_9| 28) |v_~#cache~0.offset_9|) |v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset_1|) (= |v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base_1| |v_~#cache~0.base_10|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_9|, ~#cache~0.base=|v_~#cache~0.base_10|, t_funThread1of2ForFork0_~i~0#1=|v_t_funThread1of2ForFork0_~i~0#1_9|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_9|, ~#cache~0.base=|v_~#cache~0.base_10|, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base=|v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base_1|, t_funThread1of2ForFork0_~i~0#1=|v_t_funThread1of2ForFork0_~i~0#1_9|, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset=|v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset_1|} AuxVars[] AssignedVars[t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base][202], [Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread1of2ForFork0InUse, 2296#true, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0InUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 283#L959true, 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 744#true, 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 231#L941-10true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, 37#L947-2true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-18 19:51:18,734 INFO L383 tUnfolder$Statistics]: this new event has 244 ancestors and is cut-off event [2022-11-18 19:51:18,734 INFO L386 tUnfolder$Statistics]: existing Event has 232 ancestors and is cut-off event [2022-11-18 19:51:18,735 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-18 19:51:18,735 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-18 19:51:18,834 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([891] L954-17-->L954-18: Formula: (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t_ids~0#1.base_5| 0)) InVars {ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid][376], [Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread1of2ForFork0InUse, 2296#true, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0NotInUse, 154#L941-10true, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 2230#(= 3 |~#cache~0.base|), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 744#true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 12#L954-18true, 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-18 19:51:18,834 INFO L383 tUnfolder$Statistics]: this new event has 264 ancestors and is cut-off event [2022-11-18 19:51:18,835 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-18 19:51:18,835 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-18 19:51:18,835 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 19:51:18,835 INFO L130 PetriNetUnfolder]: 663/7652 cut-off events. [2022-11-18 19:51:18,835 INFO L131 PetriNetUnfolder]: For 3530/3732 co-relation queries the response was YES. [2022-11-18 19:51:18,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10481 conditions, 7652 events. 663/7652 cut-off events. For 3530/3732 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 83652 event pairs, 79 based on Foata normal form. 25/6631 useless extension candidates. Maximal degree in co-relation 10285. Up to 251 conditions per place. [2022-11-18 19:51:19,188 INFO L137 encePairwiseOnDemand]: 374/377 looper letters, 14 selfloop transitions, 2 changer transitions 0/444 dead transitions. [2022-11-18 19:51:19,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 444 transitions, 1588 flow [2022-11-18 19:51:19,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:51:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:51:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 950 transitions. [2022-11-18 19:51:19,195 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8399646330680813 [2022-11-18 19:51:19,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 950 transitions. [2022-11-18 19:51:19,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 950 transitions. [2022-11-18 19:51:19,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:19,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 950 transitions. [2022-11-18 19:51:19,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 316.6666666666667) internal successors, (950), 3 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:19,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 377.0) internal successors, (1508), 4 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:19,200 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 377.0) internal successors, (1508), 4 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:19,201 INFO L175 Difference]: Start difference. First operand has 411 places, 440 transitions, 1548 flow. Second operand 3 states and 950 transitions. [2022-11-18 19:51:19,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 444 transitions, 1588 flow [2022-11-18 19:51:19,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 444 transitions, 1587 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 19:51:19,244 INFO L231 Difference]: Finished difference. Result has 413 places, 441 transitions, 1559 flow [2022-11-18 19:51:19,244 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=1547, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1559, PETRI_PLACES=413, PETRI_TRANSITIONS=441} [2022-11-18 19:51:19,245 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 91 predicate places. [2022-11-18 19:51:19,245 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 441 transitions, 1559 flow [2022-11-18 19:51:19,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:19,246 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:19,246 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:19,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 19:51:19,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:51:19,452 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-18 19:51:19,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:19,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1911635379, now seen corresponding path program 1 times [2022-11-18 19:51:19,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:19,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290925353] [2022-11-18 19:51:19,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:19,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:51:19,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 19:51:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:51:19,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 19:51:19,547 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 19:51:19,547 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 35 remaining) [2022-11-18 19:51:19,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 35 remaining) [2022-11-18 19:51:19,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 35 remaining) [2022-11-18 19:51:19,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 35 remaining) [2022-11-18 19:51:19,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 35 remaining) [2022-11-18 19:51:19,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 35 remaining) [2022-11-18 19:51:19,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 35 remaining) [2022-11-18 19:51:19,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 35 remaining) [2022-11-18 19:51:19,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 35 remaining) [2022-11-18 19:51:19,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 35 remaining) [2022-11-18 19:51:19,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 35 remaining) [2022-11-18 19:51:19,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 35 remaining) [2022-11-18 19:51:19,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 35 remaining) [2022-11-18 19:51:19,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 35 remaining) [2022-11-18 19:51:19,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 35 remaining) [2022-11-18 19:51:19,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 35 remaining) [2022-11-18 19:51:19,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 35 remaining) [2022-11-18 19:51:19,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 35 remaining) [2022-11-18 19:51:19,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 35 remaining) [2022-11-18 19:51:19,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 35 remaining) [2022-11-18 19:51:19,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 35 remaining) [2022-11-18 19:51:19,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 35 remaining) [2022-11-18 19:51:19,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 35 remaining) [2022-11-18 19:51:19,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 35 remaining) [2022-11-18 19:51:19,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 35 remaining) [2022-11-18 19:51:19,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 35 remaining) [2022-11-18 19:51:19,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 35 remaining) [2022-11-18 19:51:19,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 35 remaining) [2022-11-18 19:51:19,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 35 remaining) [2022-11-18 19:51:19,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 35 remaining) [2022-11-18 19:51:19,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 35 remaining) [2022-11-18 19:51:19,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 35 remaining) [2022-11-18 19:51:19,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 35 remaining) [2022-11-18 19:51:19,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 35 remaining) [2022-11-18 19:51:19,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 35 remaining) [2022-11-18 19:51:19,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-18 19:51:19,558 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:19,559 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-18 19:51:19,559 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-18 19:51:19,625 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-18 19:51:19,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 393 places, 461 transitions, 952 flow [2022-11-18 19:51:19,864 INFO L130 PetriNetUnfolder]: 168/1038 cut-off events. [2022-11-18 19:51:19,864 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-18 19:51:19,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 1038 events. 168/1038 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5994 event pairs, 1 based on Foata normal form. 0/786 useless extension candidates. Maximal degree in co-relation 730. Up to 16 conditions per place. [2022-11-18 19:51:19,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 393 places, 461 transitions, 952 flow [2022-11-18 19:51:19,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 393 places, 461 transitions, 952 flow [2022-11-18 19:51:19,918 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:51:19,918 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2d2e6001, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:51:19,919 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-11-18 19:51:19,922 INFO L130 PetriNetUnfolder]: 1/30 cut-off events. [2022-11-18 19:51:19,922 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:51:19,922 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:19,922 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:19,922 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-18 19:51:19,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:19,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1444119021, now seen corresponding path program 1 times [2022-11-18 19:51:19,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:19,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862211209] [2022-11-18 19:51:19,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:19,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:19,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:51:19,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:19,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862211209] [2022-11-18 19:51:19,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862211209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:51:19,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:51:19,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:51:19,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865341225] [2022-11-18 19:51:19,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:51:19,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:51:19,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:19,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:51:19,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:51:19,977 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 461 [2022-11-18 19:51:19,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 461 transitions, 952 flow. Second operand has 4 states, 4 states have (on average 377.5) internal successors, (1510), 4 states have internal predecessors, (1510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:19,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:19,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 461 [2022-11-18 19:51:19,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:20,362 INFO L130 PetriNetUnfolder]: 27/893 cut-off events. [2022-11-18 19:51:20,363 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-18 19:51:20,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 893 events. 27/893 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5178 event pairs, 1 based on Foata normal form. 255/1026 useless extension candidates. Maximal degree in co-relation 653. Up to 28 conditions per place. [2022-11-18 19:51:20,383 INFO L137 encePairwiseOnDemand]: 392/461 looper letters, 21 selfloop transitions, 4 changer transitions 0/401 dead transitions. [2022-11-18 19:51:20,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 401 transitions, 882 flow [2022-11-18 19:51:20,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:51:20,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 19:51:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1971 transitions. [2022-11-18 19:51:20,387 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8550976138828633 [2022-11-18 19:51:20,388 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1971 transitions. [2022-11-18 19:51:20,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1971 transitions. [2022-11-18 19:51:20,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:20,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1971 transitions. [2022-11-18 19:51:20,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 394.2) internal successors, (1971), 5 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:20,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:20,396 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:20,396 INFO L175 Difference]: Start difference. First operand has 393 places, 461 transitions, 952 flow. Second operand 5 states and 1971 transitions. [2022-11-18 19:51:20,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 401 transitions, 882 flow [2022-11-18 19:51:20,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 401 transitions, 882 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 19:51:20,404 INFO L231 Difference]: Finished difference. Result has 395 places, 397 transitions, 850 flow [2022-11-18 19:51:20,405 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=850, PETRI_PLACES=395, PETRI_TRANSITIONS=397} [2022-11-18 19:51:20,406 INFO L288 CegarLoopForPetriNet]: 393 programPoint places, 2 predicate places. [2022-11-18 19:51:20,406 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 397 transitions, 850 flow [2022-11-18 19:51:20,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 377.5) internal successors, (1510), 4 states have internal predecessors, (1510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:20,408 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:20,409 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:20,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-18 19:51:20,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-18 19:51:20,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash -431308176, now seen corresponding path program 1 times [2022-11-18 19:51:20,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:20,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833816729] [2022-11-18 19:51:20,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:20,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:51:20,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:20,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833816729] [2022-11-18 19:51:20,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833816729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:51:20,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:51:20,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:51:20,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053032127] [2022-11-18 19:51:20,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:51:20,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:51:20,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:20,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:51:20,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:51:20,455 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 461 [2022-11-18 19:51:20,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 397 transitions, 850 flow. Second operand has 4 states, 4 states have (on average 379.25) internal successors, (1517), 4 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:20,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:20,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 461 [2022-11-18 19:51:20,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:20,717 INFO L130 PetriNetUnfolder]: 27/892 cut-off events. [2022-11-18 19:51:20,717 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-11-18 19:51:20,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 892 events. 27/892 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5168 event pairs, 1 based on Foata normal form. 1/774 useless extension candidates. Maximal degree in co-relation 915. Up to 20 conditions per place. [2022-11-18 19:51:20,744 INFO L137 encePairwiseOnDemand]: 455/461 looper letters, 13 selfloop transitions, 8 changer transitions 0/397 dead transitions. [2022-11-18 19:51:20,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 397 transitions, 890 flow [2022-11-18 19:51:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:51:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 19:51:20,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1899 transitions. [2022-11-18 19:51:20,749 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8238611713665943 [2022-11-18 19:51:20,749 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1899 transitions. [2022-11-18 19:51:20,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1899 transitions. [2022-11-18 19:51:20,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:20,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1899 transitions. [2022-11-18 19:51:20,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 379.8) internal successors, (1899), 5 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:20,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:20,757 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:20,757 INFO L175 Difference]: Start difference. First operand has 395 places, 397 transitions, 850 flow. Second operand 5 states and 1899 transitions. [2022-11-18 19:51:20,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 397 transitions, 890 flow [2022-11-18 19:51:20,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 397 transitions, 888 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 19:51:20,769 INFO L231 Difference]: Finished difference. Result has 398 places, 397 transitions, 868 flow [2022-11-18 19:51:20,770 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=868, PETRI_PLACES=398, PETRI_TRANSITIONS=397} [2022-11-18 19:51:20,770 INFO L288 CegarLoopForPetriNet]: 393 programPoint places, 5 predicate places. [2022-11-18 19:51:20,770 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 397 transitions, 868 flow [2022-11-18 19:51:20,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 379.25) internal successors, (1517), 4 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:20,771 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:20,771 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:20,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-18 19:51:20,772 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-18 19:51:20,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:20,772 INFO L85 PathProgramCache]: Analyzing trace with hash -485649989, now seen corresponding path program 1 times [2022-11-18 19:51:20,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:20,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665346276] [2022-11-18 19:51:20,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:20,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:20,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:51:20,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:20,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665346276] [2022-11-18 19:51:20,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665346276] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:51:20,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781213246] [2022-11-18 19:51:20,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:20,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:51:20,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:51:20,838 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:51:20,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 19:51:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:20,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 19:51:20,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:51:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:51:21,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:51:21,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781213246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:51:21,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:51:21,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-18 19:51:21,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928409757] [2022-11-18 19:51:21,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:51:21,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:51:21,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:21,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:51:21,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:51:21,027 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 461 [2022-11-18 19:51:21,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 397 transitions, 868 flow. Second operand has 5 states, 5 states have (on average 378.8) internal successors, (1894), 5 states have internal predecessors, (1894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:21,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:21,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 461 [2022-11-18 19:51:21,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:21,324 INFO L130 PetriNetUnfolder]: 27/891 cut-off events. [2022-11-18 19:51:21,325 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-11-18 19:51:21,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 891 events. 27/891 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5165 event pairs, 1 based on Foata normal form. 1/773 useless extension candidates. Maximal degree in co-relation 913. Up to 23 conditions per place. [2022-11-18 19:51:21,351 INFO L137 encePairwiseOnDemand]: 457/461 looper letters, 15 selfloop transitions, 5 changer transitions 0/396 dead transitions. [2022-11-18 19:51:21,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 396 transitions, 904 flow [2022-11-18 19:51:21,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:51:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-18 19:51:21,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1521 transitions. [2022-11-18 19:51:21,356 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8248373101952278 [2022-11-18 19:51:21,356 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1521 transitions. [2022-11-18 19:51:21,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1521 transitions. [2022-11-18 19:51:21,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:21,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1521 transitions. [2022-11-18 19:51:21,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 380.25) internal successors, (1521), 4 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:21,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:21,365 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:21,365 INFO L175 Difference]: Start difference. First operand has 398 places, 397 transitions, 868 flow. Second operand 4 states and 1521 transitions. [2022-11-18 19:51:21,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 396 transitions, 904 flow [2022-11-18 19:51:21,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 396 transitions, 892 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 19:51:21,433 INFO L231 Difference]: Finished difference. Result has 397 places, 396 transitions, 862 flow [2022-11-18 19:51:21,433 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=862, PETRI_PLACES=397, PETRI_TRANSITIONS=396} [2022-11-18 19:51:21,434 INFO L288 CegarLoopForPetriNet]: 393 programPoint places, 4 predicate places. [2022-11-18 19:51:21,434 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 396 transitions, 862 flow [2022-11-18 19:51:21,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 378.8) internal successors, (1894), 5 states have internal predecessors, (1894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:21,434 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:21,434 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:21,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 19:51:21,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:51:21,635 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-18 19:51:21,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:21,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2094493468, now seen corresponding path program 1 times [2022-11-18 19:51:21,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:21,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667103063] [2022-11-18 19:51:21,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:21,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:51:21,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:21,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667103063] [2022-11-18 19:51:21,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667103063] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:51:21,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651011839] [2022-11-18 19:51:21,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:21,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:51:21,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:51:21,692 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:51:21,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 19:51:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:21,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 19:51:21,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:51:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:51:21,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:51:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:51:21,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651011839] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:51:21,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:51:21,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-18 19:51:21,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424575775] [2022-11-18 19:51:21,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:51:21,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 19:51:21,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:21,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 19:51:21,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:51:21,921 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 461 [2022-11-18 19:51:21,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 396 transitions, 862 flow. Second operand has 10 states, 10 states have (on average 378.7) internal successors, (3787), 10 states have internal predecessors, (3787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:21,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:21,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 461 [2022-11-18 19:51:21,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:22,235 INFO L130 PetriNetUnfolder]: 27/899 cut-off events. [2022-11-18 19:51:22,235 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-11-18 19:51:22,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 899 events. 27/899 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5157 event pairs, 1 based on Foata normal form. 2/782 useless extension candidates. Maximal degree in co-relation 903. Up to 20 conditions per place. [2022-11-18 19:51:22,253 INFO L137 encePairwiseOnDemand]: 455/461 looper letters, 22 selfloop transitions, 9 changer transitions 0/407 dead transitions. [2022-11-18 19:51:22,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 407 transitions, 962 flow [2022-11-18 19:51:22,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:51:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 19:51:22,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3417 transitions. [2022-11-18 19:51:22,259 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8235719450469993 [2022-11-18 19:51:22,259 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3417 transitions. [2022-11-18 19:51:22,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3417 transitions. [2022-11-18 19:51:22,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:22,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3417 transitions. [2022-11-18 19:51:22,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 379.6666666666667) internal successors, (3417), 9 states have internal predecessors, (3417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:22,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 461.0) internal successors, (4610), 10 states have internal predecessors, (4610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:22,273 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 461.0) internal successors, (4610), 10 states have internal predecessors, (4610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:22,273 INFO L175 Difference]: Start difference. First operand has 397 places, 396 transitions, 862 flow. Second operand 9 states and 3417 transitions. [2022-11-18 19:51:22,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 407 transitions, 962 flow [2022-11-18 19:51:22,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 407 transitions, 948 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 19:51:22,282 INFO L231 Difference]: Finished difference. Result has 406 places, 400 transitions, 908 flow [2022-11-18 19:51:22,283 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=908, PETRI_PLACES=406, PETRI_TRANSITIONS=400} [2022-11-18 19:51:22,284 INFO L288 CegarLoopForPetriNet]: 393 programPoint places, 13 predicate places. [2022-11-18 19:51:22,284 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 400 transitions, 908 flow [2022-11-18 19:51:22,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 378.7) internal successors, (3787), 10 states have internal predecessors, (3787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:22,285 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:22,285 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:22,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 19:51:22,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-18 19:51:22,492 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-18 19:51:22,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:22,493 INFO L85 PathProgramCache]: Analyzing trace with hash -135780932, now seen corresponding path program 2 times [2022-11-18 19:51:22,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:22,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128032215] [2022-11-18 19:51:22,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:22,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 19:51:22,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:22,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128032215] [2022-11-18 19:51:22,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128032215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:51:22,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:51:22,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:51:22,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949976265] [2022-11-18 19:51:22,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:51:22,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:51:22,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:22,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:51:22,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:51:22,559 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 461 [2022-11-18 19:51:22,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 400 transitions, 908 flow. Second operand has 4 states, 4 states have (on average 377.75) internal successors, (1511), 4 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:22,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:22,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 461 [2022-11-18 19:51:22,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:22,832 INFO L130 PetriNetUnfolder]: 23/783 cut-off events. [2022-11-18 19:51:22,832 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-11-18 19:51:22,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 783 events. 23/783 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4310 event pairs, 1 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 819. Up to 40 conditions per place. [2022-11-18 19:51:22,858 INFO L137 encePairwiseOnDemand]: 454/461 looper letters, 21 selfloop transitions, 4 changer transitions 0/407 dead transitions. [2022-11-18 19:51:22,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 407 transitions, 972 flow [2022-11-18 19:51:22,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:51:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 19:51:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1908 transitions. [2022-11-18 19:51:22,864 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.827765726681128 [2022-11-18 19:51:22,864 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1908 transitions. [2022-11-18 19:51:22,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1908 transitions. [2022-11-18 19:51:22,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:22,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1908 transitions. [2022-11-18 19:51:22,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 381.6) internal successors, (1908), 5 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:22,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:22,879 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:22,879 INFO L175 Difference]: Start difference. First operand has 406 places, 400 transitions, 908 flow. Second operand 5 states and 1908 transitions. [2022-11-18 19:51:22,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 407 transitions, 972 flow [2022-11-18 19:51:22,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 407 transitions, 956 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-18 19:51:22,888 INFO L231 Difference]: Finished difference. Result has 409 places, 403 transitions, 924 flow [2022-11-18 19:51:22,889 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=924, PETRI_PLACES=409, PETRI_TRANSITIONS=403} [2022-11-18 19:51:22,890 INFO L288 CegarLoopForPetriNet]: 393 programPoint places, 16 predicate places. [2022-11-18 19:51:22,891 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 403 transitions, 924 flow [2022-11-18 19:51:22,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 377.75) internal successors, (1511), 4 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:22,891 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:22,892 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:22,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-18 19:51:22,892 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-18 19:51:22,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:22,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1310307541, now seen corresponding path program 1 times [2022-11-18 19:51:22,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:22,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884762834] [2022-11-18 19:51:22,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:22,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:22,978 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-18 19:51:22,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:22,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884762834] [2022-11-18 19:51:22,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884762834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:51:22,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:51:22,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:51:22,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813867247] [2022-11-18 19:51:22,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:51:22,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:51:22,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:22,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:51:22,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:51:22,984 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 461 [2022-11-18 19:51:22,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 403 transitions, 924 flow. Second operand has 4 states, 4 states have (on average 379.75) internal successors, (1519), 4 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:22,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:22,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 461 [2022-11-18 19:51:22,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:23,333 INFO L130 PetriNetUnfolder]: 23/781 cut-off events. [2022-11-18 19:51:23,334 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-11-18 19:51:23,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 781 events. 23/781 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4290 event pairs, 1 based on Foata normal form. 2/689 useless extension candidates. Maximal degree in co-relation 829. Up to 20 conditions per place. [2022-11-18 19:51:23,360 INFO L137 encePairwiseOnDemand]: 455/461 looper letters, 13 selfloop transitions, 8 changer transitions 0/403 dead transitions. [2022-11-18 19:51:23,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 403 transitions, 964 flow [2022-11-18 19:51:23,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:51:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 19:51:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1899 transitions. [2022-11-18 19:51:23,365 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8238611713665943 [2022-11-18 19:51:23,365 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1899 transitions. [2022-11-18 19:51:23,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1899 transitions. [2022-11-18 19:51:23,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:23,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1899 transitions. [2022-11-18 19:51:23,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 379.8) internal successors, (1899), 5 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:23,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:23,375 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:23,375 INFO L175 Difference]: Start difference. First operand has 409 places, 403 transitions, 924 flow. Second operand 5 states and 1899 transitions. [2022-11-18 19:51:23,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 403 transitions, 964 flow [2022-11-18 19:51:23,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 403 transitions, 962 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 19:51:23,388 INFO L231 Difference]: Finished difference. Result has 412 places, 403 transitions, 942 flow [2022-11-18 19:51:23,389 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=942, PETRI_PLACES=412, PETRI_TRANSITIONS=403} [2022-11-18 19:51:23,389 INFO L288 CegarLoopForPetriNet]: 393 programPoint places, 19 predicate places. [2022-11-18 19:51:23,389 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 403 transitions, 942 flow [2022-11-18 19:51:23,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 379.75) internal successors, (1519), 4 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:23,390 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:23,390 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:23,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-18 19:51:23,391 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-18 19:51:23,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:23,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1964829607, now seen corresponding path program 1 times [2022-11-18 19:51:23,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:23,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393772256] [2022-11-18 19:51:23,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:23,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 19:51:23,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:23,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393772256] [2022-11-18 19:51:23,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393772256] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:51:23,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28617033] [2022-11-18 19:51:23,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:23,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:51:23,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:51:23,611 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:51:23,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 19:51:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:23,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 19:51:23,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:51:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 19:51:23,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:51:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 19:51:23,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28617033] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:51:23,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:51:23,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-18 19:51:23,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721449633] [2022-11-18 19:51:23,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:51:23,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 19:51:23,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:23,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 19:51:23,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-18 19:51:23,986 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 461 [2022-11-18 19:51:24,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 403 transitions, 942 flow. Second operand has 18 states, 18 states have (on average 379.1111111111111) internal successors, (6824), 18 states have internal predecessors, (6824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:24,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:24,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 461 [2022-11-18 19:51:24,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:24,546 INFO L130 PetriNetUnfolder]: 23/809 cut-off events. [2022-11-18 19:51:24,546 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-11-18 19:51:24,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 809 events. 23/809 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4297 event pairs, 1 based on Foata normal form. 4/719 useless extension candidates. Maximal degree in co-relation 819. Up to 20 conditions per place. [2022-11-18 19:51:24,562 INFO L137 encePairwiseOnDemand]: 455/461 looper letters, 38 selfloop transitions, 21 changer transitions 0/438 dead transitions. [2022-11-18 19:51:24,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 438 transitions, 1214 flow [2022-11-18 19:51:24,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 19:51:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-18 19:51:24,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 7959 transitions. [2022-11-18 19:51:24,578 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8221258134490239 [2022-11-18 19:51:24,578 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 7959 transitions. [2022-11-18 19:51:24,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 7959 transitions. [2022-11-18 19:51:24,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:24,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 7959 transitions. [2022-11-18 19:51:24,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 379.0) internal successors, (7959), 21 states have internal predecessors, (7959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:24,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 461.0) internal successors, (10142), 22 states have internal predecessors, (10142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:24,614 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 461.0) internal successors, (10142), 22 states have internal predecessors, (10142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:24,615 INFO L175 Difference]: Start difference. First operand has 412 places, 403 transitions, 942 flow. Second operand 21 states and 7959 transitions. [2022-11-18 19:51:24,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 438 transitions, 1214 flow [2022-11-18 19:51:24,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 438 transitions, 1202 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 19:51:24,627 INFO L231 Difference]: Finished difference. Result has 434 places, 416 transitions, 1086 flow [2022-11-18 19:51:24,628 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1086, PETRI_PLACES=434, PETRI_TRANSITIONS=416} [2022-11-18 19:51:24,629 INFO L288 CegarLoopForPetriNet]: 393 programPoint places, 41 predicate places. [2022-11-18 19:51:24,629 INFO L495 AbstractCegarLoop]: Abstraction has has 434 places, 416 transitions, 1086 flow [2022-11-18 19:51:24,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 379.1111111111111) internal successors, (6824), 18 states have internal predecessors, (6824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:24,630 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:24,631 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:24,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-18 19:51:24,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-18 19:51:24,836 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-18 19:51:24,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:24,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2011450983, now seen corresponding path program 2 times [2022-11-18 19:51:24,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:24,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488328651] [2022-11-18 19:51:24,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:24,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:25,283 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 19:51:25,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:25,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488328651] [2022-11-18 19:51:25,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488328651] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:51:25,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443536943] [2022-11-18 19:51:25,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:51:25,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:51:25,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:51:25,299 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:51:25,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-18 19:51:25,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:51:25,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:51:25,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 19:51:25,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:51:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 19:51:25,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:51:25,920 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 19:51:25,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443536943] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:51:25,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:51:25,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-18 19:51:25,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102901875] [2022-11-18 19:51:25,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:51:25,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 19:51:25,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:25,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 19:51:25,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-18 19:51:25,930 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 461 [2022-11-18 19:51:25,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 416 transitions, 1086 flow. Second operand has 23 states, 23 states have (on average 379.3478260869565) internal successors, (8725), 23 states have internal predecessors, (8725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:25,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:25,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 461 [2022-11-18 19:51:25,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:26,630 INFO L130 PetriNetUnfolder]: 23/830 cut-off events. [2022-11-18 19:51:26,630 INFO L131 PetriNetUnfolder]: For 274/274 co-relation queries the response was YES. [2022-11-18 19:51:26,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1147 conditions, 830 events. 23/830 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4301 event pairs, 1 based on Foata normal form. 3/739 useless extension candidates. Maximal degree in co-relation 822. Up to 20 conditions per place. [2022-11-18 19:51:26,646 INFO L137 encePairwiseOnDemand]: 455/461 looper letters, 50 selfloop transitions, 30 changer transitions 0/459 dead transitions. [2022-11-18 19:51:26,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 459 transitions, 1456 flow [2022-11-18 19:51:26,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-18 19:51:26,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-18 19:51:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 11363 transitions. [2022-11-18 19:51:26,660 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8216196673897325 [2022-11-18 19:51:26,660 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 11363 transitions. [2022-11-18 19:51:26,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 11363 transitions. [2022-11-18 19:51:26,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:26,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 11363 transitions. [2022-11-18 19:51:26,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 378.76666666666665) internal successors, (11363), 30 states have internal predecessors, (11363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:26,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 461.0) internal successors, (14291), 31 states have internal predecessors, (14291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:26,698 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 461.0) internal successors, (14291), 31 states have internal predecessors, (14291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:26,698 INFO L175 Difference]: Start difference. First operand has 434 places, 416 transitions, 1086 flow. Second operand 30 states and 11363 transitions. [2022-11-18 19:51:26,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 459 transitions, 1456 flow [2022-11-18 19:51:26,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 459 transitions, 1376 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-18 19:51:26,709 INFO L231 Difference]: Finished difference. Result has 459 places, 426 transitions, 1184 flow [2022-11-18 19:51:26,709 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1184, PETRI_PLACES=459, PETRI_TRANSITIONS=426} [2022-11-18 19:51:26,710 INFO L288 CegarLoopForPetriNet]: 393 programPoint places, 66 predicate places. [2022-11-18 19:51:26,710 INFO L495 AbstractCegarLoop]: Abstraction has has 459 places, 426 transitions, 1184 flow [2022-11-18 19:51:26,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 379.3478260869565) internal successors, (8725), 23 states have internal predecessors, (8725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:26,712 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:26,712 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:26,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-18 19:51:26,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-18 19:51:26,917 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-18 19:51:26,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:26,917 INFO L85 PathProgramCache]: Analyzing trace with hash -569869532, now seen corresponding path program 3 times [2022-11-18 19:51:26,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:26,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918925540] [2022-11-18 19:51:26,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:26,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-18 19:51:27,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:27,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918925540] [2022-11-18 19:51:27,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918925540] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:51:27,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660092524] [2022-11-18 19:51:27,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 19:51:27,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:51:27,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:51:27,058 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:51:27,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-18 19:51:27,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-18 19:51:27,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:51:27,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 19:51:27,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:51:27,276 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-18 19:51:27,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:51:27,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660092524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:51:27,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:51:27,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-18 19:51:27,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885553490] [2022-11-18 19:51:27,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:51:27,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:51:27,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:27,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:51:27,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:51:27,281 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 461 [2022-11-18 19:51:27,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 426 transitions, 1184 flow. Second operand has 5 states, 5 states have (on average 379.2) internal successors, (1896), 5 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:27,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:27,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 461 [2022-11-18 19:51:27,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:27,597 INFO L130 PetriNetUnfolder]: 23/828 cut-off events. [2022-11-18 19:51:27,597 INFO L131 PetriNetUnfolder]: For 235/235 co-relation queries the response was YES. [2022-11-18 19:51:27,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 828 events. 23/828 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4288 event pairs, 1 based on Foata normal form. 2/736 useless extension candidates. Maximal degree in co-relation 837. Up to 30 conditions per place. [2022-11-18 19:51:27,623 INFO L137 encePairwiseOnDemand]: 457/461 looper letters, 15 selfloop transitions, 5 changer transitions 0/425 dead transitions. [2022-11-18 19:51:27,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 425 transitions, 1220 flow [2022-11-18 19:51:27,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:51:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-18 19:51:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1521 transitions. [2022-11-18 19:51:27,626 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8248373101952278 [2022-11-18 19:51:27,626 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1521 transitions. [2022-11-18 19:51:27,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1521 transitions. [2022-11-18 19:51:27,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:27,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1521 transitions. [2022-11-18 19:51:27,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 380.25) internal successors, (1521), 4 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:27,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:27,633 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:27,633 INFO L175 Difference]: Start difference. First operand has 459 places, 426 transitions, 1184 flow. Second operand 4 states and 1521 transitions. [2022-11-18 19:51:27,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 425 transitions, 1220 flow [2022-11-18 19:51:27,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 425 transitions, 1174 flow, removed 5 selfloop flow, removed 18 redundant places. [2022-11-18 19:51:27,645 INFO L231 Difference]: Finished difference. Result has 443 places, 425 transitions, 1144 flow [2022-11-18 19:51:27,646 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1144, PETRI_PLACES=443, PETRI_TRANSITIONS=425} [2022-11-18 19:51:27,647 INFO L288 CegarLoopForPetriNet]: 393 programPoint places, 50 predicate places. [2022-11-18 19:51:27,647 INFO L495 AbstractCegarLoop]: Abstraction has has 443 places, 425 transitions, 1144 flow [2022-11-18 19:51:27,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 379.2) internal successors, (1896), 5 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:27,648 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:27,648 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:27,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-18 19:51:27,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f6bbe8-e7bc-4628-bd65-11ece73487f4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:51:27,855 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-18 19:51:27,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:27,855 INFO L85 PathProgramCache]: Analyzing trace with hash 622411147, now seen corresponding path program 1 times [2022-11-18 19:51:27,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:27,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794984263] [2022-11-18 19:51:27,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:27,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-18 19:51:28,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:28,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794984263] [2022-11-18 19:51:28,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794984263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:51:28,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:51:28,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 19:51:28,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622709810] [2022-11-18 19:51:28,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:51:28,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 19:51:28,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:28,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 19:51:28,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:51:28,411 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 461 [2022-11-18 19:51:28,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 425 transitions, 1144 flow. Second operand has 11 states, 11 states have (on average 329.3636363636364) internal successors, (3623), 11 states have internal predecessors, (3623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:28,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:28,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 461 [2022-11-18 19:51:28,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand