./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b 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_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:37:53,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:37:53,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:37:53,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:37:53,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:37:53,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:37:53,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:37:53,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:37:53,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:37:53,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:37:53,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:37:53,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:37:53,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:37:53,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:37:53,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:37:53,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:37:53,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:37:53,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:37:53,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:37:53,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:37:53,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:37:53,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:37:53,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:37:53,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:37:53,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:37:53,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:37:53,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:37:53,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:37:53,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:37:53,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:37:53,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:37:53,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:37:53,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:37:53,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:37:53,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:37:53,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:37:53,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:37:53,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:37:53,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:37:53,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:37:53,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:37:53,563 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-20 12:37:53,586 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:37:53,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:37:53,587 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:37:53,587 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:37:53,588 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:37:53,588 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:37:53,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:37:53,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:37:53,589 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:37:53,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:37:53,590 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:37:53,590 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 12:37:53,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:37:53,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:37:53,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:37:53,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:37:53,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:37:53,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:37:53,592 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 12:37:53,592 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:37:53,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:37:53,592 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:37:53,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:37:53,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:37:53,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:37:53,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:37:53,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:37:53,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:37:53,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:37:53,595 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:37:53,595 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:37:53,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:37:53,595 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:37:53,596 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:37:53,596 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:37:53,596 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_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 [2022-11-20 12:37:53,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:37:53,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:37:53,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:37:53,967 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:37:53,968 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:37:53,969 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2022-11-20 12:37:56,964 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:37:57,316 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:37:57,317 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2022-11-20 12:37:57,355 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/data/d500094b5/f2347fd114794ddb81f5314d5a3f9388/FLAGc3059906c [2022-11-20 12:37:57,372 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/data/d500094b5/f2347fd114794ddb81f5314d5a3f9388 [2022-11-20 12:37:57,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:37:57,379 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:37:57,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:37:57,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:37:57,388 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:37:57,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:37:57" (1/1) ... [2022-11-20 12:37:57,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24343553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:57, skipping insertion in model container [2022-11-20 12:37:57,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:37:57" (1/1) ... [2022-11-20 12:37:57,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:37:57,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:37:57,956 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2022-11-20 12:37:57,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:37:58,009 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:37:58,045 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2022-11-20 12:37:58,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:37:58,123 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:37:58,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:58 WrapperNode [2022-11-20 12:37:58,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:37:58,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:37:58,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:37:58,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:37:58,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:58" (1/1) ... [2022-11-20 12:37:58,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:58" (1/1) ... [2022-11-20 12:37:58,184 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 269 [2022-11-20 12:37:58,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:37:58,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:37:58,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:37:58,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:37:58,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:58" (1/1) ... [2022-11-20 12:37:58,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:58" (1/1) ... [2022-11-20 12:37:58,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:58" (1/1) ... [2022-11-20 12:37:58,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:58" (1/1) ... [2022-11-20 12:37:58,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:58" (1/1) ... [2022-11-20 12:37:58,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:58" (1/1) ... [2022-11-20 12:37:58,223 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:58" (1/1) ... [2022-11-20 12:37:58,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:58" (1/1) ... [2022-11-20 12:37:58,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:37:58,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:37:58,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:37:58,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:37:58,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:58" (1/1) ... [2022-11-20 12:37:58,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:37:58,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:37:58,264 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:37:58,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:37:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:37:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:37:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:37:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:37:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 12:37:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:37:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-20 12:37:58,322 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-20 12:37:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:37:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:37:58,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:37:58,324 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 12:37:58,489 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:37:58,498 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:37:58,984 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:37:58,993 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:37:58,994 INFO L300 CfgBuilder]: Removed 35 assume(true) statements. [2022-11-20 12:37:58,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:37:58 BoogieIcfgContainer [2022-11-20 12:37:58,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:37:58,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:37:59,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:37:59,003 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:37:59,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:37:57" (1/3) ... [2022-11-20 12:37:59,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55316ff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:37:59, skipping insertion in model container [2022-11-20 12:37:59,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:58" (2/3) ... [2022-11-20 12:37:59,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55316ff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:37:59, skipping insertion in model container [2022-11-20 12:37:59,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:37:58" (3/3) ... [2022-11-20 12:37:59,007 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2022-11-20 12:37:59,015 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:37:59,025 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:37:59,025 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-11-20 12:37:59,025 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:37:59,118 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-20 12:37:59,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 254 places, 296 transitions, 600 flow [2022-11-20 12:37:59,409 INFO L130 PetriNetUnfolder]: 73/453 cut-off events. [2022-11-20 12:37:59,409 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-20 12:37:59,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 453 events. 73/453 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2189 event pairs, 0 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 248. Up to 8 conditions per place. [2022-11-20 12:37:59,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 254 places, 296 transitions, 600 flow [2022-11-20 12:37:59,440 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 252 places, 293 transitions, 594 flow [2022-11-20 12:37:59,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:37:59,463 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;@4e977a42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:37:59,463 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-11-20 12:37:59,471 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-20 12:37:59,471 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:37:59,471 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:37:59,472 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-20 12:37:59,473 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-20 12:37:59,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:37:59,478 INFO L85 PathProgramCache]: Analyzing trace with hash 345272585, now seen corresponding path program 1 times [2022-11-20 12:37:59,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:37:59,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169632211] [2022-11-20 12:37:59,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:37:59,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:37:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:37:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:37:59,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:37:59,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169632211] [2022-11-20 12:37:59,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169632211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:37:59,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:37:59,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:37:59,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864039695] [2022-11-20 12:37:59,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:00,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:38:00,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:00,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:38:00,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:38:00,040 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-20 12:38:00,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 293 transitions, 594 flow. Second operand has 4 states, 4 states have (on average 242.5) internal successors, (970), 4 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:00,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:00,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-20 12:38:00,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:00,190 INFO L130 PetriNetUnfolder]: 9/389 cut-off events. [2022-11-20 12:38:00,190 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-20 12:38:00,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 389 events. 9/389 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1763 event pairs, 0 based on Foata normal form. 62/402 useless extension candidates. Maximal degree in co-relation 210. Up to 15 conditions per place. [2022-11-20 12:38:00,196 INFO L137 encePairwiseOnDemand]: 251/296 looper letters, 17 selfloop transitions, 4 changer transitions 0/259 dead transitions. [2022-11-20 12:38:00,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 259 transitions, 568 flow [2022-11-20 12:38:00,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:38:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 12:38:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1268 transitions. [2022-11-20 12:38:00,231 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8567567567567568 [2022-11-20 12:38:00,232 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1268 transitions. [2022-11-20 12:38:00,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1268 transitions. [2022-11-20 12:38:00,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:00,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1268 transitions. [2022-11-20 12:38:00,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 253.6) internal successors, (1268), 5 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:00,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:00,258 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:00,260 INFO L175 Difference]: Start difference. First operand has 252 places, 293 transitions, 594 flow. Second operand 5 states and 1268 transitions. [2022-11-20 12:38:00,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 259 transitions, 568 flow [2022-11-20 12:38:00,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 259 transitions, 568 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 12:38:00,274 INFO L231 Difference]: Finished difference. Result has 256 places, 255 transitions, 544 flow [2022-11-20 12:38:00,277 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=544, PETRI_PLACES=256, PETRI_TRANSITIONS=255} [2022-11-20 12:38:00,283 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 4 predicate places. [2022-11-20 12:38:00,284 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 255 transitions, 544 flow [2022-11-20 12:38:00,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 242.5) internal successors, (970), 4 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:00,285 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:00,285 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-20 12:38:00,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:38:00,286 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-20 12:38:00,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:00,288 INFO L85 PathProgramCache]: Analyzing trace with hash -495076173, now seen corresponding path program 1 times [2022-11-20 12:38:00,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:00,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654500232] [2022-11-20 12:38:00,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:00,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:00,453 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-20 12:38:00,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:00,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654500232] [2022-11-20 12:38:00,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654500232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:00,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:00,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:38:00,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745861434] [2022-11-20 12:38:00,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:00,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:38:00,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:00,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:38:00,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:38:00,463 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-20 12:38:00,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 255 transitions, 544 flow. Second operand has 4 states, 4 states have (on average 244.25) internal successors, (977), 4 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:00,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:00,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-20 12:38:00,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:00,588 INFO L130 PetriNetUnfolder]: 9/388 cut-off events. [2022-11-20 12:38:00,588 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-20 12:38:00,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 388 events. 9/388 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1757 event pairs, 0 based on Foata normal form. 1/343 useless extension candidates. Maximal degree in co-relation 378. Up to 7 conditions per place. [2022-11-20 12:38:00,593 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 9 selfloop transitions, 8 changer transitions 0/255 dead transitions. [2022-11-20 12:38:00,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 255 transitions, 576 flow [2022-11-20 12:38:00,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:38:00,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 12:38:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1220 transitions. [2022-11-20 12:38:00,597 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8243243243243243 [2022-11-20 12:38:00,597 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1220 transitions. [2022-11-20 12:38:00,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1220 transitions. [2022-11-20 12:38:00,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:00,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1220 transitions. [2022-11-20 12:38:00,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:00,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:00,607 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:00,607 INFO L175 Difference]: Start difference. First operand has 256 places, 255 transitions, 544 flow. Second operand 5 states and 1220 transitions. [2022-11-20 12:38:00,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 255 transitions, 576 flow [2022-11-20 12:38:00,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 255 transitions, 574 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 12:38:00,618 INFO L231 Difference]: Finished difference. Result has 259 places, 255 transitions, 562 flow [2022-11-20 12:38:00,618 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=562, PETRI_PLACES=259, PETRI_TRANSITIONS=255} [2022-11-20 12:38:00,619 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 7 predicate places. [2022-11-20 12:38:00,620 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 255 transitions, 562 flow [2022-11-20 12:38:00,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 244.25) internal successors, (977), 4 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:00,622 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:00,623 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-20 12:38:00,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:38:00,623 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-20 12:38:00,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:00,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1832508587, now seen corresponding path program 1 times [2022-11-20 12:38:00,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:00,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75680459] [2022-11-20 12:38:00,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:00,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:00,805 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-20 12:38:00,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:00,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75680459] [2022-11-20 12:38:00,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75680459] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:38:00,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244337792] [2022-11-20 12:38:00,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:00,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:00,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:38:00,815 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:38:00,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:38:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:00,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:38:00,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:01,060 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-20 12:38:01,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:38:01,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244337792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:01,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:38:01,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 12:38:01,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566491052] [2022-11-20 12:38:01,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:01,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:38:01,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:01,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:38:01,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:38:01,065 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-20 12:38:01,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 255 transitions, 562 flow. Second operand has 5 states, 5 states have (on average 243.8) internal successors, (1219), 5 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:01,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:01,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-20 12:38:01,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:01,173 INFO L130 PetriNetUnfolder]: 9/387 cut-off events. [2022-11-20 12:38:01,173 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-20 12:38:01,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 387 events. 9/387 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1750 event pairs, 0 based on Foata normal form. 1/342 useless extension candidates. Maximal degree in co-relation 376. Up to 10 conditions per place. [2022-11-20 12:38:01,178 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 11 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2022-11-20 12:38:01,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 254 transitions, 590 flow [2022-11-20 12:38:01,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:38:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 12:38:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 977 transitions. [2022-11-20 12:38:01,181 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825168918918919 [2022-11-20 12:38:01,182 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 977 transitions. [2022-11-20 12:38:01,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 977 transitions. [2022-11-20 12:38:01,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:01,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 977 transitions. [2022-11-20 12:38:01,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 244.25) internal successors, (977), 4 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:01,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:01,189 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:01,189 INFO L175 Difference]: Start difference. First operand has 259 places, 255 transitions, 562 flow. Second operand 4 states and 977 transitions. [2022-11-20 12:38:01,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 254 transitions, 590 flow [2022-11-20 12:38:01,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 254 transitions, 578 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:38:01,195 INFO L231 Difference]: Finished difference. Result has 258 places, 254 transitions, 556 flow [2022-11-20 12:38:01,196 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=556, PETRI_PLACES=258, PETRI_TRANSITIONS=254} [2022-11-20 12:38:01,199 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 6 predicate places. [2022-11-20 12:38:01,199 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 254 transitions, 556 flow [2022-11-20 12:38:01,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 243.8) internal successors, (1219), 5 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:01,201 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:01,201 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-20 12:38:01,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 12:38:01,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-20 12:38:01,408 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-20 12:38:01,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:01,409 INFO L85 PathProgramCache]: Analyzing trace with hash -169423497, now seen corresponding path program 1 times [2022-11-20 12:38:01,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:01,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44765811] [2022-11-20 12:38:01,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:01,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:01,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:38:01,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:01,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44765811] [2022-11-20 12:38:01,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44765811] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:38:01,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678767115] [2022-11-20 12:38:01,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:01,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:01,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:38:01,524 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:38:01,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:38:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:01,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:38:01,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:38:01,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:38:01,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:38:01,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678767115] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:38:01,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:38:01,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 12:38:01,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184192508] [2022-11-20 12:38:01,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:38:01,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:38:01,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:01,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:38:01,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:38:01,765 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-20 12:38:01,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 254 transitions, 556 flow. Second operand has 10 states, 10 states have (on average 243.7) internal successors, (2437), 10 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:01,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:01,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-20 12:38:01,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:01,938 INFO L130 PetriNetUnfolder]: 9/395 cut-off events. [2022-11-20 12:38:01,938 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-20 12:38:01,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 395 events. 9/395 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1737 event pairs, 0 based on Foata normal form. 2/351 useless extension candidates. Maximal degree in co-relation 366. Up to 7 conditions per place. [2022-11-20 12:38:01,942 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 18 selfloop transitions, 9 changer transitions 0/265 dead transitions. [2022-11-20 12:38:01,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 265 transitions, 648 flow [2022-11-20 12:38:01,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:38:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:38:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2198 transitions. [2022-11-20 12:38:01,948 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825075075075075 [2022-11-20 12:38:01,948 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2198 transitions. [2022-11-20 12:38:01,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2198 transitions. [2022-11-20 12:38:01,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:01,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2198 transitions. [2022-11-20 12:38:01,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 244.22222222222223) internal successors, (2198), 9 states have internal predecessors, (2198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:01,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 296.0) internal successors, (2960), 10 states have internal predecessors, (2960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:01,963 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 296.0) internal successors, (2960), 10 states have internal predecessors, (2960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:01,963 INFO L175 Difference]: Start difference. First operand has 258 places, 254 transitions, 556 flow. Second operand 9 states and 2198 transitions. [2022-11-20 12:38:01,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 265 transitions, 648 flow [2022-11-20 12:38:01,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 265 transitions, 634 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:38:01,972 INFO L231 Difference]: Finished difference. Result has 267 places, 258 transitions, 602 flow [2022-11-20 12:38:01,972 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=602, PETRI_PLACES=267, PETRI_TRANSITIONS=258} [2022-11-20 12:38:01,974 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 15 predicate places. [2022-11-20 12:38:01,974 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 258 transitions, 602 flow [2022-11-20 12:38:01,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 243.7) internal successors, (2437), 10 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:01,976 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:01,976 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-20 12:38:01,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:38:02,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:02,183 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-20 12:38:02,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:02,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1870480841, now seen corresponding path program 2 times [2022-11-20 12:38:02,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:02,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378752408] [2022-11-20 12:38:02,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:02,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:02,266 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-20 12:38:02,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:02,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378752408] [2022-11-20 12:38:02,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378752408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:02,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:02,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:38:02,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951405860] [2022-11-20 12:38:02,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:02,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:38:02,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:02,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:38:02,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:38:02,270 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-20 12:38:02,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 258 transitions, 602 flow. Second operand has 4 states, 4 states have (on average 242.75) internal successors, (971), 4 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:02,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:02,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-20 12:38:02,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:02,350 INFO L130 PetriNetUnfolder]: 6/267 cut-off events. [2022-11-20 12:38:02,350 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-11-20 12:38:02,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 267 events. 6/267 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 812 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 250. Up to 7 conditions per place. [2022-11-20 12:38:02,354 INFO L137 encePairwiseOnDemand]: 289/296 looper letters, 10 selfloop transitions, 4 changer transitions 0/258 dead transitions. [2022-11-20 12:38:02,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 258 transitions, 630 flow [2022-11-20 12:38:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:38:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 12:38:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1222 transitions. [2022-11-20 12:38:02,357 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8256756756756757 [2022-11-20 12:38:02,357 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1222 transitions. [2022-11-20 12:38:02,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1222 transitions. [2022-11-20 12:38:02,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:02,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1222 transitions. [2022-11-20 12:38:02,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 244.4) internal successors, (1222), 5 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:02,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:02,364 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:02,365 INFO L175 Difference]: Start difference. First operand has 267 places, 258 transitions, 602 flow. Second operand 5 states and 1222 transitions. [2022-11-20 12:38:02,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 258 transitions, 630 flow [2022-11-20 12:38:02,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 258 transitions, 614 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-20 12:38:02,371 INFO L231 Difference]: Finished difference. Result has 266 places, 256 transitions, 594 flow [2022-11-20 12:38:02,372 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=594, PETRI_PLACES=266, PETRI_TRANSITIONS=256} [2022-11-20 12:38:02,372 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 14 predicate places. [2022-11-20 12:38:02,373 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 256 transitions, 594 flow [2022-11-20 12:38:02,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 242.75) internal successors, (971), 4 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:02,373 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:02,374 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-20 12:38:02,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:38:02,374 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-20 12:38:02,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:02,374 INFO L85 PathProgramCache]: Analyzing trace with hash 7125757, now seen corresponding path program 1 times [2022-11-20 12:38:02,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:02,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327693694] [2022-11-20 12:38:02,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:02,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:02,543 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-20 12:38:02,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:02,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327693694] [2022-11-20 12:38:02,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327693694] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:38:02,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989586969] [2022-11-20 12:38:02,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:02,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:02,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:38:02,556 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:38:02,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:38:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:02,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 12:38:02,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:02,766 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-20 12:38:02,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:38:02,893 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-20 12:38:02,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989586969] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:38:02,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:38:02,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-20 12:38:02,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43148060] [2022-11-20 12:38:02,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:38:02,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 12:38:02,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:02,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 12:38:02,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:38:02,903 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-20 12:38:02,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 256 transitions, 594 flow. Second operand has 18 states, 18 states have (on average 244.05555555555554) internal successors, (4393), 18 states have internal predecessors, (4393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:02,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:02,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-20 12:38:02,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:03,212 INFO L130 PetriNetUnfolder]: 6/295 cut-off events. [2022-11-20 12:38:03,212 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-11-20 12:38:03,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 295 events. 6/295 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 813 event pairs, 0 based on Foata normal form. 4/273 useless extension candidates. Maximal degree in co-relation 243. Up to 9 conditions per place. [2022-11-20 12:38:03,216 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 34 selfloop transitions, 21 changer transitions 0/291 dead transitions. [2022-11-20 12:38:03,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 291 transitions, 858 flow [2022-11-20 12:38:03,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 12:38:03,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-20 12:38:03,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5120 transitions. [2022-11-20 12:38:03,226 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8236808236808236 [2022-11-20 12:38:03,227 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 5120 transitions. [2022-11-20 12:38:03,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 5120 transitions. [2022-11-20 12:38:03,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:03,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 5120 transitions. [2022-11-20 12:38:03,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 243.8095238095238) internal successors, (5120), 21 states have internal predecessors, (5120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:03,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 296.0) internal successors, (6512), 22 states have internal predecessors, (6512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:03,254 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 296.0) internal successors, (6512), 22 states have internal predecessors, (6512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:03,254 INFO L175 Difference]: Start difference. First operand has 266 places, 256 transitions, 594 flow. Second operand 21 states and 5120 transitions. [2022-11-20 12:38:03,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 291 transitions, 858 flow [2022-11-20 12:38:03,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 291 transitions, 850 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 12:38:03,261 INFO L231 Difference]: Finished difference. Result has 287 places, 269 transitions, 742 flow [2022-11-20 12:38:03,262 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=742, PETRI_PLACES=287, PETRI_TRANSITIONS=269} [2022-11-20 12:38:03,262 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 35 predicate places. [2022-11-20 12:38:03,263 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 269 transitions, 742 flow [2022-11-20 12:38:03,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 244.05555555555554) internal successors, (4393), 18 states have internal predecessors, (4393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:03,265 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:03,265 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-20 12:38:03,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:38:03,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:03,471 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-20 12:38:03,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:03,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1631003773, now seen corresponding path program 2 times [2022-11-20 12:38:03,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:03,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441264387] [2022-11-20 12:38:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:03,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:03,930 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-20 12:38:03,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:03,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441264387] [2022-11-20 12:38:03,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441264387] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:38:03,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253342823] [2022-11-20 12:38:03,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:38:03,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:03,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:38:03,933 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:38:03,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:38:04,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:38:04,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:38:04,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 12:38:04,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:04,197 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-20 12:38:04,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:38:04,465 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-20 12:38:04,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253342823] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:38:04,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:38:04,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-20 12:38:04,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702442106] [2022-11-20 12:38:04,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:38:04,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 12:38:04,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:04,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 12:38:04,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-20 12:38:04,472 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-20 12:38:04,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 269 transitions, 742 flow. Second operand has 23 states, 23 states have (on average 244.30434782608697) internal successors, (5619), 23 states have internal predecessors, (5619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:04,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:04,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-20 12:38:04,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:04,957 INFO L130 PetriNetUnfolder]: 6/316 cut-off events. [2022-11-20 12:38:04,957 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2022-11-20 12:38:04,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 316 events. 6/316 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 814 event pairs, 0 based on Foata normal form. 3/293 useless extension candidates. Maximal degree in co-relation 334. Up to 12 conditions per place. [2022-11-20 12:38:04,962 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 46 selfloop transitions, 30 changer transitions 0/312 dead transitions. [2022-11-20 12:38:04,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 312 transitions, 1104 flow [2022-11-20 12:38:04,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 12:38:04,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-20 12:38:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 7309 transitions. [2022-11-20 12:38:04,977 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8230855855855855 [2022-11-20 12:38:04,977 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 7309 transitions. [2022-11-20 12:38:04,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 7309 transitions. [2022-11-20 12:38:04,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:04,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 7309 transitions. [2022-11-20 12:38:04,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 243.63333333333333) internal successors, (7309), 30 states have internal predecessors, (7309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:05,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 296.0) internal successors, (9176), 31 states have internal predecessors, (9176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:05,011 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 296.0) internal successors, (9176), 31 states have internal predecessors, (9176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:05,011 INFO L175 Difference]: Start difference. First operand has 287 places, 269 transitions, 742 flow. Second operand 30 states and 7309 transitions. [2022-11-20 12:38:05,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 312 transitions, 1104 flow [2022-11-20 12:38:05,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 312 transitions, 1024 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-20 12:38:05,021 INFO L231 Difference]: Finished difference. Result has 312 places, 279 transitions, 840 flow [2022-11-20 12:38:05,021 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=840, PETRI_PLACES=312, PETRI_TRANSITIONS=279} [2022-11-20 12:38:05,022 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 60 predicate places. [2022-11-20 12:38:05,022 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 279 transitions, 840 flow [2022-11-20 12:38:05,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 244.30434782608697) internal successors, (5619), 23 states have internal predecessors, (5619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:05,024 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:05,024 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-20 12:38:05,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:38:05,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-20 12:38:05,230 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-20 12:38:05,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:05,231 INFO L85 PathProgramCache]: Analyzing trace with hash 394578151, now seen corresponding path program 3 times [2022-11-20 12:38:05,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:05,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371515712] [2022-11-20 12:38:05,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:05,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:38:05,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:38:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:38:05,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:38:05,340 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:38:05,341 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2022-11-20 12:38:05,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 29 remaining) [2022-11-20 12:38:05,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 29 remaining) [2022-11-20 12:38:05,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 29 remaining) [2022-11-20 12:38:05,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 29 remaining) [2022-11-20 12:38:05,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 29 remaining) [2022-11-20 12:38:05,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 29 remaining) [2022-11-20 12:38:05,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 29 remaining) [2022-11-20 12:38:05,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 29 remaining) [2022-11-20 12:38:05,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 29 remaining) [2022-11-20 12:38:05,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 29 remaining) [2022-11-20 12:38:05,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 29 remaining) [2022-11-20 12:38:05,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 29 remaining) [2022-11-20 12:38:05,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 29 remaining) [2022-11-20 12:38:05,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 29 remaining) [2022-11-20 12:38:05,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 29 remaining) [2022-11-20 12:38:05,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 29 remaining) [2022-11-20 12:38:05,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 29 remaining) [2022-11-20 12:38:05,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 29 remaining) [2022-11-20 12:38:05,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 29 remaining) [2022-11-20 12:38:05,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 29 remaining) [2022-11-20 12:38:05,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 29 remaining) [2022-11-20 12:38:05,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 29 remaining) [2022-11-20 12:38:05,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 29 remaining) [2022-11-20 12:38:05,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 29 remaining) [2022-11-20 12:38:05,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 29 remaining) [2022-11-20 12:38:05,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 29 remaining) [2022-11-20 12:38:05,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 29 remaining) [2022-11-20 12:38:05,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 29 remaining) [2022-11-20 12:38:05,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:38:05,350 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2022-11-20 12:38:05,352 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-20 12:38:05,352 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-20 12:38:05,399 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 12:38:05,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 325 places, 380 transitions, 778 flow [2022-11-20 12:38:05,514 INFO L130 PetriNetUnfolder]: 118/731 cut-off events. [2022-11-20 12:38:05,515 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-20 12:38:05,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 731 events. 118/731 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3930 event pairs, 0 based on Foata normal form. 0/555 useless extension candidates. Maximal degree in co-relation 455. Up to 12 conditions per place. [2022-11-20 12:38:05,525 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 380 transitions, 778 flow [2022-11-20 12:38:05,536 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 325 places, 380 transitions, 778 flow [2022-11-20 12:38:05,538 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:38:05,538 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;@4e977a42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:38:05,539 INFO L358 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2022-11-20 12:38:05,565 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-20 12:38:05,565 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:38:05,565 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:05,565 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-20 12:38:05,565 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-20 12:38:05,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:05,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1413576965, now seen corresponding path program 1 times [2022-11-20 12:38:05,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:05,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886723821] [2022-11-20 12:38:05,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:05,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:05,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:38:05,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:05,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886723821] [2022-11-20 12:38:05,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886723821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:05,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:05,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:38:05,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213307509] [2022-11-20 12:38:05,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:05,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:38:05,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:05,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:38:05,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:38:05,615 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-20 12:38:05,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 380 transitions, 778 flow. Second operand has 4 states, 4 states have (on average 311.5) internal successors, (1246), 4 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:05,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:05,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-20 12:38:05,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:05,776 INFO L130 PetriNetUnfolder]: 17/629 cut-off events. [2022-11-20 12:38:05,777 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-20 12:38:05,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 629 events. 17/629 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3350 event pairs, 0 based on Foata normal form. 126/672 useless extension candidates. Maximal degree in co-relation 415. Up to 19 conditions per place. [2022-11-20 12:38:05,789 INFO L137 encePairwiseOnDemand]: 323/380 looper letters, 19 selfloop transitions, 4 changer transitions 0/333 dead transitions. [2022-11-20 12:38:05,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 333 transitions, 730 flow [2022-11-20 12:38:05,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:38:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 12:38:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions. [2022-11-20 12:38:05,793 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8563157894736843 [2022-11-20 12:38:05,793 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1627 transitions. [2022-11-20 12:38:05,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1627 transitions. [2022-11-20 12:38:05,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:05,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1627 transitions. [2022-11-20 12:38:05,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 325.4) internal successors, (1627), 5 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:05,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:05,802 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:05,802 INFO L175 Difference]: Start difference. First operand has 325 places, 380 transitions, 778 flow. Second operand 5 states and 1627 transitions. [2022-11-20 12:38:05,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 333 transitions, 730 flow [2022-11-20 12:38:05,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 333 transitions, 730 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 12:38:05,808 INFO L231 Difference]: Finished difference. Result has 328 places, 329 transitions, 702 flow [2022-11-20 12:38:05,809 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=702, PETRI_PLACES=328, PETRI_TRANSITIONS=329} [2022-11-20 12:38:05,812 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 3 predicate places. [2022-11-20 12:38:05,812 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 329 transitions, 702 flow [2022-11-20 12:38:05,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 311.5) internal successors, (1246), 4 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:05,813 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:05,813 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-20 12:38:05,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:38:05,814 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-20 12:38:05,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:05,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1545477069, now seen corresponding path program 1 times [2022-11-20 12:38:05,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:05,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242852164] [2022-11-20 12:38:05,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:05,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:05,858 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-20 12:38:05,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:05,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242852164] [2022-11-20 12:38:05,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242852164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:05,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:05,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:38:05,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147954999] [2022-11-20 12:38:05,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:05,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:38:05,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:05,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:38:05,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:38:05,862 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-20 12:38:05,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 329 transitions, 702 flow. Second operand has 4 states, 4 states have (on average 313.25) internal successors, (1253), 4 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:05,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:05,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-20 12:38:05,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:06,011 INFO L130 PetriNetUnfolder]: 17/628 cut-off events. [2022-11-20 12:38:06,011 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-20 12:38:06,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 628 events. 17/628 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3351 event pairs, 0 based on Foata normal form. 1/549 useless extension candidates. Maximal degree in co-relation 629. Up to 11 conditions per place. [2022-11-20 12:38:06,024 INFO L137 encePairwiseOnDemand]: 374/380 looper letters, 11 selfloop transitions, 8 changer transitions 0/329 dead transitions. [2022-11-20 12:38:06,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 329 transitions, 738 flow [2022-11-20 12:38:06,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:38:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 12:38:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1567 transitions. [2022-11-20 12:38:06,029 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8247368421052632 [2022-11-20 12:38:06,029 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1567 transitions. [2022-11-20 12:38:06,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1567 transitions. [2022-11-20 12:38:06,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:06,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1567 transitions. [2022-11-20 12:38:06,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 313.4) internal successors, (1567), 5 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:06,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:06,073 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:06,073 INFO L175 Difference]: Start difference. First operand has 328 places, 329 transitions, 702 flow. Second operand 5 states and 1567 transitions. [2022-11-20 12:38:06,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 329 transitions, 738 flow [2022-11-20 12:38:06,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 329 transitions, 736 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 12:38:06,079 INFO L231 Difference]: Finished difference. Result has 331 places, 329 transitions, 720 flow [2022-11-20 12:38:06,079 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=720, PETRI_PLACES=331, PETRI_TRANSITIONS=329} [2022-11-20 12:38:06,080 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 6 predicate places. [2022-11-20 12:38:06,080 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 329 transitions, 720 flow [2022-11-20 12:38:06,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 313.25) internal successors, (1253), 4 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:06,081 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:06,081 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-20 12:38:06,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:38:06,082 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-20 12:38:06,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:06,082 INFO L85 PathProgramCache]: Analyzing trace with hash -665147737, now seen corresponding path program 1 times [2022-11-20 12:38:06,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:06,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901349868] [2022-11-20 12:38:06,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:06,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:06,145 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-20 12:38:06,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:06,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901349868] [2022-11-20 12:38:06,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901349868] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:38:06,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612569995] [2022-11-20 12:38:06,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:06,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:06,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:38:06,147 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:38:06,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:38:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:06,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:38:06,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:06,293 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-20 12:38:06,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:38:06,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612569995] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:06,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:38:06,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 12:38:06,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076259118] [2022-11-20 12:38:06,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:06,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:38:06,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:06,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:38:06,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:38:06,299 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-20 12:38:06,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 329 transitions, 720 flow. Second operand has 5 states, 5 states have (on average 312.8) internal successors, (1564), 5 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:06,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:06,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-20 12:38:06,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:06,446 INFO L130 PetriNetUnfolder]: 17/627 cut-off events. [2022-11-20 12:38:06,446 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-11-20 12:38:06,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 627 events. 17/627 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3337 event pairs, 0 based on Foata normal form. 1/548 useless extension candidates. Maximal degree in co-relation 627. Up to 14 conditions per place. [2022-11-20 12:38:06,458 INFO L137 encePairwiseOnDemand]: 376/380 looper letters, 13 selfloop transitions, 5 changer transitions 0/328 dead transitions. [2022-11-20 12:38:06,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 328 transitions, 752 flow [2022-11-20 12:38:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:38:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 12:38:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1255 transitions. [2022-11-20 12:38:06,462 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8256578947368421 [2022-11-20 12:38:06,462 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1255 transitions. [2022-11-20 12:38:06,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1255 transitions. [2022-11-20 12:38:06,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:06,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1255 transitions. [2022-11-20 12:38:06,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 313.75) internal successors, (1255), 4 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:06,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 380.0) internal successors, (1900), 5 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:06,469 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 380.0) internal successors, (1900), 5 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:06,469 INFO L175 Difference]: Start difference. First operand has 331 places, 329 transitions, 720 flow. Second operand 4 states and 1255 transitions. [2022-11-20 12:38:06,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 328 transitions, 752 flow [2022-11-20 12:38:06,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 328 transitions, 740 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:38:06,476 INFO L231 Difference]: Finished difference. Result has 330 places, 328 transitions, 714 flow [2022-11-20 12:38:06,477 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=714, PETRI_PLACES=330, PETRI_TRANSITIONS=328} [2022-11-20 12:38:06,477 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 5 predicate places. [2022-11-20 12:38:06,478 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 328 transitions, 714 flow [2022-11-20 12:38:06,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 312.8) internal successors, (1564), 5 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:06,478 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:06,479 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-20 12:38:06,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 12:38:06,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:06,690 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-20 12:38:06,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:06,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1243406533, now seen corresponding path program 1 times [2022-11-20 12:38:06,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:06,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063442132] [2022-11-20 12:38:06,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:06,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:38:06,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:06,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063442132] [2022-11-20 12:38:06,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063442132] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:38:06,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412890510] [2022-11-20 12:38:06,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:06,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:06,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:38:06,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:38:06,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 12:38:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:06,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:38:06,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:38:06,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:38:06,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-20 12:38:06,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412890510] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:38:06,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:38:06,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 12:38:06,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392864432] [2022-11-20 12:38:06,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:38:06,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:38:06,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:06,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:38:06,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:38:06,918 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-20 12:38:06,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 328 transitions, 714 flow. Second operand has 10 states, 10 states have (on average 312.7) internal successors, (3127), 10 states have internal predecessors, (3127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:06,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:06,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-20 12:38:06,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:07,178 INFO L130 PetriNetUnfolder]: 17/635 cut-off events. [2022-11-20 12:38:07,179 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-20 12:38:07,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 635 events. 17/635 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3323 event pairs, 0 based on Foata normal form. 2/557 useless extension candidates. Maximal degree in co-relation 617. Up to 11 conditions per place. [2022-11-20 12:38:07,197 INFO L137 encePairwiseOnDemand]: 374/380 looper letters, 20 selfloop transitions, 9 changer transitions 0/339 dead transitions. [2022-11-20 12:38:07,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 339 transitions, 810 flow [2022-11-20 12:38:07,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:38:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:38:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2821 transitions. [2022-11-20 12:38:07,204 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8248538011695906 [2022-11-20 12:38:07,204 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2821 transitions. [2022-11-20 12:38:07,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2821 transitions. [2022-11-20 12:38:07,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:07,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2821 transitions. [2022-11-20 12:38:07,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 313.44444444444446) internal successors, (2821), 9 states have internal predecessors, (2821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:07,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 380.0) internal successors, (3800), 10 states have internal predecessors, (3800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:07,219 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 380.0) internal successors, (3800), 10 states have internal predecessors, (3800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:07,220 INFO L175 Difference]: Start difference. First operand has 330 places, 328 transitions, 714 flow. Second operand 9 states and 2821 transitions. [2022-11-20 12:38:07,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 339 transitions, 810 flow [2022-11-20 12:38:07,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 339 transitions, 796 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:38:07,226 INFO L231 Difference]: Finished difference. Result has 339 places, 332 transitions, 760 flow [2022-11-20 12:38:07,227 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=760, PETRI_PLACES=339, PETRI_TRANSITIONS=332} [2022-11-20 12:38:07,228 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 14 predicate places. [2022-11-20 12:38:07,228 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 332 transitions, 760 flow [2022-11-20 12:38:07,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 312.7) internal successors, (3127), 10 states have internal predecessors, (3127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:07,229 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:07,229 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-20 12:38:07,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 12:38:07,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 12:38:07,436 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-20 12:38:07,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:07,436 INFO L85 PathProgramCache]: Analyzing trace with hash -479457019, now seen corresponding path program 2 times [2022-11-20 12:38:07,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:07,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62666245] [2022-11-20 12:38:07,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:07,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:07,497 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-20 12:38:07,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:07,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62666245] [2022-11-20 12:38:07,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62666245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:07,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:07,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:38:07,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751822212] [2022-11-20 12:38:07,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:07,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:38:07,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:07,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:38:07,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:38:07,500 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-20 12:38:07,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 332 transitions, 760 flow. Second operand has 4 states, 4 states have (on average 311.75) internal successors, (1247), 4 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:07,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:07,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-20 12:38:07,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:07,654 INFO L130 PetriNetUnfolder]: 13/516 cut-off events. [2022-11-20 12:38:07,654 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-20 12:38:07,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 516 events. 13/516 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2446 event pairs, 0 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 520. Up to 21 conditions per place. [2022-11-20 12:38:07,665 INFO L137 encePairwiseOnDemand]: 373/380 looper letters, 19 selfloop transitions, 4 changer transitions 0/339 dead transitions. [2022-11-20 12:38:07,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 339 transitions, 820 flow [2022-11-20 12:38:07,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:38:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 12:38:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1576 transitions. [2022-11-20 12:38:07,669 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8294736842105264 [2022-11-20 12:38:07,669 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1576 transitions. [2022-11-20 12:38:07,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1576 transitions. [2022-11-20 12:38:07,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:07,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1576 transitions. [2022-11-20 12:38:07,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 315.2) internal successors, (1576), 5 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:07,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:07,676 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:07,676 INFO L175 Difference]: Start difference. First operand has 339 places, 332 transitions, 760 flow. Second operand 5 states and 1576 transitions. [2022-11-20 12:38:07,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 339 transitions, 820 flow [2022-11-20 12:38:07,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 339 transitions, 804 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-20 12:38:07,683 INFO L231 Difference]: Finished difference. Result has 342 places, 335 transitions, 776 flow [2022-11-20 12:38:07,684 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=776, PETRI_PLACES=342, PETRI_TRANSITIONS=335} [2022-11-20 12:38:07,684 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 17 predicate places. [2022-11-20 12:38:07,684 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 335 transitions, 776 flow [2022-11-20 12:38:07,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 311.75) internal successors, (1247), 4 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:07,686 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:07,686 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-20 12:38:07,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 12:38:07,686 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-20 12:38:07,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:07,687 INFO L85 PathProgramCache]: Analyzing trace with hash -504147163, now seen corresponding path program 1 times [2022-11-20 12:38:07,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:07,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801886574] [2022-11-20 12:38:07,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:07,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:07,753 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-20 12:38:07,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:07,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801886574] [2022-11-20 12:38:07,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801886574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:07,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:07,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:38:07,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206654546] [2022-11-20 12:38:07,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:07,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:38:07,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:07,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:38:07,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:38:07,757 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-20 12:38:07,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 335 transitions, 776 flow. Second operand has 4 states, 4 states have (on average 313.75) internal successors, (1255), 4 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:07,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:07,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-20 12:38:07,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:07,889 INFO L130 PetriNetUnfolder]: 13/515 cut-off events. [2022-11-20 12:38:07,890 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-11-20 12:38:07,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 515 events. 13/515 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2447 event pairs, 0 based on Foata normal form. 1/458 useless extension candidates. Maximal degree in co-relation 527. Up to 10 conditions per place. [2022-11-20 12:38:07,901 INFO L137 encePairwiseOnDemand]: 374/380 looper letters, 11 selfloop transitions, 8 changer transitions 0/335 dead transitions. [2022-11-20 12:38:07,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 335 transitions, 812 flow [2022-11-20 12:38:07,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:38:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 12:38:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1567 transitions. [2022-11-20 12:38:07,904 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8247368421052632 [2022-11-20 12:38:07,904 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1567 transitions. [2022-11-20 12:38:07,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1567 transitions. [2022-11-20 12:38:07,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:07,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1567 transitions. [2022-11-20 12:38:07,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 313.4) internal successors, (1567), 5 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:07,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:07,911 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:07,912 INFO L175 Difference]: Start difference. First operand has 342 places, 335 transitions, 776 flow. Second operand 5 states and 1567 transitions. [2022-11-20 12:38:07,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 335 transitions, 812 flow [2022-11-20 12:38:07,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 335 transitions, 810 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 12:38:07,918 INFO L231 Difference]: Finished difference. Result has 345 places, 335 transitions, 794 flow [2022-11-20 12:38:07,919 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=794, PETRI_PLACES=345, PETRI_TRANSITIONS=335} [2022-11-20 12:38:07,920 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 20 predicate places. [2022-11-20 12:38:07,920 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 335 transitions, 794 flow [2022-11-20 12:38:07,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 313.75) internal successors, (1255), 4 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:07,920 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:07,921 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-20 12:38:07,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 12:38:07,921 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-20 12:38:07,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:07,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1551308074, now seen corresponding path program 1 times [2022-11-20 12:38:07,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:07,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527596985] [2022-11-20 12:38:07,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:07,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:08,054 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-20 12:38:08,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:08,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527596985] [2022-11-20 12:38:08,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527596985] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:38:08,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182338131] [2022-11-20 12:38:08,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:08,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:08,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:38:08,056 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:38:08,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 12:38:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:08,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 12:38:08,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:08,221 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-20 12:38:08,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:38:08,337 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-20 12:38:08,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182338131] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:38:08,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:38:08,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-20 12:38:08,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178461334] [2022-11-20 12:38:08,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:38:08,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 12:38:08,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:08,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 12:38:08,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:38:08,344 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-20 12:38:08,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 335 transitions, 794 flow. Second operand has 18 states, 18 states have (on average 313.1111111111111) internal successors, (5636), 18 states have internal predecessors, (5636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:08,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:08,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-20 12:38:08,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:08,711 INFO L130 PetriNetUnfolder]: 13/543 cut-off events. [2022-11-20 12:38:08,711 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-11-20 12:38:08,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 543 events. 13/543 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2440 event pairs, 0 based on Foata normal form. 4/489 useless extension candidates. Maximal degree in co-relation 521. Up to 11 conditions per place. [2022-11-20 12:38:08,722 INFO L137 encePairwiseOnDemand]: 374/380 looper letters, 36 selfloop transitions, 21 changer transitions 0/370 dead transitions. [2022-11-20 12:38:08,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 370 transitions, 1062 flow [2022-11-20 12:38:08,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 12:38:08,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-20 12:38:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6571 transitions. [2022-11-20 12:38:08,734 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8234335839598997 [2022-11-20 12:38:08,734 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 6571 transitions. [2022-11-20 12:38:08,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 6571 transitions. [2022-11-20 12:38:08,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:08,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 6571 transitions. [2022-11-20 12:38:08,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 312.9047619047619) internal successors, (6571), 21 states have internal predecessors, (6571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:08,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 380.0) internal successors, (8360), 22 states have internal predecessors, (8360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:08,766 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 380.0) internal successors, (8360), 22 states have internal predecessors, (8360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:08,766 INFO L175 Difference]: Start difference. First operand has 345 places, 335 transitions, 794 flow. Second operand 21 states and 6571 transitions. [2022-11-20 12:38:08,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 370 transitions, 1062 flow [2022-11-20 12:38:08,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 370 transitions, 1050 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:38:08,775 INFO L231 Difference]: Finished difference. Result has 367 places, 348 transitions, 938 flow [2022-11-20 12:38:08,775 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=938, PETRI_PLACES=367, PETRI_TRANSITIONS=348} [2022-11-20 12:38:08,776 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 42 predicate places. [2022-11-20 12:38:08,777 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 348 transitions, 938 flow [2022-11-20 12:38:08,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 313.1111111111111) internal successors, (5636), 18 states have internal predecessors, (5636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:08,778 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:08,779 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-20 12:38:08,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-20 12:38:08,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:08,984 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-20 12:38:08,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:08,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1908419414, now seen corresponding path program 2 times [2022-11-20 12:38:08,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:08,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650326499] [2022-11-20 12:38:08,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:08,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:09,340 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-20 12:38:09,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:09,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650326499] [2022-11-20 12:38:09,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650326499] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:38:09,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080660112] [2022-11-20 12:38:09,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:38:09,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:09,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:38:09,342 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:38:09,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 12:38:09,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:38:09,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:38:09,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 12:38:09,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:09,571 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-20 12:38:09,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:38:09,811 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-20 12:38:09,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080660112] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:38:09,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:38:09,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-20 12:38:09,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710540039] [2022-11-20 12:38:09,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:38:09,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 12:38:09,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:09,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 12:38:09,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-20 12:38:09,821 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-20 12:38:09,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 348 transitions, 938 flow. Second operand has 23 states, 23 states have (on average 313.3478260869565) internal successors, (7207), 23 states have internal predecessors, (7207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:09,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:09,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-20 12:38:09,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:10,307 INFO L130 PetriNetUnfolder]: 13/564 cut-off events. [2022-11-20 12:38:10,307 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2022-11-20 12:38:10,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 564 events. 13/564 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2440 event pairs, 0 based on Foata normal form. 3/509 useless extension candidates. Maximal degree in co-relation 575. Up to 12 conditions per place. [2022-11-20 12:38:10,321 INFO L137 encePairwiseOnDemand]: 374/380 looper letters, 48 selfloop transitions, 30 changer transitions 0/391 dead transitions. [2022-11-20 12:38:10,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 391 transitions, 1304 flow [2022-11-20 12:38:10,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 12:38:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-20 12:38:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9381 transitions. [2022-11-20 12:38:10,335 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8228947368421052 [2022-11-20 12:38:10,336 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 9381 transitions. [2022-11-20 12:38:10,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 9381 transitions. [2022-11-20 12:38:10,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:10,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 9381 transitions. [2022-11-20 12:38:10,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 312.7) internal successors, (9381), 30 states have internal predecessors, (9381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:10,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 380.0) internal successors, (11780), 31 states have internal predecessors, (11780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:10,378 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 380.0) internal successors, (11780), 31 states have internal predecessors, (11780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:10,379 INFO L175 Difference]: Start difference. First operand has 367 places, 348 transitions, 938 flow. Second operand 30 states and 9381 transitions. [2022-11-20 12:38:10,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 391 transitions, 1304 flow [2022-11-20 12:38:10,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 391 transitions, 1224 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-20 12:38:10,388 INFO L231 Difference]: Finished difference. Result has 392 places, 358 transitions, 1036 flow [2022-11-20 12:38:10,390 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1036, PETRI_PLACES=392, PETRI_TRANSITIONS=358} [2022-11-20 12:38:10,390 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 67 predicate places. [2022-11-20 12:38:10,390 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 358 transitions, 1036 flow [2022-11-20 12:38:10,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 313.3478260869565) internal successors, (7207), 23 states have internal predecessors, (7207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:10,393 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:10,393 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-20 12:38:10,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-20 12:38:10,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 12:38:10,600 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-20 12:38:10,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:10,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2090743300, now seen corresponding path program 3 times [2022-11-20 12:38:10,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:10,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028966521] [2022-11-20 12:38:10,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:10,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:10,732 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-20 12:38:10,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:10,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028966521] [2022-11-20 12:38:10,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028966521] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:38:10,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867132645] [2022-11-20 12:38:10,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:38:10,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:10,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:38:10,734 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:38:10,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 12:38:10,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 12:38:10,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:38:10,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:38:10,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:10,926 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-20 12:38:10,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:38:10,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867132645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:10,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:38:10,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 12:38:10,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143695726] [2022-11-20 12:38:10,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:10,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:38:10,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:10,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:38:10,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:38:10,931 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-20 12:38:10,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 358 transitions, 1036 flow. Second operand has 5 states, 5 states have (on average 313.2) internal successors, (1566), 5 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:10,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:10,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-20 12:38:10,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:11,142 INFO L130 PetriNetUnfolder]: 13/563 cut-off events. [2022-11-20 12:38:11,142 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-11-20 12:38:11,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 563 events. 13/563 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2437 event pairs, 0 based on Foata normal form. 1/506 useless extension candidates. Maximal degree in co-relation 536. Up to 17 conditions per place. [2022-11-20 12:38:11,157 INFO L137 encePairwiseOnDemand]: 376/380 looper letters, 13 selfloop transitions, 5 changer transitions 0/357 dead transitions. [2022-11-20 12:38:11,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 357 transitions, 1068 flow [2022-11-20 12:38:11,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:38:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 12:38:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1255 transitions. [2022-11-20 12:38:11,159 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8256578947368421 [2022-11-20 12:38:11,159 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1255 transitions. [2022-11-20 12:38:11,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1255 transitions. [2022-11-20 12:38:11,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:11,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1255 transitions. [2022-11-20 12:38:11,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 313.75) internal successors, (1255), 4 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:11,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 380.0) internal successors, (1900), 5 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:11,166 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 380.0) internal successors, (1900), 5 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:11,166 INFO L175 Difference]: Start difference. First operand has 392 places, 358 transitions, 1036 flow. Second operand 4 states and 1255 transitions. [2022-11-20 12:38:11,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 357 transitions, 1068 flow [2022-11-20 12:38:11,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 357 transitions, 1022 flow, removed 5 selfloop flow, removed 18 redundant places. [2022-11-20 12:38:11,174 INFO L231 Difference]: Finished difference. Result has 376 places, 357 transitions, 996 flow [2022-11-20 12:38:11,175 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=996, PETRI_PLACES=376, PETRI_TRANSITIONS=357} [2022-11-20 12:38:11,175 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 51 predicate places. [2022-11-20 12:38:11,176 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 357 transitions, 996 flow [2022-11-20 12:38:11,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 313.2) internal successors, (1566), 5 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:11,176 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:11,177 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-20 12:38:11,182 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-20 12:38:11,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 12:38:11,383 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-20 12:38:11,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:11,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2023100470, now seen corresponding path program 1 times [2022-11-20 12:38:11,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:11,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89364746] [2022-11-20 12:38:11,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:11,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:12,267 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-20 12:38:12,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:12,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89364746] [2022-11-20 12:38:12,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89364746] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:12,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:12,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 12:38:12,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460938021] [2022-11-20 12:38:12,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:12,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 12:38:12,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:12,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 12:38:12,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:38:12,273 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 380 [2022-11-20 12:38:12,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 357 transitions, 996 flow. Second operand has 13 states, 13 states have (on average 242.15384615384616) internal successors, (3148), 13 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:12,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:12,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 380 [2022-11-20 12:38:12,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:35,128 INFO L130 PetriNetUnfolder]: 39167/112347 cut-off events. [2022-11-20 12:38:35,128 INFO L131 PetriNetUnfolder]: For 983/984 co-relation queries the response was YES. [2022-11-20 12:38:35,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170324 conditions, 112347 events. 39167/112347 cut-off events. For 983/984 co-relation queries the response was YES. Maximal size of possible extension queue 3170. Compared 1622938 event pairs, 7977 based on Foata normal form. 0/100150 useless extension candidates. Maximal degree in co-relation 170056. Up to 33109 conditions per place. [2022-11-20 12:38:36,318 INFO L137 encePairwiseOnDemand]: 359/380 looper letters, 546 selfloop transitions, 72 changer transitions 0/889 dead transitions. [2022-11-20 12:38:36,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 889 transitions, 3377 flow [2022-11-20 12:38:36,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 12:38:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-11-20 12:38:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 6630 transitions. [2022-11-20 12:38:36,329 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6978947368421052 [2022-11-20 12:38:36,329 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 6630 transitions. [2022-11-20 12:38:36,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 6630 transitions. [2022-11-20 12:38:36,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:36,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 6630 transitions. [2022-11-20 12:38:36,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 265.2) internal successors, (6630), 25 states have internal predecessors, (6630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:36,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 380.0) internal successors, (9880), 26 states have internal predecessors, (9880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:36,524 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 380.0) internal successors, (9880), 26 states have internal predecessors, (9880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:36,524 INFO L175 Difference]: Start difference. First operand has 376 places, 357 transitions, 996 flow. Second operand 25 states and 6630 transitions. [2022-11-20 12:38:36,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 889 transitions, 3377 flow [2022-11-20 12:38:36,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 889 transitions, 3367 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:38:36,547 INFO L231 Difference]: Finished difference. Result has 415 places, 443 transitions, 1556 flow [2022-11-20 12:38:36,547 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1556, PETRI_PLACES=415, PETRI_TRANSITIONS=443} [2022-11-20 12:38:36,548 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 90 predicate places. [2022-11-20 12:38:36,548 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 443 transitions, 1556 flow [2022-11-20 12:38:36,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 242.15384615384616) internal successors, (3148), 13 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:36,549 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:36,549 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:38:36,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 12:38:36,550 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-20 12:38:36,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:36,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1238947357, now seen corresponding path program 1 times [2022-11-20 12:38:36,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:36,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932625707] [2022-11-20 12:38:36,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:36,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:36,674 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-20 12:38:36,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:36,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932625707] [2022-11-20 12:38:36,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932625707] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:38:36,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199756443] [2022-11-20 12:38:36,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:36,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:36,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:38:36,677 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:38:36,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 12:38:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:36,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 12:38:36,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:36,823 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-20 12:38:36,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:38:36,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199756443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:36,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:38:36,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-20 12:38:36,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966809121] [2022-11-20 12:38:36,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:36,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:38:36,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:36,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:38:36,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:38:36,827 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 380 [2022-11-20 12:38:36,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 443 transitions, 1556 flow. Second operand has 3 states, 3 states have (on average 315.6666666666667) internal successors, (947), 3 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:36,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:36,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 380 [2022-11-20 12:38:36,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:38,333 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] t_funEXIT-->L958-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_7|} AuxVars[] AssignedVars[][383], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, t_funThread1of2ForFork0NotInUse, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 12:38:38,334 INFO L383 tUnfolder$Statistics]: this new event has 225 ancestors and is cut-off event [2022-11-20 12:38:38,334 INFO L386 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-11-20 12:38:38,334 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-20 12:38:38,334 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-20 12:38:38,552 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] t_funEXIT-->L958-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_7|} AuxVars[] AssignedVars[][383], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, t_funThread1of2ForFork0NotInUse, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread2of2ForFork0InUse, Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), 21#t_funENTRYtrue, Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 12:38:38,552 INFO L383 tUnfolder$Statistics]: this new event has 237 ancestors and is cut-off event [2022-11-20 12:38:38,553 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-20 12:38:38,553 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-20 12:38:38,553 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-20 12:38:38,565 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1319] t_funEXIT-->L958-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][416], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 249#t_funENTRYtrue, Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 12:38:38,565 INFO L383 tUnfolder$Statistics]: this new event has 237 ancestors and is cut-off event [2022-11-20 12:38:38,565 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-20 12:38:38,565 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-20 12:38:38,565 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-20 12:38:38,674 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] t_funEXIT-->L958-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_7|} AuxVars[] AssignedVars[][383], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, t_funThread1of2ForFork0NotInUse, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread2of2ForFork0InUse, Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 232#L941-10true, 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 12:38:38,674 INFO L383 tUnfolder$Statistics]: this new event has 246 ancestors and is cut-off event [2022-11-20 12:38:38,674 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-20 12:38:38,674 INFO L386 tUnfolder$Statistics]: existing Event has 258 ancestors and is cut-off event [2022-11-20 12:38:38,675 INFO L386 tUnfolder$Statistics]: existing Event has 246 ancestors and is cut-off event [2022-11-20 12:38:38,675 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1319] t_funEXIT-->L958-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][416], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 17#L940true, Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 12:38:38,675 INFO L383 tUnfolder$Statistics]: this new event has 245 ancestors and is cut-off event [2022-11-20 12:38:38,675 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-20 12:38:38,675 INFO L386 tUnfolder$Statistics]: existing Event has 245 ancestors and is cut-off event [2022-11-20 12:38:38,675 INFO L386 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-11-20 12:38:38,726 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1319] t_funEXIT-->L958-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][416], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, t_funThread1of2ForFork0NotInUse, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 12:38:38,726 INFO L383 tUnfolder$Statistics]: this new event has 270 ancestors and is cut-off event [2022-11-20 12:38:38,727 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 12:38:38,727 INFO L386 tUnfolder$Statistics]: existing Event has 252 ancestors and is cut-off event [2022-11-20 12:38:38,727 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-20 12:38:38,780 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1319] t_funEXIT-->L958-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][416], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, t_funThread1of2ForFork0NotInUse, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 12:38:38,780 INFO L383 tUnfolder$Statistics]: this new event has 252 ancestors and is cut-off event [2022-11-20 12:38:38,780 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 12:38:38,781 INFO L386 tUnfolder$Statistics]: existing Event has 270 ancestors and is cut-off event [2022-11-20 12:38:38,781 INFO L386 tUnfolder$Statistics]: existing Event has 252 ancestors and is cut-off event [2022-11-20 12:38:38,781 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-20 12:38:38,782 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1061] L953-17-->L953-18: Formula: (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t_ids~0#1.base_5| 0)) InVars {ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid][387], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, t_funThread1of2ForFork0NotInUse, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread2of2ForFork0InUse, Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), 2234#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 232#L941-10true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 136#L953-18true, Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 12:38:38,782 INFO L383 tUnfolder$Statistics]: this new event has 225 ancestors and is cut-off event [2022-11-20 12:38:38,783 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-20 12:38:38,783 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-20 12:38:38,783 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-20 12:38:38,825 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1319] t_funEXIT-->L958-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][416], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, 97#L941-6true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 12:38:38,826 INFO L383 tUnfolder$Statistics]: this new event has 254 ancestors and is cut-off event [2022-11-20 12:38:38,826 INFO L386 tUnfolder$Statistics]: existing Event has 254 ancestors and is cut-off event [2022-11-20 12:38:38,826 INFO L386 tUnfolder$Statistics]: existing Event has 212 ancestors and is cut-off event [2022-11-20 12:38:38,826 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-20 12:38:38,992 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1160] L946-4-->L946-5: Formula: (and (= |v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset_1| (+ (* |v_t_funThread1of2ForFork0_~i~0#1_9| 28) |v_~#cache~0.offset_11|)) (= |v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base_1| |v_~#cache~0.base_12|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_11|, ~#cache~0.base=|v_~#cache~0.base_12|, t_funThread1of2ForFork0_~i~0#1=|v_t_funThread1of2ForFork0_~i~0#1_9|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_11|, ~#cache~0.base=|v_~#cache~0.base_12|, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base=|v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base_1|, t_funThread1of2ForFork0_~i~0#1=|v_t_funThread1of2ForFork0_~i~0#1_9|, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset=|v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset_1|} AuxVars[] AssignedVars[t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base][201], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread2of2ForFork0InUse, Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), 181#L946-5true, 280#L959true, Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 232#L941-10true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 12:38:38,993 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-20 12:38:38,993 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-20 12:38:38,993 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-20 12:38:38,994 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-20 12:38:39,063 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1061] L953-17-->L953-18: Formula: (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t_ids~0#1.base_5| 0)) InVars {ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid][387], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 153#L941-10true, Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), 2234#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 136#L953-18true, Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 12:38:39,063 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-20 12:38:39,063 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-20 12:38:39,064 INFO L386 tUnfolder$Statistics]: existing Event has 228 ancestors and is cut-off event [2022-11-20 12:38:39,064 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 12:38:39,064 INFO L130 PetriNetUnfolder]: 659/7493 cut-off events. [2022-11-20 12:38:39,064 INFO L131 PetriNetUnfolder]: For 3509/3738 co-relation queries the response was YES. [2022-11-20 12:38:39,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10297 conditions, 7493 events. 659/7493 cut-off events. For 3509/3738 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 81498 event pairs, 80 based on Foata normal form. 29/6508 useless extension candidates. Maximal degree in co-relation 10101. Up to 251 conditions per place. [2022-11-20 12:38:39,205 INFO L137 encePairwiseOnDemand]: 377/380 looper letters, 14 selfloop transitions, 2 changer transitions 0/447 dead transitions. [2022-11-20 12:38:39,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 447 transitions, 1596 flow [2022-11-20 12:38:39,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:38:39,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:38:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2022-11-20 12:38:39,209 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8412280701754385 [2022-11-20 12:38:39,209 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 959 transitions. [2022-11-20 12:38:39,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 959 transitions. [2022-11-20 12:38:39,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:39,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 959 transitions. [2022-11-20 12:38:39,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:39,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 380.0) internal successors, (1520), 4 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:39,221 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 380.0) internal successors, (1520), 4 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:39,221 INFO L175 Difference]: Start difference. First operand has 415 places, 443 transitions, 1556 flow. Second operand 3 states and 959 transitions. [2022-11-20 12:38:39,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 447 transitions, 1596 flow [2022-11-20 12:38:39,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 447 transitions, 1593 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:38:39,261 INFO L231 Difference]: Finished difference. Result has 416 places, 444 transitions, 1565 flow [2022-11-20 12:38:39,262 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1565, PETRI_PLACES=416, PETRI_TRANSITIONS=444} [2022-11-20 12:38:39,262 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 91 predicate places. [2022-11-20 12:38:39,263 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 444 transitions, 1565 flow [2022-11-20 12:38:39,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.6666666666667) internal successors, (947), 3 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:39,263 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:39,263 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-20 12:38:39,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-20 12:38:39,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:39,468 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-20 12:38:39,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:39,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1502322475, now seen corresponding path program 1 times [2022-11-20 12:38:39,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:39,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457898929] [2022-11-20 12:38:39,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:39,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:38:39,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:38:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:38:39,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:38:39,554 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:38:39,555 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 35 remaining) [2022-11-20 12:38:39,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 35 remaining) [2022-11-20 12:38:39,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 35 remaining) [2022-11-20 12:38:39,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 35 remaining) [2022-11-20 12:38:39,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 35 remaining) [2022-11-20 12:38:39,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 35 remaining) [2022-11-20 12:38:39,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 35 remaining) [2022-11-20 12:38:39,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 35 remaining) [2022-11-20 12:38:39,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 35 remaining) [2022-11-20 12:38:39,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 35 remaining) [2022-11-20 12:38:39,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 35 remaining) [2022-11-20 12:38:39,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 35 remaining) [2022-11-20 12:38:39,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 35 remaining) [2022-11-20 12:38:39,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 35 remaining) [2022-11-20 12:38:39,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 35 remaining) [2022-11-20 12:38:39,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 35 remaining) [2022-11-20 12:38:39,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 35 remaining) [2022-11-20 12:38:39,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 35 remaining) [2022-11-20 12:38:39,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 35 remaining) [2022-11-20 12:38:39,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 35 remaining) [2022-11-20 12:38:39,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 35 remaining) [2022-11-20 12:38:39,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 35 remaining) [2022-11-20 12:38:39,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 35 remaining) [2022-11-20 12:38:39,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 35 remaining) [2022-11-20 12:38:39,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 35 remaining) [2022-11-20 12:38:39,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 35 remaining) [2022-11-20 12:38:39,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 35 remaining) [2022-11-20 12:38:39,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 35 remaining) [2022-11-20 12:38:39,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 35 remaining) [2022-11-20 12:38:39,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 35 remaining) [2022-11-20 12:38:39,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 35 remaining) [2022-11-20 12:38:39,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 35 remaining) [2022-11-20 12:38:39,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 35 remaining) [2022-11-20 12:38:39,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 35 remaining) [2022-11-20 12:38:39,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 35 remaining) [2022-11-20 12:38:39,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 12:38:39,565 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:38:39,566 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-20 12:38:39,566 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-20 12:38:39,626 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 12:38:39,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 396 places, 464 transitions, 958 flow [2022-11-20 12:38:39,835 INFO L130 PetriNetUnfolder]: 168/1050 cut-off events. [2022-11-20 12:38:39,836 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-20 12:38:39,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 1050 events. 168/1050 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5982 event pairs, 1 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 739. Up to 16 conditions per place. [2022-11-20 12:38:39,857 INFO L82 GeneralOperation]: Start removeDead. Operand has 396 places, 464 transitions, 958 flow [2022-11-20 12:38:39,871 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 396 places, 464 transitions, 958 flow [2022-11-20 12:38:39,876 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:38:39,876 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;@4e977a42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:38:39,877 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-11-20 12:38:39,879 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-20 12:38:39,879 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:38:39,879 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:39,879 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-20 12:38:39,879 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-20 12:38:39,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:39,880 INFO L85 PathProgramCache]: Analyzing trace with hash 909625557, now seen corresponding path program 1 times [2022-11-20 12:38:39,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:39,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602133270] [2022-11-20 12:38:39,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:39,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:38:39,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:39,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602133270] [2022-11-20 12:38:39,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602133270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:39,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:39,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:38:39,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620479149] [2022-11-20 12:38:39,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:39,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:38:39,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:39,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:38:39,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:38:39,916 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-20 12:38:39,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 464 transitions, 958 flow. Second operand has 4 states, 4 states have (on average 380.5) internal successors, (1522), 4 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:39,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:39,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-20 12:38:39,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:40,130 INFO L130 PetriNetUnfolder]: 27/905 cut-off events. [2022-11-20 12:38:40,131 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-20 12:38:40,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 905 events. 27/905 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5231 event pairs, 1 based on Foata normal form. 258/1041 useless extension candidates. Maximal degree in co-relation 662. Up to 28 conditions per place. [2022-11-20 12:38:40,151 INFO L137 encePairwiseOnDemand]: 395/464 looper letters, 21 selfloop transitions, 4 changer transitions 0/404 dead transitions. [2022-11-20 12:38:40,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 404 transitions, 888 flow [2022-11-20 12:38:40,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:38:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 12:38:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1986 transitions. [2022-11-20 12:38:40,155 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8560344827586207 [2022-11-20 12:38:40,155 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1986 transitions. [2022-11-20 12:38:40,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1986 transitions. [2022-11-20 12:38:40,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:40,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1986 transitions. [2022-11-20 12:38:40,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 397.2) internal successors, (1986), 5 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:40,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:40,162 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:40,162 INFO L175 Difference]: Start difference. First operand has 396 places, 464 transitions, 958 flow. Second operand 5 states and 1986 transitions. [2022-11-20 12:38:40,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 404 transitions, 888 flow [2022-11-20 12:38:40,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 404 transitions, 888 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 12:38:40,169 INFO L231 Difference]: Finished difference. Result has 398 places, 400 transitions, 856 flow [2022-11-20 12:38:40,170 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=856, PETRI_PLACES=398, PETRI_TRANSITIONS=400} [2022-11-20 12:38:40,170 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 2 predicate places. [2022-11-20 12:38:40,170 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 400 transitions, 856 flow [2022-11-20 12:38:40,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 380.5) internal successors, (1522), 4 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:40,171 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:40,171 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-20 12:38:40,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 12:38:40,171 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-20 12:38:40,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:40,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1200505293, now seen corresponding path program 1 times [2022-11-20 12:38:40,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:40,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669837237] [2022-11-20 12:38:40,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:40,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:40,199 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-20 12:38:40,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:40,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669837237] [2022-11-20 12:38:40,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669837237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:40,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:40,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:38:40,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001208705] [2022-11-20 12:38:40,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:40,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:38:40,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:40,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:38:40,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:38:40,203 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-20 12:38:40,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 400 transitions, 856 flow. Second operand has 4 states, 4 states have (on average 382.25) internal successors, (1529), 4 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:40,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:40,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-20 12:38:40,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:40,408 INFO L130 PetriNetUnfolder]: 27/904 cut-off events. [2022-11-20 12:38:40,408 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-11-20 12:38:40,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 904 events. 27/904 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5224 event pairs, 1 based on Foata normal form. 1/786 useless extension candidates. Maximal degree in co-relation 927. Up to 20 conditions per place. [2022-11-20 12:38:40,429 INFO L137 encePairwiseOnDemand]: 458/464 looper letters, 13 selfloop transitions, 8 changer transitions 0/400 dead transitions. [2022-11-20 12:38:40,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 400 transitions, 896 flow [2022-11-20 12:38:40,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:38:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 12:38:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1914 transitions. [2022-11-20 12:38:40,432 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825 [2022-11-20 12:38:40,433 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1914 transitions. [2022-11-20 12:38:40,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1914 transitions. [2022-11-20 12:38:40,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:40,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1914 transitions. [2022-11-20 12:38:40,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 382.8) internal successors, (1914), 5 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:40,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:40,440 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:40,440 INFO L175 Difference]: Start difference. First operand has 398 places, 400 transitions, 856 flow. Second operand 5 states and 1914 transitions. [2022-11-20 12:38:40,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 400 transitions, 896 flow [2022-11-20 12:38:40,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 400 transitions, 894 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 12:38:40,447 INFO L231 Difference]: Finished difference. Result has 401 places, 400 transitions, 874 flow [2022-11-20 12:38:40,447 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=874, PETRI_PLACES=401, PETRI_TRANSITIONS=400} [2022-11-20 12:38:40,448 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 5 predicate places. [2022-11-20 12:38:40,448 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 400 transitions, 874 flow [2022-11-20 12:38:40,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 382.25) internal successors, (1529), 4 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:40,449 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:40,449 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-20 12:38:40,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 12:38:40,449 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-20 12:38:40,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:40,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1439043191, now seen corresponding path program 1 times [2022-11-20 12:38:40,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:40,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378927609] [2022-11-20 12:38:40,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:40,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:40,497 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-20 12:38:40,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:40,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378927609] [2022-11-20 12:38:40,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378927609] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:38:40,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995762403] [2022-11-20 12:38:40,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:40,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:40,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:38:40,499 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:38:40,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 12:38:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:40,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:38:40,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:40,648 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-20 12:38:40,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:38:40,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995762403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:40,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:38:40,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 12:38:40,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057287983] [2022-11-20 12:38:40,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:40,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:38:40,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:40,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:38:40,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:38:40,652 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-20 12:38:40,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 400 transitions, 874 flow. Second operand has 5 states, 5 states have (on average 381.8) internal successors, (1909), 5 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:40,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:40,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-20 12:38:40,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:40,861 INFO L130 PetriNetUnfolder]: 27/903 cut-off events. [2022-11-20 12:38:40,861 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-11-20 12:38:40,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 903 events. 27/903 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5219 event pairs, 1 based on Foata normal form. 1/785 useless extension candidates. Maximal degree in co-relation 925. Up to 23 conditions per place. [2022-11-20 12:38:40,882 INFO L137 encePairwiseOnDemand]: 460/464 looper letters, 15 selfloop transitions, 5 changer transitions 0/399 dead transitions. [2022-11-20 12:38:40,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 399 transitions, 910 flow [2022-11-20 12:38:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:38:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 12:38:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1533 transitions. [2022-11-20 12:38:40,885 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8259698275862069 [2022-11-20 12:38:40,885 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1533 transitions. [2022-11-20 12:38:40,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1533 transitions. [2022-11-20 12:38:40,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:40,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1533 transitions. [2022-11-20 12:38:40,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 383.25) internal successors, (1533), 4 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:40,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 464.0) internal successors, (2320), 5 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:40,891 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 464.0) internal successors, (2320), 5 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:40,891 INFO L175 Difference]: Start difference. First operand has 401 places, 400 transitions, 874 flow. Second operand 4 states and 1533 transitions. [2022-11-20 12:38:40,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 399 transitions, 910 flow [2022-11-20 12:38:40,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 399 transitions, 898 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:38:40,898 INFO L231 Difference]: Finished difference. Result has 400 places, 399 transitions, 868 flow [2022-11-20 12:38:40,899 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=868, PETRI_PLACES=400, PETRI_TRANSITIONS=399} [2022-11-20 12:38:40,899 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 4 predicate places. [2022-11-20 12:38:40,899 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 399 transitions, 868 flow [2022-11-20 12:38:40,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 381.8) internal successors, (1909), 5 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:40,900 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:40,900 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-20 12:38:40,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 12:38:41,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-20 12:38:41,113 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-20 12:38:41,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:41,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1930893337, now seen corresponding path program 1 times [2022-11-20 12:38:41,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:41,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27259974] [2022-11-20 12:38:41,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:41,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:38:41,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:41,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27259974] [2022-11-20 12:38:41,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27259974] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:38:41,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126289187] [2022-11-20 12:38:41,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:41,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:41,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:38:41,162 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:38:41,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 12:38:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:41,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:38:41,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:38:41,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:38:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:38:41,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126289187] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:38:41,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:38:41,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 12:38:41,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252245826] [2022-11-20 12:38:41,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:38:41,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:38:41,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:41,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:38:41,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:38:41,344 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-20 12:38:41,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 399 transitions, 868 flow. Second operand has 10 states, 10 states have (on average 381.7) internal successors, (3817), 10 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:41,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:41,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-20 12:38:41,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:41,669 INFO L130 PetriNetUnfolder]: 27/911 cut-off events. [2022-11-20 12:38:41,670 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-11-20 12:38:41,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 911 events. 27/911 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5208 event pairs, 1 based on Foata normal form. 2/794 useless extension candidates. Maximal degree in co-relation 915. Up to 20 conditions per place. [2022-11-20 12:38:41,688 INFO L137 encePairwiseOnDemand]: 458/464 looper letters, 22 selfloop transitions, 9 changer transitions 0/410 dead transitions. [2022-11-20 12:38:41,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 410 transitions, 968 flow [2022-11-20 12:38:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:38:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:38:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3444 transitions. [2022-11-20 12:38:41,693 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8247126436781609 [2022-11-20 12:38:41,694 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3444 transitions. [2022-11-20 12:38:41,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3444 transitions. [2022-11-20 12:38:41,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:41,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3444 transitions. [2022-11-20 12:38:41,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 382.6666666666667) internal successors, (3444), 9 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:41,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 464.0) internal successors, (4640), 10 states have internal predecessors, (4640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:41,707 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 464.0) internal successors, (4640), 10 states have internal predecessors, (4640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:41,707 INFO L175 Difference]: Start difference. First operand has 400 places, 399 transitions, 868 flow. Second operand 9 states and 3444 transitions. [2022-11-20 12:38:41,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 410 transitions, 968 flow [2022-11-20 12:38:41,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 410 transitions, 954 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:38:41,714 INFO L231 Difference]: Finished difference. Result has 409 places, 403 transitions, 914 flow [2022-11-20 12:38:41,715 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=914, PETRI_PLACES=409, PETRI_TRANSITIONS=403} [2022-11-20 12:38:41,716 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 13 predicate places. [2022-11-20 12:38:41,716 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 403 transitions, 914 flow [2022-11-20 12:38:41,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 381.7) internal successors, (3817), 10 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:41,717 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:41,717 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-20 12:38:41,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 12:38:41,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:41,922 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-20 12:38:41,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:41,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1058192857, now seen corresponding path program 2 times [2022-11-20 12:38:41,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:41,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234810098] [2022-11-20 12:38:41,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:41,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:41,969 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-20 12:38:41,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:41,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234810098] [2022-11-20 12:38:41,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234810098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:41,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:41,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:38:41,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681491161] [2022-11-20 12:38:41,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:41,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:38:41,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:41,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:38:41,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:38:41,973 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-20 12:38:41,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 403 transitions, 914 flow. Second operand has 4 states, 4 states have (on average 380.75) internal successors, (1523), 4 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:41,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:41,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-20 12:38:41,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:42,218 INFO L130 PetriNetUnfolder]: 23/792 cut-off events. [2022-11-20 12:38:42,219 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-11-20 12:38:42,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 792 events. 23/792 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4329 event pairs, 1 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 828. Up to 40 conditions per place. [2022-11-20 12:38:42,239 INFO L137 encePairwiseOnDemand]: 457/464 looper letters, 21 selfloop transitions, 4 changer transitions 0/410 dead transitions. [2022-11-20 12:38:42,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 410 transitions, 978 flow [2022-11-20 12:38:42,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:38:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 12:38:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1923 transitions. [2022-11-20 12:38:42,243 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8288793103448275 [2022-11-20 12:38:42,243 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1923 transitions. [2022-11-20 12:38:42,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1923 transitions. [2022-11-20 12:38:42,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:42,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1923 transitions. [2022-11-20 12:38:42,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 384.6) internal successors, (1923), 5 states have internal predecessors, (1923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:42,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:42,257 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:42,257 INFO L175 Difference]: Start difference. First operand has 409 places, 403 transitions, 914 flow. Second operand 5 states and 1923 transitions. [2022-11-20 12:38:42,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 410 transitions, 978 flow [2022-11-20 12:38:42,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 410 transitions, 962 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-20 12:38:42,265 INFO L231 Difference]: Finished difference. Result has 412 places, 406 transitions, 930 flow [2022-11-20 12:38:42,265 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=930, PETRI_PLACES=412, PETRI_TRANSITIONS=406} [2022-11-20 12:38:42,266 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 16 predicate places. [2022-11-20 12:38:42,266 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 406 transitions, 930 flow [2022-11-20 12:38:42,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 380.75) internal successors, (1523), 4 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:42,267 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:42,267 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-20 12:38:42,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 12:38:42,267 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-20 12:38:42,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:42,268 INFO L85 PathProgramCache]: Analyzing trace with hash -111328103, now seen corresponding path program 1 times [2022-11-20 12:38:42,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:42,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558735230] [2022-11-20 12:38:42,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:42,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:42,312 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-20 12:38:42,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:42,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558735230] [2022-11-20 12:38:42,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558735230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:42,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:42,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:38:42,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952868293] [2022-11-20 12:38:42,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:42,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:38:42,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:42,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:38:42,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:38:42,316 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-20 12:38:42,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 406 transitions, 930 flow. Second operand has 4 states, 4 states have (on average 382.75) internal successors, (1531), 4 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:42,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:42,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-20 12:38:42,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:42,545 INFO L130 PetriNetUnfolder]: 23/790 cut-off events. [2022-11-20 12:38:42,545 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-11-20 12:38:42,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 790 events. 23/790 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4318 event pairs, 1 based on Foata normal form. 2/698 useless extension candidates. Maximal degree in co-relation 838. Up to 20 conditions per place. [2022-11-20 12:38:42,567 INFO L137 encePairwiseOnDemand]: 458/464 looper letters, 13 selfloop transitions, 8 changer transitions 0/406 dead transitions. [2022-11-20 12:38:42,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 406 transitions, 970 flow [2022-11-20 12:38:42,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:38:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 12:38:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1914 transitions. [2022-11-20 12:38:42,570 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825 [2022-11-20 12:38:42,570 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1914 transitions. [2022-11-20 12:38:42,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1914 transitions. [2022-11-20 12:38:42,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:42,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1914 transitions. [2022-11-20 12:38:42,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 382.8) internal successors, (1914), 5 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:42,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:42,577 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:42,577 INFO L175 Difference]: Start difference. First operand has 412 places, 406 transitions, 930 flow. Second operand 5 states and 1914 transitions. [2022-11-20 12:38:42,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 406 transitions, 970 flow [2022-11-20 12:38:42,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 406 transitions, 968 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 12:38:42,586 INFO L231 Difference]: Finished difference. Result has 415 places, 406 transitions, 948 flow [2022-11-20 12:38:42,587 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=948, PETRI_PLACES=415, PETRI_TRANSITIONS=406} [2022-11-20 12:38:42,588 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 19 predicate places. [2022-11-20 12:38:42,588 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 406 transitions, 948 flow [2022-11-20 12:38:42,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 382.75) internal successors, (1531), 4 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:42,588 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:42,589 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-20 12:38:42,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 12:38:42,589 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-20 12:38:42,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:42,589 INFO L85 PathProgramCache]: Analyzing trace with hash 843797510, now seen corresponding path program 1 times [2022-11-20 12:38:42,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:42,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721802378] [2022-11-20 12:38:42,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:42,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:42,695 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-20 12:38:42,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:42,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721802378] [2022-11-20 12:38:42,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721802378] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:38:42,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074356751] [2022-11-20 12:38:42,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:42,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:42,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:38:42,700 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:38:42,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 12:38:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:42,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 12:38:42,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:42,880 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-20 12:38:42,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:38:42,985 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-20 12:38:42,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074356751] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:38:42,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:38:42,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-20 12:38:42,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313938601] [2022-11-20 12:38:42,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:38:42,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 12:38:42,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:42,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 12:38:42,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:38:42,993 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-20 12:38:43,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 406 transitions, 948 flow. Second operand has 18 states, 18 states have (on average 382.1111111111111) internal successors, (6878), 18 states have internal predecessors, (6878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:43,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:43,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-20 12:38:43,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:43,426 INFO L130 PetriNetUnfolder]: 23/818 cut-off events. [2022-11-20 12:38:43,426 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-11-20 12:38:43,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1034 conditions, 818 events. 23/818 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4308 event pairs, 1 based on Foata normal form. 4/728 useless extension candidates. Maximal degree in co-relation 828. Up to 20 conditions per place. [2022-11-20 12:38:43,448 INFO L137 encePairwiseOnDemand]: 458/464 looper letters, 38 selfloop transitions, 21 changer transitions 0/441 dead transitions. [2022-11-20 12:38:43,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 441 transitions, 1220 flow [2022-11-20 12:38:43,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 12:38:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-20 12:38:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 8022 transitions. [2022-11-20 12:38:43,465 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8232758620689655 [2022-11-20 12:38:43,466 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 8022 transitions. [2022-11-20 12:38:43,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 8022 transitions. [2022-11-20 12:38:43,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:43,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 8022 transitions. [2022-11-20 12:38:43,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 382.0) internal successors, (8022), 21 states have internal predecessors, (8022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:43,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 464.0) internal successors, (10208), 22 states have internal predecessors, (10208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:43,488 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 464.0) internal successors, (10208), 22 states have internal predecessors, (10208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:43,488 INFO L175 Difference]: Start difference. First operand has 415 places, 406 transitions, 948 flow. Second operand 21 states and 8022 transitions. [2022-11-20 12:38:43,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 441 transitions, 1220 flow [2022-11-20 12:38:43,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 441 transitions, 1208 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:38:43,498 INFO L231 Difference]: Finished difference. Result has 437 places, 419 transitions, 1092 flow [2022-11-20 12:38:43,500 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1092, PETRI_PLACES=437, PETRI_TRANSITIONS=419} [2022-11-20 12:38:43,500 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 41 predicate places. [2022-11-20 12:38:43,500 INFO L495 AbstractCegarLoop]: Abstraction has has 437 places, 419 transitions, 1092 flow [2022-11-20 12:38:43,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 382.1111111111111) internal successors, (6878), 18 states have internal predecessors, (6878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:43,502 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:43,502 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-20 12:38:43,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 12:38:43,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:43,712 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-20 12:38:43,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:43,713 INFO L85 PathProgramCache]: Analyzing trace with hash -619266170, now seen corresponding path program 2 times [2022-11-20 12:38:43,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:43,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277481894] [2022-11-20 12:38:43,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:43,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:43,995 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-20 12:38:43,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:43,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277481894] [2022-11-20 12:38:43,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277481894] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:38:43,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392795553] [2022-11-20 12:38:43,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:38:43,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:43,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:38:44,000 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:38:44,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 12:38:44,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:38:44,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:38:44,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 12:38:44,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:44,251 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-20 12:38:44,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:38:44,496 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-20 12:38:44,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392795553] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:38:44,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:38:44,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-20 12:38:44,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177198790] [2022-11-20 12:38:44,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:38:44,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 12:38:44,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:44,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 12:38:44,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-20 12:38:44,503 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-20 12:38:44,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 419 transitions, 1092 flow. Second operand has 23 states, 23 states have (on average 382.3478260869565) internal successors, (8794), 23 states have internal predecessors, (8794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:44,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:44,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-20 12:38:44,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:45,090 INFO L130 PetriNetUnfolder]: 23/839 cut-off events. [2022-11-20 12:38:45,090 INFO L131 PetriNetUnfolder]: For 274/274 co-relation queries the response was YES. [2022-11-20 12:38:45,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 839 events. 23/839 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4319 event pairs, 1 based on Foata normal form. 3/748 useless extension candidates. Maximal degree in co-relation 828. Up to 20 conditions per place. [2022-11-20 12:38:45,111 INFO L137 encePairwiseOnDemand]: 458/464 looper letters, 50 selfloop transitions, 30 changer transitions 0/462 dead transitions. [2022-11-20 12:38:45,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 462 transitions, 1462 flow [2022-11-20 12:38:45,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 12:38:45,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-20 12:38:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 11453 transitions. [2022-11-20 12:38:45,134 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8227729885057471 [2022-11-20 12:38:45,135 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 11453 transitions. [2022-11-20 12:38:45,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 11453 transitions. [2022-11-20 12:38:45,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:45,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 11453 transitions. [2022-11-20 12:38:45,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 381.76666666666665) internal successors, (11453), 30 states have internal predecessors, (11453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:45,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 464.0) internal successors, (14384), 31 states have internal predecessors, (14384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:45,174 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 464.0) internal successors, (14384), 31 states have internal predecessors, (14384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:45,174 INFO L175 Difference]: Start difference. First operand has 437 places, 419 transitions, 1092 flow. Second operand 30 states and 11453 transitions. [2022-11-20 12:38:45,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 462 transitions, 1462 flow [2022-11-20 12:38:45,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 462 transitions, 1382 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-20 12:38:45,184 INFO L231 Difference]: Finished difference. Result has 462 places, 429 transitions, 1190 flow [2022-11-20 12:38:45,185 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1190, PETRI_PLACES=462, PETRI_TRANSITIONS=429} [2022-11-20 12:38:45,185 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 66 predicate places. [2022-11-20 12:38:45,186 INFO L495 AbstractCegarLoop]: Abstraction has has 462 places, 429 transitions, 1190 flow [2022-11-20 12:38:45,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 382.3478260869565) internal successors, (8794), 23 states have internal predecessors, (8794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:45,187 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:45,188 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-20 12:38:45,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 12:38:45,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 12:38:45,393 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-20 12:38:45,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:45,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1386839720, now seen corresponding path program 3 times [2022-11-20 12:38:45,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:45,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634720205] [2022-11-20 12:38:45,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:45,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:45,498 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-20 12:38:45,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:45,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634720205] [2022-11-20 12:38:45,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634720205] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:38:45,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276900943] [2022-11-20 12:38:45,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:38:45,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:45,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:38:45,500 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:38:45,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 12:38:45,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 12:38:45,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:38:45,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:38:45,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:45,682 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-20 12:38:45,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:38:45,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276900943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:45,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:38:45,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 12:38:45,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732861557] [2022-11-20 12:38:45,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:45,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:38:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:45,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:38:45,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:38:45,685 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-20 12:38:45,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 429 transitions, 1190 flow. Second operand has 5 states, 5 states have (on average 382.2) internal successors, (1911), 5 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:45,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:45,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-20 12:38:45,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:45,909 INFO L130 PetriNetUnfolder]: 23/837 cut-off events. [2022-11-20 12:38:45,909 INFO L131 PetriNetUnfolder]: For 235/235 co-relation queries the response was YES. [2022-11-20 12:38:45,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 837 events. 23/837 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4297 event pairs, 1 based on Foata normal form. 2/745 useless extension candidates. Maximal degree in co-relation 846. Up to 30 conditions per place. [2022-11-20 12:38:45,932 INFO L137 encePairwiseOnDemand]: 460/464 looper letters, 15 selfloop transitions, 5 changer transitions 0/428 dead transitions. [2022-11-20 12:38:45,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 428 transitions, 1226 flow [2022-11-20 12:38:45,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:38:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 12:38:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1533 transitions. [2022-11-20 12:38:45,935 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8259698275862069 [2022-11-20 12:38:45,935 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1533 transitions. [2022-11-20 12:38:45,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1533 transitions. [2022-11-20 12:38:45,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:45,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1533 transitions. [2022-11-20 12:38:45,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 383.25) internal successors, (1533), 4 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:45,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 464.0) internal successors, (2320), 5 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:45,940 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 464.0) internal successors, (2320), 5 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:45,940 INFO L175 Difference]: Start difference. First operand has 462 places, 429 transitions, 1190 flow. Second operand 4 states and 1533 transitions. [2022-11-20 12:38:45,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 428 transitions, 1226 flow [2022-11-20 12:38:45,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 428 transitions, 1180 flow, removed 5 selfloop flow, removed 18 redundant places. [2022-11-20 12:38:45,950 INFO L231 Difference]: Finished difference. Result has 446 places, 428 transitions, 1150 flow [2022-11-20 12:38:45,951 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1150, PETRI_PLACES=446, PETRI_TRANSITIONS=428} [2022-11-20 12:38:45,952 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 50 predicate places. [2022-11-20 12:38:45,952 INFO L495 AbstractCegarLoop]: Abstraction has has 446 places, 428 transitions, 1150 flow [2022-11-20 12:38:45,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 382.2) internal successors, (1911), 5 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:45,953 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:45,953 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-20 12:38:45,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 12:38:46,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa548e9-325e-46fc-8976-18fee141261b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 12:38:46,158 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-20 12:38:46,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:46,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1525818324, now seen corresponding path program 1 times [2022-11-20 12:38:46,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:46,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192811165] [2022-11-20 12:38:46,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:46,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:46,876 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-20 12:38:46,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:46,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192811165] [2022-11-20 12:38:46,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192811165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:46,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:46,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 12:38:46,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712888540] [2022-11-20 12:38:46,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:46,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 12:38:46,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:46,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 12:38:46,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:38:46,883 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 464 [2022-11-20 12:38:46,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 428 transitions, 1150 flow. Second operand has 13 states, 13 states have (on average 299.15384615384613) internal successors, (3889), 13 states have internal predecessors, (3889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:38:46,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:46,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 464 [2022-11-20 12:38:46,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand