./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 246cd07a930f0cb8d777c2eae74f25d04e3267c275b813f0c0f5232c23299340 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:57:24,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:57:24,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:57:24,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:57:24,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:57:24,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:57:24,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:57:24,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:57:24,553 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:57:24,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:57:24,563 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:57:24,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:57:24,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:57:24,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:57:24,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:57:24,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:57:24,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:57:24,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:57:24,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:57:24,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:57:24,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:57:24,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:57:24,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:57:24,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:57:24,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:57:24,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:57:24,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:57:24,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:57:24,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:57:24,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:57:24,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:57:24,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:57:24,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:57:24,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:57:24,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:57:24,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:57:24,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:57:24,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:57:24,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:57:24,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:57:24,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:57:24,591 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-16 11:57:24,629 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:57:24,629 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:57:24,630 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:57:24,630 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:57:24,631 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:57:24,631 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:57:24,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:57:24,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:57:24,633 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:57:24,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:57:24,633 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:57:24,634 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:57:24,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:57:24,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:57:24,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:57:24,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:57:24,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:57:24,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:57:24,636 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-16 11:57:24,636 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:57:24,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:57:24,636 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:57:24,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:57:24,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:57:24,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:57:24,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:57:24,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:57:24,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:57:24,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:57:24,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:57:24,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:57:24,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:57:24,640 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:57:24,640 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:57:24,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:57:24,641 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_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/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_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 246cd07a930f0cb8d777c2eae74f25d04e3267c275b813f0c0f5232c23299340 [2022-11-16 11:57:24,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:57:24,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:57:24,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:57:24,916 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:57:24,919 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:57:24,920 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2022-11-16 11:57:25,006 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/data/980969570/42d4ac65f4624ac1ac4e90d18ea3f816/FLAGb2844cff7 [2022-11-16 11:57:25,618 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:57:25,618 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2022-11-16 11:57:25,650 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/data/980969570/42d4ac65f4624ac1ac4e90d18ea3f816/FLAGb2844cff7 [2022-11-16 11:57:25,851 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/data/980969570/42d4ac65f4624ac1ac4e90d18ea3f816 [2022-11-16 11:57:25,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:57:25,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:57:25,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:57:25,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:57:25,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:57:25,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:25" (1/1) ... [2022-11-16 11:57:25,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd41338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:25, skipping insertion in model container [2022-11-16 11:57:25,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:25" (1/1) ... [2022-11-16 11:57:25,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:57:25,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:57:26,495 WARN L229 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_efb3c938-4760-4330-b5da-b8412223c84e/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i[47038,47051] [2022-11-16 11:57:26,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:57:26,555 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:57:26,609 WARN L229 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_efb3c938-4760-4330-b5da-b8412223c84e/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i[47038,47051] [2022-11-16 11:57:26,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:57:26,680 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:57:26,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:26 WrapperNode [2022-11-16 11:57:26,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:57:26,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:57:26,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:57:26,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:57:26,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:26" (1/1) ... [2022-11-16 11:57:26,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:26" (1/1) ... [2022-11-16 11:57:26,743 INFO L138 Inliner]: procedures = 271, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 217 [2022-11-16 11:57:26,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:57:26,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:57:26,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:57:26,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:57:26,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:26" (1/1) ... [2022-11-16 11:57:26,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:26" (1/1) ... [2022-11-16 11:57:26,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:26" (1/1) ... [2022-11-16 11:57:26,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:26" (1/1) ... [2022-11-16 11:57:26,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:26" (1/1) ... [2022-11-16 11:57:26,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:26" (1/1) ... [2022-11-16 11:57:26,772 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:26" (1/1) ... [2022-11-16 11:57:26,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:26" (1/1) ... [2022-11-16 11:57:26,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:57:26,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:57:26,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:57:26,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:57:26,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:26" (1/1) ... [2022-11-16 11:57:26,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:57:26,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:26,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:57:26,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:57:26,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:57:26,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:57:26,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:57:26,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:57:26,847 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-16 11:57:26,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:57:26,847 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-16 11:57:26,847 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-16 11:57:26,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:57:26,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:57:26,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:57:26,849 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:57:26,982 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:57:26,984 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:57:27,513 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:57:27,522 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:57:27,522 INFO L300 CfgBuilder]: Removed 22 assume(true) statements. [2022-11-16 11:57:27,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:57:27 BoogieIcfgContainer [2022-11-16 11:57:27,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:57:27,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:57:27,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:57:27,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:57:27,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:57:25" (1/3) ... [2022-11-16 11:57:27,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1713ce2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:57:27, skipping insertion in model container [2022-11-16 11:57:27,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:26" (2/3) ... [2022-11-16 11:57:27,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1713ce2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:57:27, skipping insertion in model container [2022-11-16 11:57:27,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:57:27" (3/3) ... [2022-11-16 11:57:27,535 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_78-equ_racing.i [2022-11-16 11:57:27,561 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:57:27,571 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:57:27,571 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-16 11:57:27,572 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:57:27,723 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-16 11:57:27,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 236 transitions, 480 flow [2022-11-16 11:57:27,941 INFO L130 PetriNetUnfolder]: 43/315 cut-off events. [2022-11-16 11:57:27,942 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 11:57:27,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 315 events. 43/315 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1027 event pairs, 0 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 153. Up to 8 conditions per place. [2022-11-16 11:57:27,951 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 236 transitions, 480 flow [2022-11-16 11:57:27,965 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 231 transitions, 470 flow [2022-11-16 11:57:27,988 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:57:28,000 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;@6fb6619c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:57:28,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-16 11:57:28,018 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-11-16 11:57:28,018 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:57:28,018 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:28,019 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:28,020 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-16 11:57:28,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:28,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1528895984, now seen corresponding path program 1 times [2022-11-16 11:57:28,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:28,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562379954] [2022-11-16 11:57:28,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:28,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:57:28,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:28,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562379954] [2022-11-16 11:57:28,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562379954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:28,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:28,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:57:28,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464462390] [2022-11-16 11:57:28,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:28,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:57:28,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:28,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:57:28,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:57:28,641 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 236 [2022-11-16 11:57:28,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 231 transitions, 470 flow. Second operand has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:28,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:28,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 236 [2022-11-16 11:57:28,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:28,871 INFO L130 PetriNetUnfolder]: 6/473 cut-off events. [2022-11-16 11:57:28,871 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-16 11:57:28,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 473 events. 6/473 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2316 event pairs, 0 based on Foata normal form. 74/493 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2022-11-16 11:57:28,880 INFO L137 encePairwiseOnDemand]: 203/236 looper letters, 11 selfloop transitions, 8 changer transitions 0/206 dead transitions. [2022-11-16 11:57:28,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 206 transitions, 464 flow [2022-11-16 11:57:28,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:57:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:57:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1596 transitions. [2022-11-16 11:57:28,909 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8453389830508474 [2022-11-16 11:57:28,910 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1596 transitions. [2022-11-16 11:57:28,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1596 transitions. [2022-11-16 11:57:28,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:28,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1596 transitions. [2022-11-16 11:57:28,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 199.5) internal successors, (1596), 8 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:28,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:28,944 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:28,946 INFO L175 Difference]: Start difference. First operand has 207 places, 231 transitions, 470 flow. Second operand 8 states and 1596 transitions. [2022-11-16 11:57:28,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 206 transitions, 464 flow [2022-11-16 11:57:28,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 206 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:57:28,958 INFO L231 Difference]: Finished difference. Result has 211 places, 204 transitions, 432 flow [2022-11-16 11:57:28,960 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=432, PETRI_PLACES=211, PETRI_TRANSITIONS=204} [2022-11-16 11:57:28,967 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 4 predicate places. [2022-11-16 11:57:28,967 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 204 transitions, 432 flow [2022-11-16 11:57:28,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:28,969 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:28,969 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:28,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:57:28,970 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-16 11:57:28,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:28,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1528885954, now seen corresponding path program 1 times [2022-11-16 11:57:28,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:28,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843464856] [2022-11-16 11:57:28,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:28,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:29,116 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-16 11:57:29,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:29,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843464856] [2022-11-16 11:57:29,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843464856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:29,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:29,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:57:29,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358812057] [2022-11-16 11:57:29,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:29,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:57:29,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:29,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:57:29,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:57:29,128 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 236 [2022-11-16 11:57:29,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 204 transitions, 432 flow. Second operand has 4 states, 4 states have (on average 194.5) internal successors, (778), 4 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:29,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 236 [2022-11-16 11:57:29,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:29,259 INFO L130 PetriNetUnfolder]: 6/472 cut-off events. [2022-11-16 11:57:29,259 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-16 11:57:29,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 472 events. 6/472 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2312 event pairs, 0 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 223. Up to 12 conditions per place. [2022-11-16 11:57:29,263 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 11 selfloop transitions, 4 changer transitions 0/203 dead transitions. [2022-11-16 11:57:29,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 203 transitions, 460 flow [2022-11-16 11:57:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:57:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:57:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 981 transitions. [2022-11-16 11:57:29,266 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8313559322033899 [2022-11-16 11:57:29,267 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 981 transitions. [2022-11-16 11:57:29,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 981 transitions. [2022-11-16 11:57:29,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:29,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 981 transitions. [2022-11-16 11:57:29,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 196.2) internal successors, (981), 5 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,274 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,275 INFO L175 Difference]: Start difference. First operand has 211 places, 204 transitions, 432 flow. Second operand 5 states and 981 transitions. [2022-11-16 11:57:29,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 203 transitions, 460 flow [2022-11-16 11:57:29,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 203 transitions, 444 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-16 11:57:29,285 INFO L231 Difference]: Finished difference. Result has 207 places, 203 transitions, 422 flow [2022-11-16 11:57:29,286 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=207, PETRI_TRANSITIONS=203} [2022-11-16 11:57:29,287 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2022-11-16 11:57:29,287 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 422 flow [2022-11-16 11:57:29,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.5) internal successors, (778), 4 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,288 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:29,288 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:29,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:57:29,289 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-16 11:57:29,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:29,291 INFO L85 PathProgramCache]: Analyzing trace with hash 151135674, now seen corresponding path program 1 times [2022-11-16 11:57:29,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:29,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822196314] [2022-11-16 11:57:29,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:29,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:29,429 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-16 11:57:29,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:29,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822196314] [2022-11-16 11:57:29,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822196314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:29,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:29,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:57:29,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786390432] [2022-11-16 11:57:29,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:29,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:57:29,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:29,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:57:29,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:57:29,434 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 236 [2022-11-16 11:57:29,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 203 transitions, 422 flow. Second operand has 5 states, 5 states have (on average 192.8) internal successors, (964), 5 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:29,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 236 [2022-11-16 11:57:29,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:29,546 INFO L130 PetriNetUnfolder]: 6/471 cut-off events. [2022-11-16 11:57:29,546 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-16 11:57:29,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 471 events. 6/471 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2308 event pairs, 0 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 276. Up to 8 conditions per place. [2022-11-16 11:57:29,550 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 12 selfloop transitions, 6 changer transitions 0/204 dead transitions. [2022-11-16 11:57:29,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 204 transitions, 466 flow [2022-11-16 11:57:29,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:57:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:57:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1165 transitions. [2022-11-16 11:57:29,554 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8227401129943502 [2022-11-16 11:57:29,554 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1165 transitions. [2022-11-16 11:57:29,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1165 transitions. [2022-11-16 11:57:29,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:29,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1165 transitions. [2022-11-16 11:57:29,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 194.16666666666666) internal successors, (1165), 6 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,563 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,563 INFO L175 Difference]: Start difference. First operand has 207 places, 203 transitions, 422 flow. Second operand 6 states and 1165 transitions. [2022-11-16 11:57:29,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 204 transitions, 466 flow [2022-11-16 11:57:29,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 204 transitions, 458 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:57:29,568 INFO L231 Difference]: Finished difference. Result has 207 places, 202 transitions, 424 flow [2022-11-16 11:57:29,568 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=424, PETRI_PLACES=207, PETRI_TRANSITIONS=202} [2022-11-16 11:57:29,569 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2022-11-16 11:57:29,569 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 202 transitions, 424 flow [2022-11-16 11:57:29,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.8) internal successors, (964), 5 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,570 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:29,570 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:29,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:57:29,571 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-16 11:57:29,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:29,571 INFO L85 PathProgramCache]: Analyzing trace with hash 150824823, now seen corresponding path program 1 times [2022-11-16 11:57:29,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:29,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331275848] [2022-11-16 11:57:29,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:29,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:29,624 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-16 11:57:29,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:29,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331275848] [2022-11-16 11:57:29,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331275848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:29,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:29,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:57:29,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915238600] [2022-11-16 11:57:29,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:29,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:57:29,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:29,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:57:29,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:57:29,629 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 236 [2022-11-16 11:57:29,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 202 transitions, 424 flow. Second operand has 4 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:29,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 236 [2022-11-16 11:57:29,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:29,729 INFO L130 PetriNetUnfolder]: 6/470 cut-off events. [2022-11-16 11:57:29,730 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-16 11:57:29,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 470 events. 6/470 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2313 event pairs, 0 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 218. Up to 9 conditions per place. [2022-11-16 11:57:29,734 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 13 selfloop transitions, 3 changer transitions 0/203 dead transitions. [2022-11-16 11:57:29,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 203 transitions, 464 flow [2022-11-16 11:57:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:57:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 11:57:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 789 transitions. [2022-11-16 11:57:29,737 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8358050847457628 [2022-11-16 11:57:29,737 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 789 transitions. [2022-11-16 11:57:29,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 789 transitions. [2022-11-16 11:57:29,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:29,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 789 transitions. [2022-11-16 11:57:29,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.25) internal successors, (789), 4 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,743 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,743 INFO L175 Difference]: Start difference. First operand has 207 places, 202 transitions, 424 flow. Second operand 4 states and 789 transitions. [2022-11-16 11:57:29,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 203 transitions, 464 flow [2022-11-16 11:57:29,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 203 transitions, 452 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 11:57:29,748 INFO L231 Difference]: Finished difference. Result has 204 places, 201 transitions, 416 flow [2022-11-16 11:57:29,748 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=416, PETRI_PLACES=204, PETRI_TRANSITIONS=201} [2022-11-16 11:57:29,749 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, -3 predicate places. [2022-11-16 11:57:29,749 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 201 transitions, 416 flow [2022-11-16 11:57:29,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,750 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:29,751 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:29,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:57:29,751 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-16 11:57:29,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:29,752 INFO L85 PathProgramCache]: Analyzing trace with hash 165110258, now seen corresponding path program 1 times [2022-11-16 11:57:29,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:29,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608348855] [2022-11-16 11:57:29,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:29,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:29,851 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-16 11:57:29,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:29,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608348855] [2022-11-16 11:57:29,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608348855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:29,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:29,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:57:29,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707794470] [2022-11-16 11:57:29,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:29,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:57:29,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:29,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:57:29,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:57:29,856 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 236 [2022-11-16 11:57:29,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 201 transitions, 416 flow. Second operand has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:29,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 236 [2022-11-16 11:57:29,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:29,955 INFO L130 PetriNetUnfolder]: 4/344 cut-off events. [2022-11-16 11:57:29,955 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 11:57:29,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 344 events. 4/344 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1271 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 214. Up to 12 conditions per place. [2022-11-16 11:57:29,959 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 10 selfloop transitions, 4 changer transitions 0/201 dead transitions. [2022-11-16 11:57:29,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 201 transitions, 444 flow [2022-11-16 11:57:29,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:57:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:57:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 997 transitions. [2022-11-16 11:57:29,962 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8449152542372881 [2022-11-16 11:57:29,963 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 997 transitions. [2022-11-16 11:57:29,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 997 transitions. [2022-11-16 11:57:29,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:29,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 997 transitions. [2022-11-16 11:57:29,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 199.4) internal successors, (997), 5 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,970 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,971 INFO L175 Difference]: Start difference. First operand has 204 places, 201 transitions, 416 flow. Second operand 5 states and 997 transitions. [2022-11-16 11:57:29,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 201 transitions, 444 flow [2022-11-16 11:57:29,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 201 transitions, 438 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:57:29,976 INFO L231 Difference]: Finished difference. Result has 204 places, 199 transitions, 418 flow [2022-11-16 11:57:29,976 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=418, PETRI_PLACES=204, PETRI_TRANSITIONS=199} [2022-11-16 11:57:29,977 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, -3 predicate places. [2022-11-16 11:57:29,977 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 199 transitions, 418 flow [2022-11-16 11:57:29,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:29,978 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:29,978 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:29,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:57:29,979 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-16 11:57:29,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:29,980 INFO L85 PathProgramCache]: Analyzing trace with hash -454347722, now seen corresponding path program 1 times [2022-11-16 11:57:29,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:29,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019283422] [2022-11-16 11:57:29,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:29,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:57:30,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:57:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:57:30,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:57:30,061 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:57:30,062 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2022-11-16 11:57:30,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2022-11-16 11:57:30,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2022-11-16 11:57:30,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2022-11-16 11:57:30,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2022-11-16 11:57:30,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2022-11-16 11:57:30,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2022-11-16 11:57:30,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2022-11-16 11:57:30,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2022-11-16 11:57:30,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2022-11-16 11:57:30,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2022-11-16 11:57:30,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2022-11-16 11:57:30,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2022-11-16 11:57:30,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2022-11-16 11:57:30,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2022-11-16 11:57:30,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2022-11-16 11:57:30,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2022-11-16 11:57:30,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2022-11-16 11:57:30,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2022-11-16 11:57:30,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2022-11-16 11:57:30,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2022-11-16 11:57:30,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:57:30,073 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-16 11:57:30,076 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:57:30,076 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-16 11:57:30,131 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 11:57:30,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 303 transitions, 624 flow [2022-11-16 11:57:30,229 INFO L130 PetriNetUnfolder]: 72/498 cut-off events. [2022-11-16 11:57:30,229 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 11:57:30,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 498 events. 72/498 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1960 event pairs, 0 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 317. Up to 12 conditions per place. [2022-11-16 11:57:30,235 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 303 transitions, 624 flow [2022-11-16 11:57:30,249 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 265 places, 301 transitions, 620 flow [2022-11-16 11:57:30,251 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:57:30,253 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;@6fb6619c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:57:30,253 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-16 11:57:30,260 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-11-16 11:57:30,260 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:57:30,260 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:30,260 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:30,260 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:57:30,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:30,261 INFO L85 PathProgramCache]: Analyzing trace with hash 119872176, now seen corresponding path program 1 times [2022-11-16 11:57:30,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:30,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611542324] [2022-11-16 11:57:30,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:30,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:30,367 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-16 11:57:30,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:30,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611542324] [2022-11-16 11:57:30,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611542324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:30,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:30,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:57:30,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535278217] [2022-11-16 11:57:30,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:30,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:57:30,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:30,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:57:30,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:57:30,372 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 303 [2022-11-16 11:57:30,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 301 transitions, 620 flow. Second operand has 6 states, 6 states have (on average 245.33333333333334) internal successors, (1472), 6 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:30,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:30,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 303 [2022-11-16 11:57:30,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:30,589 INFO L130 PetriNetUnfolder]: 16/791 cut-off events. [2022-11-16 11:57:30,589 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-11-16 11:57:30,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 791 events. 16/791 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4618 event pairs, 0 based on Foata normal form. 176/869 useless extension candidates. Maximal degree in co-relation 502. Up to 12 conditions per place. [2022-11-16 11:57:30,601 INFO L137 encePairwiseOnDemand]: 259/303 looper letters, 15 selfloop transitions, 8 changer transitions 0/266 dead transitions. [2022-11-16 11:57:30,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 266 transitions, 610 flow [2022-11-16 11:57:30,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:57:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:57:30,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2046 transitions. [2022-11-16 11:57:30,606 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.844059405940594 [2022-11-16 11:57:30,606 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2046 transitions. [2022-11-16 11:57:30,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2046 transitions. [2022-11-16 11:57:30,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:30,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2046 transitions. [2022-11-16 11:57:30,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 255.75) internal successors, (2046), 8 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:30,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:30,618 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:30,618 INFO L175 Difference]: Start difference. First operand has 265 places, 301 transitions, 620 flow. Second operand 8 states and 2046 transitions. [2022-11-16 11:57:30,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 266 transitions, 610 flow [2022-11-16 11:57:30,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 266 transitions, 610 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:57:30,624 INFO L231 Difference]: Finished difference. Result has 268 places, 262 transitions, 558 flow [2022-11-16 11:57:30,624 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=558, PETRI_PLACES=268, PETRI_TRANSITIONS=262} [2022-11-16 11:57:30,625 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 3 predicate places. [2022-11-16 11:57:30,625 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 262 transitions, 558 flow [2022-11-16 11:57:30,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.33333333333334) internal successors, (1472), 6 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:30,626 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:30,626 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:30,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:57:30,627 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:57:30,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash 119862146, now seen corresponding path program 1 times [2022-11-16 11:57:30,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:30,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942634104] [2022-11-16 11:57:30,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:30,674 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-16 11:57:30,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:30,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942634104] [2022-11-16 11:57:30,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942634104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:30,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:30,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:57:30,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764691356] [2022-11-16 11:57:30,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:30,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:57:30,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:30,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:57:30,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:57:30,678 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 303 [2022-11-16 11:57:30,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 262 transitions, 558 flow. Second operand has 4 states, 4 states have (on average 247.5) internal successors, (990), 4 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:30,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:30,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 303 [2022-11-16 11:57:30,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:30,895 INFO L130 PetriNetUnfolder]: 16/790 cut-off events. [2022-11-16 11:57:30,895 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-11-16 11:57:30,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 790 events. 16/790 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4612 event pairs, 0 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 507. Up to 20 conditions per place. [2022-11-16 11:57:30,904 INFO L137 encePairwiseOnDemand]: 298/303 looper letters, 13 selfloop transitions, 4 changer transitions 0/261 dead transitions. [2022-11-16 11:57:30,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 261 transitions, 590 flow [2022-11-16 11:57:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:57:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:57:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1248 transitions. [2022-11-16 11:57:30,907 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8237623762376237 [2022-11-16 11:57:30,908 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1248 transitions. [2022-11-16 11:57:30,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1248 transitions. [2022-11-16 11:57:30,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:30,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1248 transitions. [2022-11-16 11:57:30,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 249.6) internal successors, (1248), 5 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:30,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:30,916 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:30,916 INFO L175 Difference]: Start difference. First operand has 268 places, 262 transitions, 558 flow. Second operand 5 states and 1248 transitions. [2022-11-16 11:57:30,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 261 transitions, 590 flow [2022-11-16 11:57:30,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 261 transitions, 574 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-16 11:57:30,921 INFO L231 Difference]: Finished difference. Result has 264 places, 261 transitions, 548 flow [2022-11-16 11:57:30,921 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=548, PETRI_PLACES=264, PETRI_TRANSITIONS=261} [2022-11-16 11:57:30,922 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -1 predicate places. [2022-11-16 11:57:30,922 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 261 transitions, 548 flow [2022-11-16 11:57:30,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 247.5) internal successors, (990), 4 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:30,923 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:30,923 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:30,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:57:30,924 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:57:30,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:30,924 INFO L85 PathProgramCache]: Analyzing trace with hash -578929111, now seen corresponding path program 1 times [2022-11-16 11:57:30,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:30,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641395208] [2022-11-16 11:57:30,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:30,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:30,985 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-16 11:57:30,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:30,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641395208] [2022-11-16 11:57:30,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641395208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:30,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:30,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:57:30,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093067316] [2022-11-16 11:57:30,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:30,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:57:30,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:30,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:57:30,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:57:30,989 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 303 [2022-11-16 11:57:30,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 261 transitions, 548 flow. Second operand has 5 states, 5 states have (on average 245.8) internal successors, (1229), 5 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:30,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:30,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 303 [2022-11-16 11:57:30,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:31,179 INFO L130 PetriNetUnfolder]: 16/789 cut-off events. [2022-11-16 11:57:31,180 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-11-16 11:57:31,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 789 events. 16/789 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4617 event pairs, 0 based on Foata normal form. 0/694 useless extension candidates. Maximal degree in co-relation 503. Up to 12 conditions per place. [2022-11-16 11:57:31,191 INFO L137 encePairwiseOnDemand]: 296/303 looper letters, 16 selfloop transitions, 6 changer transitions 0/264 dead transitions. [2022-11-16 11:57:31,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 264 transitions, 612 flow [2022-11-16 11:57:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:57:31,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:57:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1487 transitions. [2022-11-16 11:57:31,196 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.817931793179318 [2022-11-16 11:57:31,196 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1487 transitions. [2022-11-16 11:57:31,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1487 transitions. [2022-11-16 11:57:31,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:31,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1487 transitions. [2022-11-16 11:57:31,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:31,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:31,205 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:31,206 INFO L175 Difference]: Start difference. First operand has 264 places, 261 transitions, 548 flow. Second operand 6 states and 1487 transitions. [2022-11-16 11:57:31,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 264 transitions, 612 flow [2022-11-16 11:57:31,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 264 transitions, 604 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:57:31,211 INFO L231 Difference]: Finished difference. Result has 264 places, 260 transitions, 550 flow [2022-11-16 11:57:31,212 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=550, PETRI_PLACES=264, PETRI_TRANSITIONS=260} [2022-11-16 11:57:31,213 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -1 predicate places. [2022-11-16 11:57:31,213 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 260 transitions, 550 flow [2022-11-16 11:57:31,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 245.8) internal successors, (1229), 5 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:31,214 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:31,214 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:31,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:57:31,214 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:57:31,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:31,215 INFO L85 PathProgramCache]: Analyzing trace with hash -579239962, now seen corresponding path program 1 times [2022-11-16 11:57:31,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:31,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391485248] [2022-11-16 11:57:31,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:31,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:31,260 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-16 11:57:31,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:31,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391485248] [2022-11-16 11:57:31,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391485248] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:31,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:31,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:57:31,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987600899] [2022-11-16 11:57:31,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:31,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:57:31,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:31,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:57:31,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:57:31,264 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 303 [2022-11-16 11:57:31,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 260 transitions, 550 flow. Second operand has 4 states, 4 states have (on average 247.75) internal successors, (991), 4 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:31,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:31,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 303 [2022-11-16 11:57:31,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:31,443 INFO L130 PetriNetUnfolder]: 16/788 cut-off events. [2022-11-16 11:57:31,443 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-11-16 11:57:31,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 788 events. 16/788 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4619 event pairs, 0 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 502. Up to 13 conditions per place. [2022-11-16 11:57:31,455 INFO L137 encePairwiseOnDemand]: 299/303 looper letters, 17 selfloop transitions, 3 changer transitions 0/263 dead transitions. [2022-11-16 11:57:31,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 263 transitions, 610 flow [2022-11-16 11:57:31,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:57:31,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 11:57:31,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1005 transitions. [2022-11-16 11:57:31,458 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8292079207920792 [2022-11-16 11:57:31,458 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1005 transitions. [2022-11-16 11:57:31,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1005 transitions. [2022-11-16 11:57:31,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:31,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1005 transitions. [2022-11-16 11:57:31,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 251.25) internal successors, (1005), 4 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:31,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:31,465 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:31,465 INFO L175 Difference]: Start difference. First operand has 264 places, 260 transitions, 550 flow. Second operand 4 states and 1005 transitions. [2022-11-16 11:57:31,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 263 transitions, 610 flow [2022-11-16 11:57:31,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 263 transitions, 598 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 11:57:31,471 INFO L231 Difference]: Finished difference. Result has 261 places, 259 transitions, 542 flow [2022-11-16 11:57:31,471 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=542, PETRI_PLACES=261, PETRI_TRANSITIONS=259} [2022-11-16 11:57:31,472 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -4 predicate places. [2022-11-16 11:57:31,472 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 259 transitions, 542 flow [2022-11-16 11:57:31,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 247.75) internal successors, (991), 4 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:31,473 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:31,473 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:31,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:57:31,473 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:57:31,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:31,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1173350771, now seen corresponding path program 1 times [2022-11-16 11:57:31,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:31,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735782590] [2022-11-16 11:57:31,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:31,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:31,540 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-16 11:57:31,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:31,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735782590] [2022-11-16 11:57:31,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735782590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:31,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:31,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:57:31,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152695940] [2022-11-16 11:57:31,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:31,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:57:31,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:31,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:57:31,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:57:31,545 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-16 11:57:31,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 259 transitions, 542 flow. Second operand has 4 states, 4 states have (on average 250.75) internal successors, (1003), 4 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:31,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:31,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-16 11:57:31,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:31,738 INFO L130 PetriNetUnfolder]: 12/680 cut-off events. [2022-11-16 11:57:31,738 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-11-16 11:57:31,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 680 events. 12/680 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3613 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 403. Up to 40 conditions per place. [2022-11-16 11:57:31,748 INFO L137 encePairwiseOnDemand]: 296/303 looper letters, 19 selfloop transitions, 4 changer transitions 0/266 dead transitions. [2022-11-16 11:57:31,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 266 transitions, 602 flow [2022-11-16 11:57:31,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:57:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:57:31,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1271 transitions. [2022-11-16 11:57:31,752 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.838943894389439 [2022-11-16 11:57:31,752 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1271 transitions. [2022-11-16 11:57:31,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1271 transitions. [2022-11-16 11:57:31,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:31,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1271 transitions. [2022-11-16 11:57:31,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 254.2) internal successors, (1271), 5 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:31,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:31,777 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:31,778 INFO L175 Difference]: Start difference. First operand has 261 places, 259 transitions, 542 flow. Second operand 5 states and 1271 transitions. [2022-11-16 11:57:31,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 266 transitions, 602 flow [2022-11-16 11:57:31,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 266 transitions, 596 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:57:31,784 INFO L231 Difference]: Finished difference. Result has 265 places, 262 transitions, 568 flow [2022-11-16 11:57:31,785 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=568, PETRI_PLACES=265, PETRI_TRANSITIONS=262} [2022-11-16 11:57:31,785 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 0 predicate places. [2022-11-16 11:57:31,786 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 262 transitions, 568 flow [2022-11-16 11:57:31,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 250.75) internal successors, (1003), 4 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:31,786 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:31,786 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:57:31,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:57:31,787 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:57:31,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:31,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1578948222, now seen corresponding path program 1 times [2022-11-16 11:57:31,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:31,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001946675] [2022-11-16 11:57:31,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:31,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:32,448 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-16 11:57:32,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:32,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001946675] [2022-11-16 11:57:32,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001946675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:32,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:32,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:57:32,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233662650] [2022-11-16 11:57:32,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:32,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:57:32,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:32,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:57:32,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:57:32,454 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 303 [2022-11-16 11:57:32,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 262 transitions, 568 flow. Second operand has 11 states, 11 states have (on average 197.8181818181818) internal successors, (2176), 11 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:32,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:32,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 303 [2022-11-16 11:57:32,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:35,573 INFO L130 PetriNetUnfolder]: 4017/13781 cut-off events. [2022-11-16 11:57:35,574 INFO L131 PetriNetUnfolder]: For 153/153 co-relation queries the response was YES. [2022-11-16 11:57:35,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20193 conditions, 13781 events. 4017/13781 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 163890 event pairs, 942 based on Foata normal form. 0/12379 useless extension candidates. Maximal degree in co-relation 20059. Up to 2982 conditions per place. [2022-11-16 11:57:35,695 INFO L137 encePairwiseOnDemand]: 287/303 looper letters, 223 selfloop transitions, 33 changer transitions 0/447 dead transitions. [2022-11-16 11:57:35,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 447 transitions, 1496 flow [2022-11-16 11:57:35,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:57:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-16 11:57:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3562 transitions. [2022-11-16 11:57:35,703 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6915162104445739 [2022-11-16 11:57:35,704 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3562 transitions. [2022-11-16 11:57:35,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3562 transitions. [2022-11-16 11:57:35,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:35,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3562 transitions. [2022-11-16 11:57:35,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 209.52941176470588) internal successors, (3562), 17 states have internal predecessors, (3562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:35,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 303.0) internal successors, (5454), 18 states have internal predecessors, (5454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:35,726 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 303.0) internal successors, (5454), 18 states have internal predecessors, (5454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:35,726 INFO L175 Difference]: Start difference. First operand has 265 places, 262 transitions, 568 flow. Second operand 17 states and 3562 transitions. [2022-11-16 11:57:35,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 447 transitions, 1496 flow [2022-11-16 11:57:35,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 447 transitions, 1494 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:57:35,736 INFO L231 Difference]: Finished difference. Result has 290 places, 293 transitions, 805 flow [2022-11-16 11:57:35,737 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=805, PETRI_PLACES=290, PETRI_TRANSITIONS=293} [2022-11-16 11:57:35,737 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 25 predicate places. [2022-11-16 11:57:35,737 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 293 transitions, 805 flow [2022-11-16 11:57:35,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 197.8181818181818) internal successors, (2176), 11 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:35,738 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:35,739 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:35,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:57:35,739 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:57:35,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:35,740 INFO L85 PathProgramCache]: Analyzing trace with hash 412042784, now seen corresponding path program 1 times [2022-11-16 11:57:35,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:35,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781463665] [2022-11-16 11:57:35,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:35,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:57:35,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:35,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781463665] [2022-11-16 11:57:35,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781463665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:35,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:35,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:57:35,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060662914] [2022-11-16 11:57:35,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:35,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:57:35,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:35,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:57:35,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:57:35,807 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-16 11:57:35,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 293 transitions, 805 flow. Second operand has 4 states, 4 states have (on average 252.75) internal successors, (1011), 4 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:35,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:35,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-16 11:57:35,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:36,071 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} AuxVars[] AssignedVars[][230], [Black: 334#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 332#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|))), Black: 321#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 340#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 330#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, 320#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), t_funThread2of2ForFork0NotInUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 360#true, Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 346#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 336#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)))]) [2022-11-16 11:57:36,071 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-16 11:57:36,072 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-16 11:57:36,072 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:57:36,072 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:57:36,127 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} AuxVars[] AssignedVars[][230], [Black: 334#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 332#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|))), Black: 321#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 340#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 330#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 16#t_funENTRYtrue, t_funThread1of2ForFork0NotInUse, 320#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), t_funThread2of2ForFork0InUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), 360#true, Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 346#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 336#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)))]) [2022-11-16 11:57:36,127 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-16 11:57:36,128 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:57:36,128 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:57:36,128 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:57:36,166 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1022] t_funEXIT-->L1040-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][272], [Black: 334#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 332#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|))), Black: 321#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 340#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 330#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, t_funThread2of2ForFork0NotInUse, 320#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), 360#true, Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 346#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 336#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)))]) [2022-11-16 11:57:36,166 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-16 11:57:36,167 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:57:36,167 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-16 11:57:36,167 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-16 11:57:36,168 INFO L130 PetriNetUnfolder]: 123/1466 cut-off events. [2022-11-16 11:57:36,169 INFO L131 PetriNetUnfolder]: For 712/851 co-relation queries the response was YES. [2022-11-16 11:57:36,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2234 conditions, 1466 events. 123/1466 cut-off events. For 712/851 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 11053 event pairs, 26 based on Foata normal form. 19/1340 useless extension candidates. Maximal degree in co-relation 1992. Up to 127 conditions per place. [2022-11-16 11:57:36,188 INFO L137 encePairwiseOnDemand]: 297/303 looper letters, 11 selfloop transitions, 8 changer transitions 0/293 dead transitions. [2022-11-16 11:57:36,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 293 transitions, 841 flow [2022-11-16 11:57:36,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:57:36,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:57:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1262 transitions. [2022-11-16 11:57:36,192 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.833003300330033 [2022-11-16 11:57:36,192 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1262 transitions. [2022-11-16 11:57:36,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1262 transitions. [2022-11-16 11:57:36,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:36,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1262 transitions. [2022-11-16 11:57:36,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 252.4) internal successors, (1262), 5 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:36,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:36,199 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:36,199 INFO L175 Difference]: Start difference. First operand has 290 places, 293 transitions, 805 flow. Second operand 5 states and 1262 transitions. [2022-11-16 11:57:36,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 293 transitions, 841 flow [2022-11-16 11:57:36,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 293 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:57:36,209 INFO L231 Difference]: Finished difference. Result has 292 places, 293 transitions, 822 flow [2022-11-16 11:57:36,210 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=822, PETRI_PLACES=292, PETRI_TRANSITIONS=293} [2022-11-16 11:57:36,210 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 27 predicate places. [2022-11-16 11:57:36,211 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 293 transitions, 822 flow [2022-11-16 11:57:36,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 252.75) internal successors, (1011), 4 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:36,211 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:36,211 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:36,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:57:36,212 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:57:36,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:36,212 INFO L85 PathProgramCache]: Analyzing trace with hash -111574750, now seen corresponding path program 1 times [2022-11-16 11:57:36,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:36,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528713844] [2022-11-16 11:57:36,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:36,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:57:36,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:36,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528713844] [2022-11-16 11:57:36,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528713844] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:57:36,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097149401] [2022-11-16 11:57:36,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:36,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:36,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:36,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:57:36,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:57:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:36,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:57:36,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:57:36,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:57:36,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:57:36,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097149401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:36,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:57:36,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-16 11:57:36,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102988084] [2022-11-16 11:57:36,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:36,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:57:36,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:36,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:57:36,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:57:36,563 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-16 11:57:36,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 293 transitions, 822 flow. Second operand has 5 states, 5 states have (on average 252.2) internal successors, (1261), 5 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:36,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:36,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-16 11:57:36,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:36,813 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} AuxVars[] AssignedVars[][229], [Black: 334#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 332#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|))), Black: 321#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 340#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 330#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, t_funThread2of2ForFork0NotInUse, 320#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), 586#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 360#true, Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 346#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 336#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)))]) [2022-11-16 11:57:36,813 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-16 11:57:36,813 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-16 11:57:36,814 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:57:36,814 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:57:36,861 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} AuxVars[] AssignedVars[][229], [Black: 334#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 332#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|))), Black: 321#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 340#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 330#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 16#t_funENTRYtrue, t_funThread1of2ForFork0NotInUse, 320#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), t_funThread2of2ForFork0InUse, 586#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 360#true, Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 346#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 336#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)))]) [2022-11-16 11:57:36,862 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-16 11:57:36,862 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:57:36,862 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:57:36,862 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:57:36,903 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1022] t_funEXIT-->L1040-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][271], [Black: 334#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 332#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 344#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|))), Black: 321#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), Black: 340#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 330#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 342#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, t_funThread2of2ForFork0NotInUse, 320#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|))), 586#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 360#true, Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 346#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= |~#A~0.offset| 0) (< |~#B~0.base| (+ 5 |~#A~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 336#(and (<= (+ |~#A~0.offset| 4) |~#B~0.base|) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (not (<= (+ 5 |~#A~0.offset|) |~#B~0.base|)))]) [2022-11-16 11:57:36,903 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-16 11:57:36,903 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:57:36,903 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-16 11:57:36,903 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-16 11:57:36,905 INFO L130 PetriNetUnfolder]: 123/1465 cut-off events. [2022-11-16 11:57:36,905 INFO L131 PetriNetUnfolder]: For 719/848 co-relation queries the response was YES. [2022-11-16 11:57:36,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 1465 events. 123/1465 cut-off events. For 719/848 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 11026 event pairs, 26 based on Foata normal form. 7/1327 useless extension candidates. Maximal degree in co-relation 2001. Up to 127 conditions per place. [2022-11-16 11:57:36,926 INFO L137 encePairwiseOnDemand]: 299/303 looper letters, 13 selfloop transitions, 5 changer transitions 0/292 dead transitions. [2022-11-16 11:57:36,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 292 transitions, 854 flow [2022-11-16 11:57:36,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:57:36,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 11:57:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1011 transitions. [2022-11-16 11:57:36,929 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8341584158415841 [2022-11-16 11:57:36,929 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1011 transitions. [2022-11-16 11:57:36,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1011 transitions. [2022-11-16 11:57:36,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:36,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1011 transitions. [2022-11-16 11:57:36,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 252.75) internal successors, (1011), 4 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:36,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:36,935 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:36,935 INFO L175 Difference]: Start difference. First operand has 292 places, 293 transitions, 822 flow. Second operand 4 states and 1011 transitions. [2022-11-16 11:57:36,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 292 transitions, 854 flow [2022-11-16 11:57:36,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 292 transitions, 842 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:57:36,946 INFO L231 Difference]: Finished difference. Result has 291 places, 292 transitions, 816 flow [2022-11-16 11:57:36,947 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=816, PETRI_PLACES=291, PETRI_TRANSITIONS=292} [2022-11-16 11:57:36,948 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 26 predicate places. [2022-11-16 11:57:36,948 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 292 transitions, 816 flow [2022-11-16 11:57:36,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 252.2) internal successors, (1261), 5 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:36,948 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:36,949 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:36,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 11:57:37,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 11:57:37,154 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:57:37,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:37,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1577907406, now seen corresponding path program 1 times [2022-11-16 11:57:37,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:37,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454091099] [2022-11-16 11:57:37,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:37,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:37,249 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-16 11:57:37,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:37,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454091099] [2022-11-16 11:57:37,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454091099] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:57:37,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606127760] [2022-11-16 11:57:37,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:37,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:37,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:37,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:57:37,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:57:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:37,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:57:37,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:57:37,428 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-16 11:57:37,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:57:37,479 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-16 11:57:37,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606127760] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:57:37,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:57:37,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 11:57:37,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472142159] [2022-11-16 11:57:37,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:57:37,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:57:37,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:37,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:57:37,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:57:37,484 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-16 11:57:37,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 292 transitions, 816 flow. Second operand has 10 states, 10 states have (on average 251.9) internal successors, (2519), 10 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:37,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:37,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-16 11:57:37,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:37,631 INFO L130 PetriNetUnfolder]: 3/307 cut-off events. [2022-11-16 11:57:37,631 INFO L131 PetriNetUnfolder]: For 67/70 co-relation queries the response was YES. [2022-11-16 11:57:37,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 307 events. 3/307 cut-off events. For 67/70 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 807 event pairs, 0 based on Foata normal form. 2/290 useless extension candidates. Maximal degree in co-relation 378. Up to 8 conditions per place. [2022-11-16 11:57:37,633 INFO L137 encePairwiseOnDemand]: 298/303 looper letters, 13 selfloop transitions, 7 changer transitions 0/204 dead transitions. [2022-11-16 11:57:37,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 204 transitions, 588 flow [2022-11-16 11:57:37,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:57:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:57:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2263 transitions. [2022-11-16 11:57:37,639 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8298496516318299 [2022-11-16 11:57:37,640 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2263 transitions. [2022-11-16 11:57:37,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2263 transitions. [2022-11-16 11:57:37,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:37,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2263 transitions. [2022-11-16 11:57:37,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 251.44444444444446) internal successors, (2263), 9 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:37,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 303.0) internal successors, (3030), 10 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:37,653 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 303.0) internal successors, (3030), 10 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:37,653 INFO L175 Difference]: Start difference. First operand has 291 places, 292 transitions, 816 flow. Second operand 9 states and 2263 transitions. [2022-11-16 11:57:37,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 204 transitions, 588 flow [2022-11-16 11:57:37,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 204 transitions, 548 flow, removed 12 selfloop flow, removed 10 redundant places. [2022-11-16 11:57:37,659 INFO L231 Difference]: Finished difference. Result has 216 places, 199 transitions, 510 flow [2022-11-16 11:57:37,660 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=510, PETRI_PLACES=216, PETRI_TRANSITIONS=199} [2022-11-16 11:57:37,661 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -49 predicate places. [2022-11-16 11:57:37,661 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 199 transitions, 510 flow [2022-11-16 11:57:37,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 251.9) internal successors, (2519), 10 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:37,662 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:37,663 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:37,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:57:37,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:37,868 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:57:37,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:37,868 INFO L85 PathProgramCache]: Analyzing trace with hash 986756205, now seen corresponding path program 1 times [2022-11-16 11:57:37,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:37,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989400500] [2022-11-16 11:57:37,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:37,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:38,072 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-16 11:57:38,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:38,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989400500] [2022-11-16 11:57:38,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989400500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:38,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:38,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:57:38,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709537848] [2022-11-16 11:57:38,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:38,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:57:38,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:38,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:57:38,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:57:38,078 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 303 [2022-11-16 11:57:38,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 199 transitions, 510 flow. Second operand has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:38,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:38,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 303 [2022-11-16 11:57:38,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:38,833 INFO L130 PetriNetUnfolder]: 632/2847 cut-off events. [2022-11-16 11:57:38,833 INFO L131 PetriNetUnfolder]: For 620/641 co-relation queries the response was YES. [2022-11-16 11:57:38,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4669 conditions, 2847 events. 632/2847 cut-off events. For 620/641 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 25959 event pairs, 205 based on Foata normal form. 19/2603 useless extension candidates. Maximal degree in co-relation 2323. Up to 470 conditions per place. [2022-11-16 11:57:38,862 INFO L137 encePairwiseOnDemand]: 289/303 looper letters, 109 selfloop transitions, 32 changer transitions 0/280 dead transitions. [2022-11-16 11:57:38,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 280 transitions, 1062 flow [2022-11-16 11:57:38,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:57:38,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 11:57:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2388 transitions. [2022-11-16 11:57:38,869 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7164716471647165 [2022-11-16 11:57:38,869 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2388 transitions. [2022-11-16 11:57:38,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2388 transitions. [2022-11-16 11:57:38,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:38,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2388 transitions. [2022-11-16 11:57:38,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 217.0909090909091) internal successors, (2388), 11 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:38,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 303.0) internal successors, (3636), 12 states have internal predecessors, (3636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:38,884 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 303.0) internal successors, (3636), 12 states have internal predecessors, (3636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:38,884 INFO L175 Difference]: Start difference. First operand has 216 places, 199 transitions, 510 flow. Second operand 11 states and 2388 transitions. [2022-11-16 11:57:38,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 280 transitions, 1062 flow [2022-11-16 11:57:38,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 280 transitions, 1039 flow, removed 3 selfloop flow, removed 8 redundant places. [2022-11-16 11:57:38,894 INFO L231 Difference]: Finished difference. Result has 225 places, 225 transitions, 730 flow [2022-11-16 11:57:38,895 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=730, PETRI_PLACES=225, PETRI_TRANSITIONS=225} [2022-11-16 11:57:38,895 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -40 predicate places. [2022-11-16 11:57:38,896 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 730 flow [2022-11-16 11:57:38,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:38,896 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:38,897 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:38,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:57:38,897 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:57:38,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:38,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1978150363, now seen corresponding path program 1 times [2022-11-16 11:57:38,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:38,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355972798] [2022-11-16 11:57:38,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:38,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:57:38,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:57:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:57:38,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:57:38,947 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:57:38,948 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2022-11-16 11:57:38,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2022-11-16 11:57:38,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2022-11-16 11:57:38,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2022-11-16 11:57:38,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2022-11-16 11:57:38,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2022-11-16 11:57:38,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2022-11-16 11:57:38,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2022-11-16 11:57:38,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2022-11-16 11:57:38,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2022-11-16 11:57:38,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2022-11-16 11:57:38,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2022-11-16 11:57:38,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2022-11-16 11:57:38,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2022-11-16 11:57:38,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 25 remaining) [2022-11-16 11:57:38,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2022-11-16 11:57:38,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2022-11-16 11:57:38,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2022-11-16 11:57:38,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2022-11-16 11:57:38,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2022-11-16 11:57:38,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2022-11-16 11:57:38,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2022-11-16 11:57:38,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2022-11-16 11:57:38,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2022-11-16 11:57:38,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2022-11-16 11:57:38,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:57:38,953 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:38,954 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:57:38,954 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-16 11:57:38,997 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 11:57:39,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 370 transitions, 770 flow [2022-11-16 11:57:39,150 INFO L130 PetriNetUnfolder]: 106/722 cut-off events. [2022-11-16 11:57:39,151 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-16 11:57:39,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 722 events. 106/722 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3161 event pairs, 1 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 506. Up to 16 conditions per place. [2022-11-16 11:57:39,162 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 370 transitions, 770 flow [2022-11-16 11:57:39,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 321 places, 368 transitions, 766 flow [2022-11-16 11:57:39,173 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:57:39,174 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;@6fb6619c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:57:39,174 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-11-16 11:57:39,179 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-11-16 11:57:39,180 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:57:39,180 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:39,180 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:39,180 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:57:39,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:39,181 INFO L85 PathProgramCache]: Analyzing trace with hash -721879760, now seen corresponding path program 1 times [2022-11-16 11:57:39,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:39,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483578319] [2022-11-16 11:57:39,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:39,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:39,254 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-16 11:57:39,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:39,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483578319] [2022-11-16 11:57:39,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483578319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:39,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:39,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:57:39,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787173789] [2022-11-16 11:57:39,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:39,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:57:39,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:39,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:57:39,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:57:39,258 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 370 [2022-11-16 11:57:39,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 368 transitions, 766 flow. Second operand has 6 states, 6 states have (on average 298.3333333333333) internal successors, (1790), 6 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:39,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:39,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 370 [2022-11-16 11:57:39,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:39,571 INFO L130 PetriNetUnfolder]: 30/1181 cut-off events. [2022-11-16 11:57:39,571 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-11-16 11:57:39,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 1181 events. 30/1181 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7516 event pairs, 2 based on Foata normal form. 410/1439 useless extension candidates. Maximal degree in co-relation 834. Up to 24 conditions per place. [2022-11-16 11:57:39,593 INFO L137 encePairwiseOnDemand]: 315/370 looper letters, 19 selfloop transitions, 8 changer transitions 0/323 dead transitions. [2022-11-16 11:57:39,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 323 transitions, 754 flow [2022-11-16 11:57:39,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:57:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:57:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2496 transitions. [2022-11-16 11:57:39,597 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8432432432432433 [2022-11-16 11:57:39,598 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2496 transitions. [2022-11-16 11:57:39,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2496 transitions. [2022-11-16 11:57:39,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:39,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2496 transitions. [2022-11-16 11:57:39,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 312.0) internal successors, (2496), 8 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:39,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 370.0) internal successors, (3330), 9 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:39,608 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 370.0) internal successors, (3330), 9 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:39,608 INFO L175 Difference]: Start difference. First operand has 321 places, 368 transitions, 766 flow. Second operand 8 states and 2496 transitions. [2022-11-16 11:57:39,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 323 transitions, 754 flow [2022-11-16 11:57:39,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 323 transitions, 754 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:57:39,614 INFO L231 Difference]: Finished difference. Result has 323 places, 317 transitions, 680 flow [2022-11-16 11:57:39,615 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=680, PETRI_PLACES=323, PETRI_TRANSITIONS=317} [2022-11-16 11:57:39,616 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 2 predicate places. [2022-11-16 11:57:39,616 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 317 transitions, 680 flow [2022-11-16 11:57:39,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 298.3333333333333) internal successors, (1790), 6 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:39,617 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:39,617 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:39,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:57:39,617 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:57:39,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:39,618 INFO L85 PathProgramCache]: Analyzing trace with hash -721889790, now seen corresponding path program 1 times [2022-11-16 11:57:39,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:39,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761631603] [2022-11-16 11:57:39,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:39,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:39,654 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-16 11:57:39,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:39,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761631603] [2022-11-16 11:57:39,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761631603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:39,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:39,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:57:39,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478592017] [2022-11-16 11:57:39,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:39,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:57:39,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:39,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:57:39,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:57:39,658 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 370 [2022-11-16 11:57:39,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 317 transitions, 680 flow. Second operand has 4 states, 4 states have (on average 300.5) internal successors, (1202), 4 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:39,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:39,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 370 [2022-11-16 11:57:39,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:39,923 INFO L130 PetriNetUnfolder]: 30/1180 cut-off events. [2022-11-16 11:57:39,924 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-11-16 11:57:39,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 1180 events. 30/1180 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7551 event pairs, 2 based on Foata normal form. 0/1029 useless extension candidates. Maximal degree in co-relation 839. Up to 38 conditions per place. [2022-11-16 11:57:39,946 INFO L137 encePairwiseOnDemand]: 365/370 looper letters, 15 selfloop transitions, 4 changer transitions 0/316 dead transitions. [2022-11-16 11:57:39,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 316 transitions, 716 flow [2022-11-16 11:57:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:57:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:57:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1515 transitions. [2022-11-16 11:57:39,949 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8189189189189189 [2022-11-16 11:57:39,950 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1515 transitions. [2022-11-16 11:57:39,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1515 transitions. [2022-11-16 11:57:39,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:39,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1515 transitions. [2022-11-16 11:57:39,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:39,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:39,956 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:39,956 INFO L175 Difference]: Start difference. First operand has 323 places, 317 transitions, 680 flow. Second operand 5 states and 1515 transitions. [2022-11-16 11:57:39,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 316 transitions, 716 flow [2022-11-16 11:57:39,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 316 transitions, 700 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-16 11:57:39,962 INFO L231 Difference]: Finished difference. Result has 319 places, 316 transitions, 670 flow [2022-11-16 11:57:39,963 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=670, PETRI_PLACES=319, PETRI_TRANSITIONS=316} [2022-11-16 11:57:39,963 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -2 predicate places. [2022-11-16 11:57:39,963 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 316 transitions, 670 flow [2022-11-16 11:57:39,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 300.5) internal successors, (1202), 4 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:39,964 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:39,964 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:39,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:57:39,964 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:57:39,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:39,965 INFO L85 PathProgramCache]: Analyzing trace with hash -903434981, now seen corresponding path program 1 times [2022-11-16 11:57:39,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:39,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534811192] [2022-11-16 11:57:39,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:39,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:40,019 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-16 11:57:40,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:40,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534811192] [2022-11-16 11:57:40,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534811192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:40,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:40,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:57:40,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123917862] [2022-11-16 11:57:40,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:40,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:57:40,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:40,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:57:40,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:57:40,023 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 370 [2022-11-16 11:57:40,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 316 transitions, 670 flow. Second operand has 5 states, 5 states have (on average 298.8) internal successors, (1494), 5 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:40,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:40,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 370 [2022-11-16 11:57:40,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:40,344 INFO L130 PetriNetUnfolder]: 30/1179 cut-off events. [2022-11-16 11:57:40,344 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-11-16 11:57:40,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 1179 events. 30/1179 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7543 event pairs, 2 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 835. Up to 24 conditions per place. [2022-11-16 11:57:40,368 INFO L137 encePairwiseOnDemand]: 363/370 looper letters, 20 selfloop transitions, 6 changer transitions 0/321 dead transitions. [2022-11-16 11:57:40,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 321 transitions, 756 flow [2022-11-16 11:57:40,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:57:40,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:57:40,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1809 transitions. [2022-11-16 11:57:40,371 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8148648648648649 [2022-11-16 11:57:40,371 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1809 transitions. [2022-11-16 11:57:40,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1809 transitions. [2022-11-16 11:57:40,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:40,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1809 transitions. [2022-11-16 11:57:40,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 301.5) internal successors, (1809), 6 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:40,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 370.0) internal successors, (2590), 7 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:40,379 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 370.0) internal successors, (2590), 7 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:40,380 INFO L175 Difference]: Start difference. First operand has 319 places, 316 transitions, 670 flow. Second operand 6 states and 1809 transitions. [2022-11-16 11:57:40,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 321 transitions, 756 flow [2022-11-16 11:57:40,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 321 transitions, 748 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:57:40,386 INFO L231 Difference]: Finished difference. Result has 319 places, 315 transitions, 672 flow [2022-11-16 11:57:40,387 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=672, PETRI_PLACES=319, PETRI_TRANSITIONS=315} [2022-11-16 11:57:40,388 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -2 predicate places. [2022-11-16 11:57:40,388 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 315 transitions, 672 flow [2022-11-16 11:57:40,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 298.8) internal successors, (1494), 5 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:40,389 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:40,389 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:40,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:57:40,389 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:57:40,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:40,390 INFO L85 PathProgramCache]: Analyzing trace with hash -903745832, now seen corresponding path program 1 times [2022-11-16 11:57:40,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:40,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885027294] [2022-11-16 11:57:40,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:40,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:40,431 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-16 11:57:40,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:40,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885027294] [2022-11-16 11:57:40,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885027294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:40,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:40,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:57:40,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378700912] [2022-11-16 11:57:40,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:40,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:57:40,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:40,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:57:40,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:57:40,434 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 370 [2022-11-16 11:57:40,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 315 transitions, 672 flow. Second operand has 4 states, 4 states have (on average 300.75) internal successors, (1203), 4 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:40,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:40,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 370 [2022-11-16 11:57:40,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:40,713 INFO L130 PetriNetUnfolder]: 30/1178 cut-off events. [2022-11-16 11:57:40,713 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2022-11-16 11:57:40,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1280 conditions, 1178 events. 30/1178 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7514 event pairs, 2 based on Foata normal form. 0/1029 useless extension candidates. Maximal degree in co-relation 834. Up to 24 conditions per place. [2022-11-16 11:57:40,732 INFO L137 encePairwiseOnDemand]: 366/370 looper letters, 21 selfloop transitions, 3 changer transitions 0/320 dead transitions. [2022-11-16 11:57:40,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 320 transitions, 754 flow [2022-11-16 11:57:40,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:57:40,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 11:57:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1221 transitions. [2022-11-16 11:57:40,735 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825 [2022-11-16 11:57:40,735 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1221 transitions. [2022-11-16 11:57:40,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1221 transitions. [2022-11-16 11:57:40,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:40,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1221 transitions. [2022-11-16 11:57:40,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 305.25) internal successors, (1221), 4 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:40,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:40,742 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:40,742 INFO L175 Difference]: Start difference. First operand has 319 places, 315 transitions, 672 flow. Second operand 4 states and 1221 transitions. [2022-11-16 11:57:40,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 320 transitions, 754 flow [2022-11-16 11:57:40,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 320 transitions, 742 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 11:57:40,748 INFO L231 Difference]: Finished difference. Result has 316 places, 314 transitions, 664 flow [2022-11-16 11:57:40,749 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=664, PETRI_PLACES=316, PETRI_TRANSITIONS=314} [2022-11-16 11:57:40,749 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -5 predicate places. [2022-11-16 11:57:40,750 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 314 transitions, 664 flow [2022-11-16 11:57:40,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 300.75) internal successors, (1203), 4 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:40,750 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:40,750 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:40,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:57:40,751 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:57:40,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:40,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1242822097, now seen corresponding path program 1 times [2022-11-16 11:57:40,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:40,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361531621] [2022-11-16 11:57:40,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:40,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:40,813 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-16 11:57:40,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:40,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361531621] [2022-11-16 11:57:40,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361531621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:40,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:40,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:57:40,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482840226] [2022-11-16 11:57:40,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:40,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:57:40,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:40,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:57:40,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:57:40,819 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-16 11:57:40,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 314 transitions, 664 flow. Second operand has 4 states, 4 states have (on average 303.75) internal successors, (1215), 4 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:40,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:40,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-16 11:57:40,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:57:41,083 INFO L130 PetriNetUnfolder]: 26/1070 cut-off events. [2022-11-16 11:57:41,083 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2022-11-16 11:57:41,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 1070 events. 26/1070 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6566 event pairs, 2 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 754. Up to 78 conditions per place. [2022-11-16 11:57:41,106 INFO L137 encePairwiseOnDemand]: 363/370 looper letters, 21 selfloop transitions, 4 changer transitions 0/321 dead transitions. [2022-11-16 11:57:41,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 321 transitions, 728 flow [2022-11-16 11:57:41,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:57:41,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:57:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1538 transitions. [2022-11-16 11:57:41,109 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8313513513513513 [2022-11-16 11:57:41,109 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1538 transitions. [2022-11-16 11:57:41,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1538 transitions. [2022-11-16 11:57:41,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:57:41,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1538 transitions. [2022-11-16 11:57:41,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 307.6) internal successors, (1538), 5 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:41,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:41,118 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:41,118 INFO L175 Difference]: Start difference. First operand has 316 places, 314 transitions, 664 flow. Second operand 5 states and 1538 transitions. [2022-11-16 11:57:41,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 321 transitions, 728 flow [2022-11-16 11:57:41,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 321 transitions, 722 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:57:41,124 INFO L231 Difference]: Finished difference. Result has 320 places, 317 transitions, 690 flow [2022-11-16 11:57:41,124 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=690, PETRI_PLACES=320, PETRI_TRANSITIONS=317} [2022-11-16 11:57:41,125 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -1 predicate places. [2022-11-16 11:57:41,125 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 317 transitions, 690 flow [2022-11-16 11:57:41,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 303.75) internal successors, (1215), 4 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:41,125 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:57:41,126 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:41,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 11:57:41,126 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:57:41,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:41,126 INFO L85 PathProgramCache]: Analyzing trace with hash 96355770, now seen corresponding path program 1 times [2022-11-16 11:57:41,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:41,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580400814] [2022-11-16 11:57:41,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:41,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:41,575 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-16 11:57:41,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:41,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580400814] [2022-11-16 11:57:41,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580400814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:41,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:41,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:57:41,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544469492] [2022-11-16 11:57:41,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:41,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:57:41,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:41,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:57:41,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:57:41,580 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 370 [2022-11-16 11:57:41,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 317 transitions, 690 flow. Second operand has 11 states, 11 states have (on average 243.8181818181818) internal successors, (2682), 11 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:41,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:57:41,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 370 [2022-11-16 11:57:41,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:58:04,405 INFO L130 PetriNetUnfolder]: 54582/138425 cut-off events. [2022-11-16 11:58:04,405 INFO L131 PetriNetUnfolder]: For 2468/2468 co-relation queries the response was YES. [2022-11-16 11:58:05,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214396 conditions, 138425 events. 54582/138425 cut-off events. For 2468/2468 co-relation queries the response was YES. Maximal size of possible extension queue 5305. Compared 1968653 event pairs, 11655 based on Foata normal form. 0/126293 useless extension candidates. Maximal degree in co-relation 214261. Up to 38964 conditions per place. [2022-11-16 11:58:06,243 INFO L137 encePairwiseOnDemand]: 353/370 looper letters, 317 selfloop transitions, 39 changer transitions 0/593 dead transitions. [2022-11-16 11:58:06,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 593 transitions, 2060 flow [2022-11-16 11:58:06,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:58:06,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-16 11:58:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4444 transitions. [2022-11-16 11:58:06,253 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7065182829888712 [2022-11-16 11:58:06,253 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4444 transitions. [2022-11-16 11:58:06,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4444 transitions. [2022-11-16 11:58:06,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:58:06,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4444 transitions. [2022-11-16 11:58:06,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 261.4117647058824) internal successors, (4444), 17 states have internal predecessors, (4444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:06,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 370.0) internal successors, (6660), 18 states have internal predecessors, (6660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:06,276 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 370.0) internal successors, (6660), 18 states have internal predecessors, (6660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:06,276 INFO L175 Difference]: Start difference. First operand has 320 places, 317 transitions, 690 flow. Second operand 17 states and 4444 transitions. [2022-11-16 11:58:06,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 593 transitions, 2060 flow [2022-11-16 11:58:06,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 593 transitions, 2058 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:58:06,287 INFO L231 Difference]: Finished difference. Result has 345 places, 354 transitions, 971 flow [2022-11-16 11:58:06,288 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=971, PETRI_PLACES=345, PETRI_TRANSITIONS=354} [2022-11-16 11:58:06,288 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 24 predicate places. [2022-11-16 11:58:06,288 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 354 transitions, 971 flow [2022-11-16 11:58:06,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 243.8181818181818) internal successors, (2682), 11 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:06,289 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:58:06,290 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:58:06,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 11:58:06,290 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:58:06,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:58:06,291 INFO L85 PathProgramCache]: Analyzing trace with hash -836580835, now seen corresponding path program 1 times [2022-11-16 11:58:06,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:58:06,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040987040] [2022-11-16 11:58:06,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:06,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:58:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:58:06,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:58:06,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040987040] [2022-11-16 11:58:06,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040987040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:58:06,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:58:06,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:58:06,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274656505] [2022-11-16 11:58:06,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:58:06,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:58:06,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:58:06,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:58:06,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:58:06,353 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-16 11:58:06,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 354 transitions, 971 flow. Second operand has 4 states, 4 states have (on average 305.75) internal successors, (1223), 4 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:06,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:58:06,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-16 11:58:06,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:58:06,688 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:06,689 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-16 11:58:06,689 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:58:06,689 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-16 11:58:06,689 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:58:06,870 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 83#t_funENTRYtrue, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:06,870 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-16 11:58:06,870 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:58:06,870 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:58:06,870 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:58:07,014 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 83#t_funENTRYtrue, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:07,014 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is not cut-off event [2022-11-16 11:58:07,015 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:58:07,015 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-16 11:58:07,015 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-16 11:58:07,219 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:07,219 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-16 11:58:07,220 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:58:07,220 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:58:07,220 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:58:07,295 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][341], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 149#L1013-10true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse]) [2022-11-16 11:58:07,295 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-16 11:58:07,295 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:58:07,295 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:58:07,295 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:58:07,295 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 89#L1013-10true, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:07,295 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-16 11:58:07,295 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:58:07,295 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:58:07,295 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:58:07,298 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 89#L1013-10true, t_funThread1of3ForFork0NotInUse, Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:07,298 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-16 11:58:07,298 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:58:07,299 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:58:07,299 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:58:07,299 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:58:07,325 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][313], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 149#L1013-10true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse]) [2022-11-16 11:58:07,326 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-16 11:58:07,326 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 11:58:07,326 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 11:58:07,326 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-16 11:58:07,327 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 165#L1013-10true, Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:07,327 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-16 11:58:07,327 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-16 11:58:07,327 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 11:58:07,327 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 11:58:07,340 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:07,341 INFO L383 tUnfolder$Statistics]: this new event has 239 ancestors and is cut-off event [2022-11-16 11:58:07,341 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:58:07,341 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:58:07,341 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:58:07,341 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:58:07,342 INFO L130 PetriNetUnfolder]: 507/4910 cut-off events. [2022-11-16 11:58:07,342 INFO L131 PetriNetUnfolder]: For 3074/3823 co-relation queries the response was YES. [2022-11-16 11:58:07,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7850 conditions, 4910 events. 507/4910 cut-off events. For 3074/3823 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 49896 event pairs, 124 based on Foata normal form. 59/4433 useless extension candidates. Maximal degree in co-relation 7166. Up to 515 conditions per place. [2022-11-16 11:58:07,425 INFO L137 encePairwiseOnDemand]: 364/370 looper letters, 13 selfloop transitions, 8 changer transitions 0/354 dead transitions. [2022-11-16 11:58:07,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 354 transitions, 1011 flow [2022-11-16 11:58:07,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:58:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:58:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1529 transitions. [2022-11-16 11:58:07,428 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8264864864864865 [2022-11-16 11:58:07,429 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1529 transitions. [2022-11-16 11:58:07,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1529 transitions. [2022-11-16 11:58:07,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:58:07,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1529 transitions. [2022-11-16 11:58:07,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 305.8) internal successors, (1529), 5 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:07,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:07,435 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:07,435 INFO L175 Difference]: Start difference. First operand has 345 places, 354 transitions, 971 flow. Second operand 5 states and 1529 transitions. [2022-11-16 11:58:07,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 354 transitions, 1011 flow [2022-11-16 11:58:07,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 354 transitions, 1008 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:58:07,453 INFO L231 Difference]: Finished difference. Result has 347 places, 354 transitions, 988 flow [2022-11-16 11:58:07,453 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=988, PETRI_PLACES=347, PETRI_TRANSITIONS=354} [2022-11-16 11:58:07,454 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 26 predicate places. [2022-11-16 11:58:07,454 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 354 transitions, 988 flow [2022-11-16 11:58:07,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 305.75) internal successors, (1223), 4 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:07,455 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:58:07,455 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:58:07,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 11:58:07,455 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:58:07,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:58:07,456 INFO L85 PathProgramCache]: Analyzing trace with hash -164200905, now seen corresponding path program 1 times [2022-11-16 11:58:07,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:58:07,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662064760] [2022-11-16 11:58:07,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:07,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:58:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:07,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:58:07,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:58:07,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662064760] [2022-11-16 11:58:07,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662064760] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:58:07,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236185386] [2022-11-16 11:58:07,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:07,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:58:07,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:58:07,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:58:07,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:58:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:07,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:58:07,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:58:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:58:07,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:58:07,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236185386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:58:07,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:58:07,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-16 11:58:07,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852852931] [2022-11-16 11:58:07,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:58:07,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:58:07,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:58:07,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:58:07,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:58:07,880 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-16 11:58:07,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 354 transitions, 988 flow. Second operand has 5 states, 5 states have (on average 305.2) internal successors, (1526), 5 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:07,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:58:07,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-16 11:58:07,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:58:08,282 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:08,283 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-16 11:58:08,283 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:58:08,283 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-16 11:58:08,283 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:58:08,454 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 83#t_funENTRYtrue, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:08,454 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-16 11:58:08,454 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:58:08,454 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:58:08,454 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:58:08,633 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 83#t_funENTRYtrue, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:08,633 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is not cut-off event [2022-11-16 11:58:08,634 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:58:08,634 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-16 11:58:08,634 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-16 11:58:08,958 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:08,958 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-16 11:58:08,958 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:58:08,958 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:58:08,959 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:58:09,058 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][340], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 149#L1013-10true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse]) [2022-11-16 11:58:09,058 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-16 11:58:09,058 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:58:09,058 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:58:09,058 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:58:09,059 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 89#L1013-10true, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:09,059 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-16 11:58:09,059 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:58:09,059 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:58:09,059 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:58:09,062 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 89#L1013-10true, t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:09,062 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-16 11:58:09,062 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:58:09,062 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:58:09,062 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:58:09,062 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:58:09,106 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][313], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 149#L1013-10true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse]) [2022-11-16 11:58:09,106 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-16 11:58:09,106 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 11:58:09,106 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-16 11:58:09,106 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 11:58:09,107 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 165#L1013-10true, Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:09,107 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-16 11:58:09,107 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-16 11:58:09,107 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 11:58:09,107 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 11:58:09,131 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 416#true, 206#L1040-5true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:09,131 INFO L383 tUnfolder$Statistics]: this new event has 239 ancestors and is cut-off event [2022-11-16 11:58:09,131 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:58:09,131 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:58:09,131 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:58:09,131 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:58:09,132 INFO L130 PetriNetUnfolder]: 507/4908 cut-off events. [2022-11-16 11:58:09,132 INFO L131 PetriNetUnfolder]: For 3084/3791 co-relation queries the response was YES. [2022-11-16 11:58:09,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7861 conditions, 4908 events. 507/4908 cut-off events. For 3084/3791 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 49917 event pairs, 124 based on Foata normal form. 21/4393 useless extension candidates. Maximal degree in co-relation 7177. Up to 515 conditions per place. [2022-11-16 11:58:09,223 INFO L137 encePairwiseOnDemand]: 366/370 looper letters, 15 selfloop transitions, 5 changer transitions 0/353 dead transitions. [2022-11-16 11:58:09,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 353 transitions, 1024 flow [2022-11-16 11:58:09,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:58:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 11:58:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1225 transitions. [2022-11-16 11:58:09,227 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8277027027027027 [2022-11-16 11:58:09,228 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1225 transitions. [2022-11-16 11:58:09,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1225 transitions. [2022-11-16 11:58:09,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:58:09,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1225 transitions. [2022-11-16 11:58:09,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 306.25) internal successors, (1225), 4 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:09,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:09,237 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:09,237 INFO L175 Difference]: Start difference. First operand has 347 places, 354 transitions, 988 flow. Second operand 4 states and 1225 transitions. [2022-11-16 11:58:09,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 353 transitions, 1024 flow [2022-11-16 11:58:09,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 353 transitions, 1012 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:58:09,256 INFO L231 Difference]: Finished difference. Result has 346 places, 353 transitions, 982 flow [2022-11-16 11:58:09,256 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=972, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=982, PETRI_PLACES=346, PETRI_TRANSITIONS=353} [2022-11-16 11:58:09,257 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 25 predicate places. [2022-11-16 11:58:09,257 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 353 transitions, 982 flow [2022-11-16 11:58:09,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 305.2) internal successors, (1526), 5 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:09,258 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:58:09,259 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:58:09,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:58:09,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:58:09,464 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:58:09,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:58:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2069422248, now seen corresponding path program 1 times [2022-11-16 11:58:09,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:58:09,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195744662] [2022-11-16 11:58:09,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:09,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:58:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:09,553 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-16 11:58:09,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:58:09,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195744662] [2022-11-16 11:58:09,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195744662] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:58:09,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221867349] [2022-11-16 11:58:09,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:09,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:58:09,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:58:09,557 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:58:09,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:58:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:09,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:58:09,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:58:09,734 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-16 11:58:09,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:58:09,775 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-16 11:58:09,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221867349] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:58:09,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:58:09,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 11:58:09,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619654216] [2022-11-16 11:58:09,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:58:09,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:58:09,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:58:09,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:58:09,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:58:09,781 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-16 11:58:09,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 353 transitions, 982 flow. Second operand has 10 states, 10 states have (on average 304.9) internal successors, (3049), 10 states have internal predecessors, (3049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:09,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:58:09,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-16 11:58:09,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:58:10,440 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0InUse, 678#true, t_funThread3of3ForFork0InUse, 83#t_funENTRYtrue, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:10,440 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is not cut-off event [2022-11-16 11:58:10,440 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:58:10,440 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-16 11:58:10,440 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-16 11:58:10,649 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][327], [t_funThread2of3ForFork0NotInUse, 678#true, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:10,649 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-16 11:58:10,649 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:58:10,649 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:58:10,649 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:58:10,650 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 678#true, 83#t_funENTRYtrue, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 206#L1040-5true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:10,650 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-16 11:58:10,651 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:58:10,651 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:58:10,651 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:58:10,709 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0NotInUse, 678#true, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 206#L1040-5true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:10,709 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-16 11:58:10,709 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-16 11:58:10,709 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-16 11:58:10,709 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-16 11:58:10,711 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 678#true, 83#t_funENTRYtrue, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:10,711 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-16 11:58:10,711 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-16 11:58:10,711 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-16 11:58:10,711 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-16 11:58:10,734 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0NotInUse, 678#true, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 89#L1013-10true, t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:10,734 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-16 11:58:10,734 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:58:10,735 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:58:10,735 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:58:10,754 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 678#true, 298#L1013-6true, 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse]) [2022-11-16 11:58:10,754 INFO L383 tUnfolder$Statistics]: this new event has 194 ancestors and is not cut-off event [2022-11-16 11:58:10,754 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is not cut-off event [2022-11-16 11:58:10,754 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is not cut-off event [2022-11-16 11:58:10,754 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is not cut-off event [2022-11-16 11:58:10,757 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 678#true, 162#L1013-7true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse]) [2022-11-16 11:58:10,758 INFO L383 tUnfolder$Statistics]: this new event has 195 ancestors and is not cut-off event [2022-11-16 11:58:10,758 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-16 11:58:10,758 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-16 11:58:10,758 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-16 11:58:10,776 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][327], [t_funThread2of3ForFork0NotInUse, 678#true, t_funThread3of3ForFork0InUse, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 89#L1013-10true, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:10,776 INFO L383 tUnfolder$Statistics]: this new event has 198 ancestors and is not cut-off event [2022-11-16 11:58:10,776 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is not cut-off event [2022-11-16 11:58:10,776 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is not cut-off event [2022-11-16 11:58:10,776 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is not cut-off event [2022-11-16 11:58:10,785 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][327], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 678#true, 149#L1013-10true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 416#true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse]) [2022-11-16 11:58:10,786 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-16 11:58:10,786 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:58:10,786 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:58:10,786 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:58:10,800 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][327], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 678#true, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:10,801 INFO L383 tUnfolder$Statistics]: this new event has 227 ancestors and is cut-off event [2022-11-16 11:58:10,801 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:58:10,801 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:58:10,801 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-16 11:58:10,802 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 678#true, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 206#L1040-5true, Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:10,802 INFO L383 tUnfolder$Statistics]: this new event has 227 ancestors and is cut-off event [2022-11-16 11:58:10,802 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:58:10,803 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:58:10,803 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-16 11:58:10,810 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 678#true, 376#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 390#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 642#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 384#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 416#true, 206#L1040-5true, Black: 377#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4))), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 392#(and (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 402#(and (= |~#A~0.offset| 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 4) 1) (= |~#A~0.offset| 0) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| (+ |~#A~0.offset| 4)) (= |t_funThread1of3ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|)))]) [2022-11-16 11:58:10,810 INFO L383 tUnfolder$Statistics]: this new event has 215 ancestors and is not cut-off event [2022-11-16 11:58:10,811 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is not cut-off event [2022-11-16 11:58:10,811 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is not cut-off event [2022-11-16 11:58:10,811 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is not cut-off event [2022-11-16 11:58:10,814 INFO L130 PetriNetUnfolder]: 480/3917 cut-off events. [2022-11-16 11:58:10,814 INFO L131 PetriNetUnfolder]: For 2899/3381 co-relation queries the response was YES. [2022-11-16 11:58:10,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6709 conditions, 3917 events. 480/3917 cut-off events. For 2899/3381 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37319 event pairs, 153 based on Foata normal form. 28/3493 useless extension candidates. Maximal degree in co-relation 6526. Up to 487 conditions per place. [2022-11-16 11:58:10,874 INFO L137 encePairwiseOnDemand]: 364/370 looper letters, 22 selfloop transitions, 9 changer transitions 0/364 dead transitions. [2022-11-16 11:58:10,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 364 transitions, 1082 flow [2022-11-16 11:58:10,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:58:10,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:58:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2751 transitions. [2022-11-16 11:58:10,878 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8261261261261261 [2022-11-16 11:58:10,878 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2751 transitions. [2022-11-16 11:58:10,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2751 transitions. [2022-11-16 11:58:10,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:58:10,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2751 transitions. [2022-11-16 11:58:10,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 305.6666666666667) internal successors, (2751), 9 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:10,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 370.0) internal successors, (3700), 10 states have internal predecessors, (3700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:10,889 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 370.0) internal successors, (3700), 10 states have internal predecessors, (3700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:10,889 INFO L175 Difference]: Start difference. First operand has 346 places, 353 transitions, 982 flow. Second operand 9 states and 2751 transitions. [2022-11-16 11:58:10,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 364 transitions, 1082 flow [2022-11-16 11:58:10,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 364 transitions, 1068 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:58:10,904 INFO L231 Difference]: Finished difference. Result has 355 places, 357 transitions, 1028 flow [2022-11-16 11:58:10,904 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=972, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1028, PETRI_PLACES=355, PETRI_TRANSITIONS=357} [2022-11-16 11:58:10,905 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 34 predicate places. [2022-11-16 11:58:10,905 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 357 transitions, 1028 flow [2022-11-16 11:58:10,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.9) internal successors, (3049), 10 states have internal predecessors, (3049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:10,906 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:58:10,906 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:58:10,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:58:11,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb3c938-4760-4330-b5da-b8412223c84e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-16 11:58:11,119 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:58:11,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:58:11,119 INFO L85 PathProgramCache]: Analyzing trace with hash 869056805, now seen corresponding path program 1 times [2022-11-16 11:58:11,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:58:11,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269462740] [2022-11-16 11:58:11,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:11,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:58:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:11,284 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-16 11:58:11,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:58:11,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269462740] [2022-11-16 11:58:11,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269462740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:58:11,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:58:11,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:58:11,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601159650] [2022-11-16 11:58:11,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:58:11,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:58:11,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:58:11,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:58:11,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:58:11,290 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 370 [2022-11-16 11:58:11,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 357 transitions, 1028 flow. Second operand has 6 states, 6 states have (on average 259.1666666666667) internal successors, (1555), 6 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:11,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:58:11,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 370 [2022-11-16 11:58:11,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand