./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/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_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/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_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/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 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- 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:05:11,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:05:11,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:05:11,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:05:11,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:05:11,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:05:11,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:05:11,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:05:11,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:05:11,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:05:11,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:05:11,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:05:11,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:05:11,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:05:11,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:05:11,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:05:11,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:05:11,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:05:11,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:05:11,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:05:11,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:05:11,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:05:11,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:05:11,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:05:11,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:05:11,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:05:11,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:05:11,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:05:11,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:05:11,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:05:11,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:05:11,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:05:11,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:05:11,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:05:11,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:05:11,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:05:11,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:05:11,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:05:11,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:05:11,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:05:11,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:05:11,598 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-16 11:05:11,648 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:05:11,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:05:11,649 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:05:11,649 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:05:11,650 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:05:11,651 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:05:11,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:05:11,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:05:11,652 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:05:11,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:05:11,654 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:05:11,654 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:05:11,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:05:11,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:05:11,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:05:11,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:05:11,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:05:11,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:05:11,656 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-16 11:05:11,657 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:05:11,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:05:11,657 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:05:11,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:05:11,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:05:11,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:05:11,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:05:11,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:05:11,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:05:11,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:05:11,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:05:11,660 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:05:11,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:05:11,661 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:05:11,661 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:05:11,661 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:05:11,661 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_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/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_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2022-11-16 11:05:11,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:05:12,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:05:12,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:05:12,024 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:05:12,025 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:05:12,027 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2022-11-16 11:05:12,108 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/data/a44e5ae16/3e029068b5404afd93c5a6e695dc30fc/FLAG0d1513872 [2022-11-16 11:05:12,873 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:05:12,874 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2022-11-16 11:05:12,912 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/data/a44e5ae16/3e029068b5404afd93c5a6e695dc30fc/FLAG0d1513872 [2022-11-16 11:05:13,111 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/data/a44e5ae16/3e029068b5404afd93c5a6e695dc30fc [2022-11-16 11:05:13,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:05:13,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:05:13,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:05:13,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:05:13,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:05:13,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:05:13" (1/1) ... [2022-11-16 11:05:13,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d1b94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:13, skipping insertion in model container [2022-11-16 11:05:13,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:05:13" (1/1) ... [2022-11-16 11:05:13,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:05:13,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:05:13,721 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_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2022-11-16 11:05:13,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:05:13,766 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:05:13,814 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_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2022-11-16 11:05:13,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:05:13,883 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:05:13,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:13 WrapperNode [2022-11-16 11:05:13,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:05:13,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:05:13,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:05:13,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:05:13,893 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:05:13" (1/1) ... [2022-11-16 11:05:13,911 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:05:13" (1/1) ... [2022-11-16 11:05:13,943 INFO L138 Inliner]: procedures = 271, calls = 31, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 211 [2022-11-16 11:05:13,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:05:13,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:05:13,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:05:13,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:05:13,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:13" (1/1) ... [2022-11-16 11:05:13,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:13" (1/1) ... [2022-11-16 11:05:13,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:13" (1/1) ... [2022-11-16 11:05:13,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:13" (1/1) ... [2022-11-16 11:05:13,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:13" (1/1) ... [2022-11-16 11:05:13,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:13" (1/1) ... [2022-11-16 11:05:13,979 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:13" (1/1) ... [2022-11-16 11:05:13,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:13" (1/1) ... [2022-11-16 11:05:13,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:05:13,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:05:13,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:05:13,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:05:13,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:13" (1/1) ... [2022-11-16 11:05:14,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:05:14,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:14,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:05:14,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:05:14,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:05:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:05:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:05:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:05:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-16 11:05:14,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:05:14,104 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-16 11:05:14,105 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-16 11:05:14,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:05:14,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:05:14,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:05:14,107 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:05:14,429 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:05:14,431 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:05:14,791 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:05:14,802 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:05:14,814 INFO L300 CfgBuilder]: Removed 25 assume(true) statements. [2022-11-16 11:05:14,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:05:14 BoogieIcfgContainer [2022-11-16 11:05:14,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:05:14,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:05:14,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:05:14,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:05:14,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:05:13" (1/3) ... [2022-11-16 11:05:14,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed82847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:05:14, skipping insertion in model container [2022-11-16 11:05:14,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:13" (2/3) ... [2022-11-16 11:05:14,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed82847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:05:14, skipping insertion in model container [2022-11-16 11:05:14,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:05:14" (3/3) ... [2022-11-16 11:05:14,837 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2022-11-16 11:05:14,852 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:05:14,866 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:05:14,867 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-16 11:05:14,867 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:05:15,014 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-16 11:05:15,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 234 transitions, 476 flow [2022-11-16 11:05:15,186 INFO L130 PetriNetUnfolder]: 49/329 cut-off events. [2022-11-16 11:05:15,187 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 11:05:15,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 329 events. 49/329 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1325 event pairs, 0 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 186. Up to 8 conditions per place. [2022-11-16 11:05:15,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 234 transitions, 476 flow [2022-11-16 11:05:15,205 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 202 places, 231 transitions, 470 flow [2022-11-16 11:05:15,217 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:05:15,225 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;@2e72c1a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:05:15,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-16 11:05:15,234 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-16 11:05:15,234 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:05:15,235 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:15,235 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:15,236 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:05:15,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:15,242 INFO L85 PathProgramCache]: Analyzing trace with hash -869633179, now seen corresponding path program 1 times [2022-11-16 11:05:15,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:15,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17576484] [2022-11-16 11:05:15,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:15,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:15,697 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:05:15,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:15,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17576484] [2022-11-16 11:05:15,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17576484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:15,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:15,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:05:15,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489921686] [2022-11-16 11:05:15,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:15,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:05:15,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:15,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:05:15,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:05:15,772 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 234 [2022-11-16 11:05:15,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 231 transitions, 470 flow. Second operand has 4 states, 4 states have (on average 192.5) internal successors, (770), 4 states have internal predecessors, (770), 0 states have call successors, (0), 0 states 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:05:15,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:15,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 234 [2022-11-16 11:05:15,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:16,024 INFO L130 PetriNetUnfolder]: 7/289 cut-off events. [2022-11-16 11:05:16,024 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 11:05:16,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 289 events. 7/289 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1011 event pairs, 0 based on Foata normal form. 40/292 useless extension candidates. Maximal degree in co-relation 160. Up to 15 conditions per place. [2022-11-16 11:05:16,035 INFO L137 encePairwiseOnDemand]: 200/234 looper letters, 17 selfloop transitions, 4 changer transitions 0/209 dead transitions. [2022-11-16 11:05:16,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 209 transitions, 468 flow [2022-11-16 11:05:16,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:05:16,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:05:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1007 transitions. [2022-11-16 11:05:16,067 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8606837606837607 [2022-11-16 11:05:16,068 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1007 transitions. [2022-11-16 11:05:16,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1007 transitions. [2022-11-16 11:05:16,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:16,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1007 transitions. [2022-11-16 11:05:16,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 201.4) internal successors, (1007), 5 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states 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:05:16,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states 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:05:16,098 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states 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:05:16,100 INFO L175 Difference]: Start difference. First operand has 202 places, 231 transitions, 470 flow. Second operand 5 states and 1007 transitions. [2022-11-16 11:05:16,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 209 transitions, 468 flow [2022-11-16 11:05:16,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 209 transitions, 468 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:05:16,111 INFO L231 Difference]: Finished difference. Result has 207 places, 205 transitions, 444 flow [2022-11-16 11:05:16,114 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=444, PETRI_PLACES=207, PETRI_TRANSITIONS=205} [2022-11-16 11:05:16,118 INFO L288 CegarLoopForPetriNet]: 202 programPoint places, 5 predicate places. [2022-11-16 11:05:16,118 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 205 transitions, 444 flow [2022-11-16 11:05:16,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 192.5) internal successors, (770), 4 states have internal predecessors, (770), 0 states have call successors, (0), 0 states 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:05:16,119 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:16,120 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:16,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:05:16,120 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:05:16,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:16,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1246269360, now seen corresponding path program 1 times [2022-11-16 11:05:16,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:16,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640236759] [2022-11-16 11:05:16,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:16,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:05:16,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:16,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640236759] [2022-11-16 11:05:16,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640236759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:16,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:16,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:05:16,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191775276] [2022-11-16 11:05:16,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:16,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:05:16,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:16,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:05:16,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:05:16,233 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 234 [2022-11-16 11:05:16,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 205 transitions, 444 flow. Second operand has 4 states, 4 states have (on average 194.25) internal successors, (777), 4 states have internal predecessors, (777), 0 states have call successors, (0), 0 states 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:05:16,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:16,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 234 [2022-11-16 11:05:16,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:16,329 INFO L130 PetriNetUnfolder]: 7/288 cut-off events. [2022-11-16 11:05:16,329 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-16 11:05:16,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 288 events. 7/288 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1006 event pairs, 0 based on Foata normal form. 1/255 useless extension candidates. Maximal degree in co-relation 278. Up to 7 conditions per place. [2022-11-16 11:05:16,333 INFO L137 encePairwiseOnDemand]: 228/234 looper letters, 9 selfloop transitions, 8 changer transitions 0/205 dead transitions. [2022-11-16 11:05:16,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 205 transitions, 476 flow [2022-11-16 11:05:16,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:05:16,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:05:16,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 970 transitions. [2022-11-16 11:05:16,337 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8290598290598291 [2022-11-16 11:05:16,337 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 970 transitions. [2022-11-16 11:05:16,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 970 transitions. [2022-11-16 11:05:16,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:16,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 970 transitions. [2022-11-16 11:05:16,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:05:16,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states 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:05:16,346 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states 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:05:16,347 INFO L175 Difference]: Start difference. First operand has 207 places, 205 transitions, 444 flow. Second operand 5 states and 970 transitions. [2022-11-16 11:05:16,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 205 transitions, 476 flow [2022-11-16 11:05:16,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 205 transitions, 474 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:05:16,354 INFO L231 Difference]: Finished difference. Result has 210 places, 205 transitions, 462 flow [2022-11-16 11:05:16,354 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=462, PETRI_PLACES=210, PETRI_TRANSITIONS=205} [2022-11-16 11:05:16,355 INFO L288 CegarLoopForPetriNet]: 202 programPoint places, 8 predicate places. [2022-11-16 11:05:16,356 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 205 transitions, 462 flow [2022-11-16 11:05:16,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.25) internal successors, (777), 4 states have internal predecessors, (777), 0 states have call successors, (0), 0 states 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:05:16,357 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:16,357 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:16,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:05:16,358 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:05:16,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:16,359 INFO L85 PathProgramCache]: Analyzing trace with hash -20354909, now seen corresponding path program 1 times [2022-11-16 11:05:16,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:16,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236339645] [2022-11-16 11:05:16,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:16,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:05:16,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:16,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236339645] [2022-11-16 11:05:16,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236339645] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:05:16,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683932463] [2022-11-16 11:05:16,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:16,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:16,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:16,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:05:16,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:05:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:16,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:05:16,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:05:16,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:05:16,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683932463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:16,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:05:16,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-16 11:05:16,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344232949] [2022-11-16 11:05:16,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:16,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:05:16,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:16,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:05:16,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:05:16,835 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 234 [2022-11-16 11:05:16,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 205 transitions, 462 flow. Second operand has 5 states, 5 states have (on average 193.8) internal successors, (969), 5 states have internal predecessors, (969), 0 states have call successors, (0), 0 states 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:05:16,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:16,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 234 [2022-11-16 11:05:16,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:16,963 INFO L130 PetriNetUnfolder]: 7/287 cut-off events. [2022-11-16 11:05:16,964 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-16 11:05:16,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 287 events. 7/287 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 998 event pairs, 0 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 276. Up to 10 conditions per place. [2022-11-16 11:05:16,968 INFO L137 encePairwiseOnDemand]: 230/234 looper letters, 11 selfloop transitions, 5 changer transitions 0/204 dead transitions. [2022-11-16 11:05:16,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 204 transitions, 490 flow [2022-11-16 11:05:16,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:05:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 11:05:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 777 transitions. [2022-11-16 11:05:16,971 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8301282051282052 [2022-11-16 11:05:16,971 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 777 transitions. [2022-11-16 11:05:16,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 777 transitions. [2022-11-16 11:05:16,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:16,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 777 transitions. [2022-11-16 11:05:16,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 194.25) internal successors, (777), 4 states have internal predecessors, (777), 0 states have call successors, (0), 0 states 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:05:16,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states 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:05:16,979 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states 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:05:16,979 INFO L175 Difference]: Start difference. First operand has 210 places, 205 transitions, 462 flow. Second operand 4 states and 777 transitions. [2022-11-16 11:05:16,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 204 transitions, 490 flow [2022-11-16 11:05:16,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 204 transitions, 478 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:05:16,987 INFO L231 Difference]: Finished difference. Result has 209 places, 204 transitions, 456 flow [2022-11-16 11:05:16,988 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=456, PETRI_PLACES=209, PETRI_TRANSITIONS=204} [2022-11-16 11:05:16,991 INFO L288 CegarLoopForPetriNet]: 202 programPoint places, 7 predicate places. [2022-11-16 11:05:16,991 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 204 transitions, 456 flow [2022-11-16 11:05:16,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 193.8) internal successors, (969), 5 states have internal predecessors, (969), 0 states have call successors, (0), 0 states 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:05:16,992 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:16,993 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:17,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:05:17,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:17,200 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:05:17,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:17,201 INFO L85 PathProgramCache]: Analyzing trace with hash 208371771, now seen corresponding path program 1 times [2022-11-16 11:05:17,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:17,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969233988] [2022-11-16 11:05:17,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:17,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:17,358 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:05:17,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:17,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969233988] [2022-11-16 11:05:17,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969233988] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:05:17,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950933815] [2022-11-16 11:05:17,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:17,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:17,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:17,361 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:05:17,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:05:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:17,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:05:17,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:17,573 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:05:17,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:05:17,656 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:05:17,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950933815] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:05:17,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:05:17,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 11:05:17,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474045646] [2022-11-16 11:05:17,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:05:17,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:05:17,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:17,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:05:17,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:05:17,663 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 234 [2022-11-16 11:05:17,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 204 transitions, 456 flow. Second operand has 10 states, 10 states have (on average 193.7) internal successors, (1937), 10 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states 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:05:17,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:17,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 234 [2022-11-16 11:05:17,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:17,878 INFO L130 PetriNetUnfolder]: 7/295 cut-off events. [2022-11-16 11:05:17,878 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-16 11:05:17,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 295 events. 7/295 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 984 event pairs, 0 based on Foata normal form. 2/263 useless extension candidates. Maximal degree in co-relation 266. Up to 7 conditions per place. [2022-11-16 11:05:17,882 INFO L137 encePairwiseOnDemand]: 228/234 looper letters, 18 selfloop transitions, 9 changer transitions 0/215 dead transitions. [2022-11-16 11:05:17,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 215 transitions, 548 flow [2022-11-16 11:05:17,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:05:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:05:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1748 transitions. [2022-11-16 11:05:17,888 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8300094966761633 [2022-11-16 11:05:17,889 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1748 transitions. [2022-11-16 11:05:17,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1748 transitions. [2022-11-16 11:05:17,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:17,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1748 transitions. [2022-11-16 11:05:17,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 194.22222222222223) internal successors, (1748), 9 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states 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:05:17,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 234.0) internal successors, (2340), 10 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states 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:05:17,905 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 234.0) internal successors, (2340), 10 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states 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:05:17,906 INFO L175 Difference]: Start difference. First operand has 209 places, 204 transitions, 456 flow. Second operand 9 states and 1748 transitions. [2022-11-16 11:05:17,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 215 transitions, 548 flow [2022-11-16 11:05:17,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 215 transitions, 534 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:05:17,913 INFO L231 Difference]: Finished difference. Result has 218 places, 208 transitions, 502 flow [2022-11-16 11:05:17,914 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=502, PETRI_PLACES=218, PETRI_TRANSITIONS=208} [2022-11-16 11:05:17,916 INFO L288 CegarLoopForPetriNet]: 202 programPoint places, 16 predicate places. [2022-11-16 11:05:17,917 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 208 transitions, 502 flow [2022-11-16 11:05:17,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 193.7) internal successors, (1937), 10 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states 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:05:17,919 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:17,920 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:17,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:05:18,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:18,126 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:05:18,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:18,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1154278875, now seen corresponding path program 2 times [2022-11-16 11:05:18,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:18,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924051973] [2022-11-16 11:05:18,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:18,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 11:05:18,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:18,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924051973] [2022-11-16 11:05:18,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924051973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:18,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:18,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:05:18,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606137306] [2022-11-16 11:05:18,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:18,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:05:18,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:18,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:05:18,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:05:18,313 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 234 [2022-11-16 11:05:18,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 208 transitions, 502 flow. Second operand has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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:05:18,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:18,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 234 [2022-11-16 11:05:18,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:18,423 INFO L130 PetriNetUnfolder]: 5/217 cut-off events. [2022-11-16 11:05:18,424 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-11-16 11:05:18,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 217 events. 5/217 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 508 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 200. Up to 7 conditions per place. [2022-11-16 11:05:18,427 INFO L137 encePairwiseOnDemand]: 227/234 looper letters, 10 selfloop transitions, 4 changer transitions 0/208 dead transitions. [2022-11-16 11:05:18,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 208 transitions, 530 flow [2022-11-16 11:05:18,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:05:18,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:05:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 972 transitions. [2022-11-16 11:05:18,431 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8307692307692308 [2022-11-16 11:05:18,431 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 972 transitions. [2022-11-16 11:05:18,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 972 transitions. [2022-11-16 11:05:18,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:18,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 972 transitions. [2022-11-16 11:05:18,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 194.4) internal successors, (972), 5 states have internal predecessors, (972), 0 states have call successors, (0), 0 states 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:05:18,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states 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:05:18,440 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states 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:05:18,440 INFO L175 Difference]: Start difference. First operand has 218 places, 208 transitions, 502 flow. Second operand 5 states and 972 transitions. [2022-11-16 11:05:18,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 208 transitions, 530 flow [2022-11-16 11:05:18,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 208 transitions, 514 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-16 11:05:18,449 INFO L231 Difference]: Finished difference. Result has 217 places, 206 transitions, 494 flow [2022-11-16 11:05:18,450 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=494, PETRI_PLACES=217, PETRI_TRANSITIONS=206} [2022-11-16 11:05:18,453 INFO L288 CegarLoopForPetriNet]: 202 programPoint places, 15 predicate places. [2022-11-16 11:05:18,454 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 206 transitions, 494 flow [2022-11-16 11:05:18,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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:05:18,454 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:18,455 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:18,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:05:18,456 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:05:18,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:18,457 INFO L85 PathProgramCache]: Analyzing trace with hash 449368174, now seen corresponding path program 1 times [2022-11-16 11:05:18,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:18,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592018155] [2022-11-16 11:05:18,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:18,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:05:18,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:18,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592018155] [2022-11-16 11:05:18,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592018155] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:05:18,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321295778] [2022-11-16 11:05:18,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:18,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:18,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:18,743 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:05:18,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:05:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:18,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 11:05:18,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:05:19,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:05:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:05:19,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321295778] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:05:19,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:05:19,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-16 11:05:19,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687481240] [2022-11-16 11:05:19,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:05:19,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:05:19,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:19,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:05:19,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:05:19,189 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 234 [2022-11-16 11:05:19,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 206 transitions, 494 flow. Second operand has 18 states, 18 states have (on average 194.05555555555554) internal successors, (3493), 18 states have internal predecessors, (3493), 0 states have call successors, (0), 0 states 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:05:19,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:19,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 234 [2022-11-16 11:05:19,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:19,574 INFO L130 PetriNetUnfolder]: 5/245 cut-off events. [2022-11-16 11:05:19,575 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-11-16 11:05:19,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 245 events. 5/245 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 508 event pairs, 0 based on Foata normal form. 4/229 useless extension candidates. Maximal degree in co-relation 208. Up to 9 conditions per place. [2022-11-16 11:05:19,578 INFO L137 encePairwiseOnDemand]: 228/234 looper letters, 34 selfloop transitions, 21 changer transitions 0/241 dead transitions. [2022-11-16 11:05:19,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 241 transitions, 758 flow [2022-11-16 11:05:19,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:05:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-16 11:05:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4070 transitions. [2022-11-16 11:05:19,595 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8282458282458283 [2022-11-16 11:05:19,596 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4070 transitions. [2022-11-16 11:05:19,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4070 transitions. [2022-11-16 11:05:19,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:19,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4070 transitions. [2022-11-16 11:05:19,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 193.8095238095238) internal successors, (4070), 21 states have internal predecessors, (4070), 0 states have call successors, (0), 0 states 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:05:19,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 234.0) internal successors, (5148), 22 states have internal predecessors, (5148), 0 states have call successors, (0), 0 states 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:05:19,623 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 234.0) internal successors, (5148), 22 states have internal predecessors, (5148), 0 states have call successors, (0), 0 states 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:05:19,623 INFO L175 Difference]: Start difference. First operand has 217 places, 206 transitions, 494 flow. Second operand 21 states and 4070 transitions. [2022-11-16 11:05:19,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 241 transitions, 758 flow [2022-11-16 11:05:19,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 241 transitions, 750 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:05:19,634 INFO L231 Difference]: Finished difference. Result has 238 places, 219 transitions, 642 flow [2022-11-16 11:05:19,635 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=642, PETRI_PLACES=238, PETRI_TRANSITIONS=219} [2022-11-16 11:05:19,637 INFO L288 CegarLoopForPetriNet]: 202 programPoint places, 36 predicate places. [2022-11-16 11:05:19,638 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 219 transitions, 642 flow [2022-11-16 11:05:19,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 194.05555555555554) internal successors, (3493), 18 states have internal predecessors, (3493), 0 states have call successors, (0), 0 states 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:05:19,640 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:19,640 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:19,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:05:19,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:19,853 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:05:19,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:19,853 INFO L85 PathProgramCache]: Analyzing trace with hash 806835118, now seen corresponding path program 2 times [2022-11-16 11:05:19,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:19,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801111106] [2022-11-16 11:05:19,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:19,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:05:20,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:20,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801111106] [2022-11-16 11:05:20,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801111106] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:05:20,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130497728] [2022-11-16 11:05:20,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:05:20,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:20,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:20,334 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:05:20,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:05:20,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:05:20,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:05:20,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 11:05:20,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:05:20,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:05:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:05:20,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130497728] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:05:20,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:05:20,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-16 11:05:20,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373762177] [2022-11-16 11:05:20,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:05:20,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 11:05:20,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:20,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 11:05:20,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-16 11:05:20,975 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 234 [2022-11-16 11:05:20,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 219 transitions, 642 flow. Second operand has 23 states, 23 states have (on average 194.30434782608697) internal successors, (4469), 23 states have internal predecessors, (4469), 0 states have call successors, (0), 0 states 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:05:20,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:20,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 234 [2022-11-16 11:05:20,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:21,489 INFO L130 PetriNetUnfolder]: 5/266 cut-off events. [2022-11-16 11:05:21,490 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2022-11-16 11:05:21,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 266 events. 5/266 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 507 event pairs, 0 based on Foata normal form. 3/249 useless extension candidates. Maximal degree in co-relation 334. Up to 12 conditions per place. [2022-11-16 11:05:21,493 INFO L137 encePairwiseOnDemand]: 228/234 looper letters, 46 selfloop transitions, 30 changer transitions 0/262 dead transitions. [2022-11-16 11:05:21,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 262 transitions, 1004 flow [2022-11-16 11:05:21,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 11:05:21,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-16 11:05:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5809 transitions. [2022-11-16 11:05:21,507 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8274928774928775 [2022-11-16 11:05:21,508 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5809 transitions. [2022-11-16 11:05:21,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5809 transitions. [2022-11-16 11:05:21,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:21,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5809 transitions. [2022-11-16 11:05:21,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 193.63333333333333) internal successors, (5809), 30 states have internal predecessors, (5809), 0 states have call successors, (0), 0 states 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:05:21,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 234.0) internal successors, (7254), 31 states have internal predecessors, (7254), 0 states have call successors, (0), 0 states 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:05:21,544 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 234.0) internal successors, (7254), 31 states have internal predecessors, (7254), 0 states have call successors, (0), 0 states 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:05:21,545 INFO L175 Difference]: Start difference. First operand has 238 places, 219 transitions, 642 flow. Second operand 30 states and 5809 transitions. [2022-11-16 11:05:21,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 262 transitions, 1004 flow [2022-11-16 11:05:21,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 262 transitions, 924 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-16 11:05:21,553 INFO L231 Difference]: Finished difference. Result has 263 places, 229 transitions, 740 flow [2022-11-16 11:05:21,554 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=740, PETRI_PLACES=263, PETRI_TRANSITIONS=229} [2022-11-16 11:05:21,555 INFO L288 CegarLoopForPetriNet]: 202 programPoint places, 61 predicate places. [2022-11-16 11:05:21,555 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 229 transitions, 740 flow [2022-11-16 11:05:21,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 194.30434782608697) internal successors, (4469), 23 states have internal predecessors, (4469), 0 states have call successors, (0), 0 states 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:05:21,558 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:21,558 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:21,572 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:05:21,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:21,765 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:05:21,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:21,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1660575641, now seen corresponding path program 3 times [2022-11-16 11:05:21,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:21,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648726420] [2022-11-16 11:05:21,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:21,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:05:21,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:05:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:05:21,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:05:21,874 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:05:21,877 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2022-11-16 11:05:21,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2022-11-16 11:05:21,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2022-11-16 11:05:21,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2022-11-16 11:05:21,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2022-11-16 11:05:21,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2022-11-16 11:05:21,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2022-11-16 11:05:21,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2022-11-16 11:05:21,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2022-11-16 11:05:21,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2022-11-16 11:05:21,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2022-11-16 11:05:21,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2022-11-16 11:05:21,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2022-11-16 11:05:21,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2022-11-16 11:05:21,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 25 remaining) [2022-11-16 11:05:21,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2022-11-16 11:05:21,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2022-11-16 11:05:21,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2022-11-16 11:05:21,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2022-11-16 11:05:21,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2022-11-16 11:05:21,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2022-11-16 11:05:21,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2022-11-16 11:05:21,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2022-11-16 11:05:21,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2022-11-16 11:05:21,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2022-11-16 11:05:21,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:05:21,893 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2022-11-16 11:05:21,896 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:05:21,897 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-16 11:05:21,961 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 11:05:21,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 318 transitions, 654 flow [2022-11-16 11:05:22,091 INFO L130 PetriNetUnfolder]: 82/545 cut-off events. [2022-11-16 11:05:22,091 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 11:05:22,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 545 events. 82/545 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2581 event pairs, 0 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 331. Up to 12 conditions per place. [2022-11-16 11:05:22,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 318 transitions, 654 flow [2022-11-16 11:05:22,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 318 transitions, 654 flow [2022-11-16 11:05:22,117 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:05:22,118 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;@2e72c1a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:05:22,119 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-11-16 11:05:22,122 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-16 11:05:22,122 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:05:22,122 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:22,123 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:22,123 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-16 11:05:22,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:22,123 INFO L85 PathProgramCache]: Analyzing trace with hash -992860189, now seen corresponding path program 1 times [2022-11-16 11:05:22,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:22,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38989932] [2022-11-16 11:05:22,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:22,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:22,187 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:05:22,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:22,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38989932] [2022-11-16 11:05:22,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38989932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:22,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:22,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:05:22,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205374469] [2022-11-16 11:05:22,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:22,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:05:22,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:22,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:05:22,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:05:22,191 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 318 [2022-11-16 11:05:22,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 318 transitions, 654 flow. Second operand has 4 states, 4 states have (on average 261.5) internal successors, (1046), 4 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states 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:05:22,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:22,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 318 [2022-11-16 11:05:22,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:22,343 INFO L130 PetriNetUnfolder]: 14/479 cut-off events. [2022-11-16 11:05:22,343 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-16 11:05:22,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 479 events. 14/479 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2302 event pairs, 0 based on Foata normal form. 84/498 useless extension candidates. Maximal degree in co-relation 315. Up to 19 conditions per place. [2022-11-16 11:05:22,353 INFO L137 encePairwiseOnDemand]: 272/318 looper letters, 19 selfloop transitions, 4 changer transitions 0/283 dead transitions. [2022-11-16 11:05:22,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 283 transitions, 630 flow [2022-11-16 11:05:22,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:05:22,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:05:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1366 transitions. [2022-11-16 11:05:22,358 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8591194968553459 [2022-11-16 11:05:22,358 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1366 transitions. [2022-11-16 11:05:22,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1366 transitions. [2022-11-16 11:05:22,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:22,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1366 transitions. [2022-11-16 11:05:22,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 273.2) internal successors, (1366), 5 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states 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:05:22,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:05:22,367 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:05:22,368 INFO L175 Difference]: Start difference. First operand has 275 places, 318 transitions, 654 flow. Second operand 5 states and 1366 transitions. [2022-11-16 11:05:22,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 283 transitions, 630 flow [2022-11-16 11:05:22,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 283 transitions, 630 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:05:22,374 INFO L231 Difference]: Finished difference. Result has 279 places, 279 transitions, 602 flow [2022-11-16 11:05:22,375 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=602, PETRI_PLACES=279, PETRI_TRANSITIONS=279} [2022-11-16 11:05:22,376 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 4 predicate places. [2022-11-16 11:05:22,376 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 279 transitions, 602 flow [2022-11-16 11:05:22,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 261.5) internal successors, (1046), 4 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states 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:05:22,377 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:22,377 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:22,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:05:22,378 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-16 11:05:22,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:22,378 INFO L85 PathProgramCache]: Analyzing trace with hash -220482704, now seen corresponding path program 1 times [2022-11-16 11:05:22,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:22,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153773818] [2022-11-16 11:05:22,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:22,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:05:22,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:22,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153773818] [2022-11-16 11:05:22,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153773818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:22,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:22,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:05:22,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129265577] [2022-11-16 11:05:22,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:22,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:05:22,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:22,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:05:22,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:05:22,425 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 318 [2022-11-16 11:05:22,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 279 transitions, 602 flow. Second operand has 4 states, 4 states have (on average 263.25) internal successors, (1053), 4 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states 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:05:22,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:22,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 318 [2022-11-16 11:05:22,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:22,574 INFO L130 PetriNetUnfolder]: 14/478 cut-off events. [2022-11-16 11:05:22,574 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-16 11:05:22,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 478 events. 14/478 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2288 event pairs, 0 based on Foata normal form. 1/417 useless extension candidates. Maximal degree in co-relation 479. Up to 11 conditions per place. [2022-11-16 11:05:22,584 INFO L137 encePairwiseOnDemand]: 312/318 looper letters, 11 selfloop transitions, 8 changer transitions 0/279 dead transitions. [2022-11-16 11:05:22,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 279 transitions, 638 flow [2022-11-16 11:05:22,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:05:22,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:05:22,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1317 transitions. [2022-11-16 11:05:22,588 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8283018867924529 [2022-11-16 11:05:22,588 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1317 transitions. [2022-11-16 11:05:22,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1317 transitions. [2022-11-16 11:05:22,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:22,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1317 transitions. [2022-11-16 11:05:22,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 263.4) internal successors, (1317), 5 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states 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:05:22,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:05:22,597 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:05:22,597 INFO L175 Difference]: Start difference. First operand has 279 places, 279 transitions, 602 flow. Second operand 5 states and 1317 transitions. [2022-11-16 11:05:22,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 279 transitions, 638 flow [2022-11-16 11:05:22,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 279 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:05:22,604 INFO L231 Difference]: Finished difference. Result has 282 places, 279 transitions, 620 flow [2022-11-16 11:05:22,605 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=620, PETRI_PLACES=282, PETRI_TRANSITIONS=279} [2022-11-16 11:05:22,606 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 7 predicate places. [2022-11-16 11:05:22,606 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 279 transitions, 620 flow [2022-11-16 11:05:22,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 263.25) internal successors, (1053), 4 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states 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:05:22,606 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:22,607 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:22,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:05:22,607 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-16 11:05:22,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1754971681, now seen corresponding path program 1 times [2022-11-16 11:05:22,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:22,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843539383] [2022-11-16 11:05:22,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:22,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:05:22,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:22,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843539383] [2022-11-16 11:05:22,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843539383] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:05:22,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384961388] [2022-11-16 11:05:22,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:22,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:22,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:22,680 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:05:22,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:05:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:22,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:05:22,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:05:22,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:05:22,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384961388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:22,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:05:22,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-16 11:05:22,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140604930] [2022-11-16 11:05:22,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:22,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:05:22,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:22,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:05:22,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:05:22,852 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 318 [2022-11-16 11:05:22,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 279 transitions, 620 flow. Second operand has 5 states, 5 states have (on average 262.8) internal successors, (1314), 5 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states 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:05:22,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:22,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 318 [2022-11-16 11:05:22,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:23,005 INFO L130 PetriNetUnfolder]: 14/477 cut-off events. [2022-11-16 11:05:23,005 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-11-16 11:05:23,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 477 events. 14/477 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2289 event pairs, 0 based on Foata normal form. 1/416 useless extension candidates. Maximal degree in co-relation 477. Up to 14 conditions per place. [2022-11-16 11:05:23,015 INFO L137 encePairwiseOnDemand]: 314/318 looper letters, 13 selfloop transitions, 5 changer transitions 0/278 dead transitions. [2022-11-16 11:05:23,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 278 transitions, 652 flow [2022-11-16 11:05:23,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:05:23,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 11:05:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1055 transitions. [2022-11-16 11:05:23,019 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8294025157232704 [2022-11-16 11:05:23,019 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1055 transitions. [2022-11-16 11:05:23,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1055 transitions. [2022-11-16 11:05:23,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:23,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1055 transitions. [2022-11-16 11:05:23,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states 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:05:23,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states 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:05:23,026 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states 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:05:23,026 INFO L175 Difference]: Start difference. First operand has 282 places, 279 transitions, 620 flow. Second operand 4 states and 1055 transitions. [2022-11-16 11:05:23,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 278 transitions, 652 flow [2022-11-16 11:05:23,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 278 transitions, 640 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:05:23,033 INFO L231 Difference]: Finished difference. Result has 281 places, 278 transitions, 614 flow [2022-11-16 11:05:23,035 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=614, PETRI_PLACES=281, PETRI_TRANSITIONS=278} [2022-11-16 11:05:23,036 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 6 predicate places. [2022-11-16 11:05:23,036 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 278 transitions, 614 flow [2022-11-16 11:05:23,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 262.8) internal successors, (1314), 5 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states 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:05:23,037 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:23,037 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:23,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:05:23,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:23,249 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-16 11:05:23,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:23,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1128727029, now seen corresponding path program 1 times [2022-11-16 11:05:23,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:23,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747496007] [2022-11-16 11:05:23,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:23,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:23,347 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:05:23,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:23,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747496007] [2022-11-16 11:05:23,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747496007] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:05:23,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237994695] [2022-11-16 11:05:23,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:23,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:23,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:23,350 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:05:23,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:05:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:23,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:05:23,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:23,482 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:05:23,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:05:23,524 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:05:23,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237994695] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:05:23,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:05:23,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 11:05:23,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102786299] [2022-11-16 11:05:23,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:05:23,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:05:23,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:23,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:05:23,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:05:23,532 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 318 [2022-11-16 11:05:23,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 278 transitions, 614 flow. Second operand has 10 states, 10 states have (on average 262.7) internal successors, (2627), 10 states have internal predecessors, (2627), 0 states have call successors, (0), 0 states 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:05:23,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:23,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 318 [2022-11-16 11:05:23,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:23,736 INFO L130 PetriNetUnfolder]: 14/485 cut-off events. [2022-11-16 11:05:23,737 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-16 11:05:23,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 485 events. 14/485 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2273 event pairs, 0 based on Foata normal form. 2/425 useless extension candidates. Maximal degree in co-relation 467. Up to 11 conditions per place. [2022-11-16 11:05:23,746 INFO L137 encePairwiseOnDemand]: 312/318 looper letters, 20 selfloop transitions, 9 changer transitions 0/289 dead transitions. [2022-11-16 11:05:23,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 289 transitions, 710 flow [2022-11-16 11:05:23,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:05:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:05:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2371 transitions. [2022-11-16 11:05:23,754 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8284416491963662 [2022-11-16 11:05:23,754 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2371 transitions. [2022-11-16 11:05:23,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2371 transitions. [2022-11-16 11:05:23,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:23,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2371 transitions. [2022-11-16 11:05:23,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 263.44444444444446) internal successors, (2371), 9 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states 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:05:23,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 318.0) internal successors, (3180), 10 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states 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:05:23,772 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 318.0) internal successors, (3180), 10 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states 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:05:23,772 INFO L175 Difference]: Start difference. First operand has 281 places, 278 transitions, 614 flow. Second operand 9 states and 2371 transitions. [2022-11-16 11:05:23,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 289 transitions, 710 flow [2022-11-16 11:05:23,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 289 transitions, 696 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:05:23,779 INFO L231 Difference]: Finished difference. Result has 290 places, 282 transitions, 660 flow [2022-11-16 11:05:23,780 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=660, PETRI_PLACES=290, PETRI_TRANSITIONS=282} [2022-11-16 11:05:23,781 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 15 predicate places. [2022-11-16 11:05:23,781 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 282 transitions, 660 flow [2022-11-16 11:05:23,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 262.7) internal successors, (2627), 10 states have internal predecessors, (2627), 0 states have call successors, (0), 0 states 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:05:23,782 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:23,783 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:23,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:05:23,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 11:05:23,989 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-16 11:05:23,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:23,989 INFO L85 PathProgramCache]: Analyzing trace with hash 522294635, now seen corresponding path program 2 times [2022-11-16 11:05:23,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:23,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069863438] [2022-11-16 11:05:23,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:23,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:24,053 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 11:05:24,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:24,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069863438] [2022-11-16 11:05:24,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069863438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:24,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:24,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:05:24,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331273710] [2022-11-16 11:05:24,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:24,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:05:24,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:24,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:05:24,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:05:24,058 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 318 [2022-11-16 11:05:24,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 282 transitions, 660 flow. Second operand has 4 states, 4 states have (on average 261.75) internal successors, (1047), 4 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states 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:05:24,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:24,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 318 [2022-11-16 11:05:24,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:24,215 INFO L130 PetriNetUnfolder]: 11/416 cut-off events. [2022-11-16 11:05:24,216 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-16 11:05:24,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 416 events. 11/416 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1798 event pairs, 0 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 420. Up to 21 conditions per place. [2022-11-16 11:05:24,224 INFO L137 encePairwiseOnDemand]: 311/318 looper letters, 19 selfloop transitions, 4 changer transitions 0/289 dead transitions. [2022-11-16 11:05:24,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 289 transitions, 720 flow [2022-11-16 11:05:24,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:05:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:05:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1326 transitions. [2022-11-16 11:05:24,231 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8339622641509434 [2022-11-16 11:05:24,231 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1326 transitions. [2022-11-16 11:05:24,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1326 transitions. [2022-11-16 11:05:24,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:24,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1326 transitions. [2022-11-16 11:05:24,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 265.2) internal successors, (1326), 5 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states 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:05:24,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:05:24,239 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:05:24,240 INFO L175 Difference]: Start difference. First operand has 290 places, 282 transitions, 660 flow. Second operand 5 states and 1326 transitions. [2022-11-16 11:05:24,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 289 transitions, 720 flow [2022-11-16 11:05:24,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 289 transitions, 704 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-16 11:05:24,247 INFO L231 Difference]: Finished difference. Result has 293 places, 285 transitions, 676 flow [2022-11-16 11:05:24,248 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=676, PETRI_PLACES=293, PETRI_TRANSITIONS=285} [2022-11-16 11:05:24,249 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 18 predicate places. [2022-11-16 11:05:24,249 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 285 transitions, 676 flow [2022-11-16 11:05:24,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 261.75) internal successors, (1047), 4 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states 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:05:24,250 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:24,250 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:24,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:05:24,250 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-16 11:05:24,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:24,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1069005584, now seen corresponding path program 1 times [2022-11-16 11:05:24,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:24,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834358007] [2022-11-16 11:05:24,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:24,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-16 11:05:24,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:24,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834358007] [2022-11-16 11:05:24,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834358007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:24,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:24,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:05:24,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667545123] [2022-11-16 11:05:24,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:24,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:05:24,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:24,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:05:24,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:05:24,312 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 318 [2022-11-16 11:05:24,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 285 transitions, 676 flow. Second operand has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states 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:05:24,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:24,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 318 [2022-11-16 11:05:24,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:24,439 INFO L130 PetriNetUnfolder]: 11/415 cut-off events. [2022-11-16 11:05:24,440 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-11-16 11:05:24,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 415 events. 11/415 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1805 event pairs, 0 based on Foata normal form. 1/370 useless extension candidates. Maximal degree in co-relation 427. Up to 10 conditions per place. [2022-11-16 11:05:24,450 INFO L137 encePairwiseOnDemand]: 312/318 looper letters, 11 selfloop transitions, 8 changer transitions 0/285 dead transitions. [2022-11-16 11:05:24,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 285 transitions, 712 flow [2022-11-16 11:05:24,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:05:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:05:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1317 transitions. [2022-11-16 11:05:24,453 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8283018867924529 [2022-11-16 11:05:24,453 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1317 transitions. [2022-11-16 11:05:24,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1317 transitions. [2022-11-16 11:05:24,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:24,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1317 transitions. [2022-11-16 11:05:24,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 263.4) internal successors, (1317), 5 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states 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:05:24,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:05:24,461 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:05:24,461 INFO L175 Difference]: Start difference. First operand has 293 places, 285 transitions, 676 flow. Second operand 5 states and 1317 transitions. [2022-11-16 11:05:24,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 285 transitions, 712 flow [2022-11-16 11:05:24,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 285 transitions, 710 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:05:24,468 INFO L231 Difference]: Finished difference. Result has 296 places, 285 transitions, 694 flow [2022-11-16 11:05:24,469 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=694, PETRI_PLACES=296, PETRI_TRANSITIONS=285} [2022-11-16 11:05:24,470 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 21 predicate places. [2022-11-16 11:05:24,470 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 285 transitions, 694 flow [2022-11-16 11:05:24,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states 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:05:24,471 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:24,471 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:24,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:05:24,471 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-16 11:05:24,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:24,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1220566111, now seen corresponding path program 1 times [2022-11-16 11:05:24,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:24,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788210389] [2022-11-16 11:05:24,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:24,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:05:24,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:24,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788210389] [2022-11-16 11:05:24,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788210389] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:05:24,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872464482] [2022-11-16 11:05:24,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:24,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:24,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:24,618 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:05:24,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:05:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:24,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 11:05:24,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:05:24,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:05:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:05:24,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872464482] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:05:24,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:05:24,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-16 11:05:24,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216219865] [2022-11-16 11:05:24,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:05:24,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:05:24,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:24,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:05:24,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:05:24,969 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 318 [2022-11-16 11:05:24,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 285 transitions, 694 flow. Second operand has 18 states, 18 states have (on average 263.1111111111111) internal successors, (4736), 18 states have internal predecessors, (4736), 0 states have call successors, (0), 0 states 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:05:24,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:24,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 318 [2022-11-16 11:05:24,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:25,377 INFO L130 PetriNetUnfolder]: 11/443 cut-off events. [2022-11-16 11:05:25,377 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-11-16 11:05:25,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 443 events. 11/443 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1791 event pairs, 0 based on Foata normal form. 4/401 useless extension candidates. Maximal degree in co-relation 421. Up to 11 conditions per place. [2022-11-16 11:05:25,387 INFO L137 encePairwiseOnDemand]: 312/318 looper letters, 36 selfloop transitions, 21 changer transitions 0/320 dead transitions. [2022-11-16 11:05:25,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 320 transitions, 962 flow [2022-11-16 11:05:25,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:05:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-16 11:05:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5521 transitions. [2022-11-16 11:05:25,396 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8267445342917041 [2022-11-16 11:05:25,396 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 5521 transitions. [2022-11-16 11:05:25,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 5521 transitions. [2022-11-16 11:05:25,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:25,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 5521 transitions. [2022-11-16 11:05:25,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 262.9047619047619) internal successors, (5521), 21 states have internal predecessors, (5521), 0 states have call successors, (0), 0 states 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:05:25,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 318.0) internal successors, (6996), 22 states have internal predecessors, (6996), 0 states have call successors, (0), 0 states 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:05:25,422 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 318.0) internal successors, (6996), 22 states have internal predecessors, (6996), 0 states have call successors, (0), 0 states 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:05:25,423 INFO L175 Difference]: Start difference. First operand has 296 places, 285 transitions, 694 flow. Second operand 21 states and 5521 transitions. [2022-11-16 11:05:25,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 320 transitions, 962 flow [2022-11-16 11:05:25,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 320 transitions, 950 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:05:25,431 INFO L231 Difference]: Finished difference. Result has 318 places, 298 transitions, 838 flow [2022-11-16 11:05:25,432 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=838, PETRI_PLACES=318, PETRI_TRANSITIONS=298} [2022-11-16 11:05:25,432 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 43 predicate places. [2022-11-16 11:05:25,432 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 298 transitions, 838 flow [2022-11-16 11:05:25,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 263.1111111111111) internal successors, (4736), 18 states have internal predecessors, (4736), 0 states have call successors, (0), 0 states 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:05:25,434 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:25,435 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:25,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-16 11:05:25,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 11:05:25,640 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-16 11:05:25,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:25,641 INFO L85 PathProgramCache]: Analyzing trace with hash 703946143, now seen corresponding path program 2 times [2022-11-16 11:05:25,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:25,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430539145] [2022-11-16 11:05:25,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:25,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:26,012 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:05:26,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:26,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430539145] [2022-11-16 11:05:26,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430539145] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:05:26,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123946365] [2022-11-16 11:05:26,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:05:26,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:26,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:26,015 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:05:26,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 11:05:26,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:05:26,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:05:26,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 11:05:26,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:26,257 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:05:26,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:05:26,526 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:05:26,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123946365] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:05:26,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:05:26,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-16 11:05:26,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962780588] [2022-11-16 11:05:26,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:05:26,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 11:05:26,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:26,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 11:05:26,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-16 11:05:26,535 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 318 [2022-11-16 11:05:26,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 298 transitions, 838 flow. Second operand has 23 states, 23 states have (on average 263.3478260869565) internal successors, (6057), 23 states have internal predecessors, (6057), 0 states have call successors, (0), 0 states 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:05:26,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:26,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 318 [2022-11-16 11:05:26,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:27,104 INFO L130 PetriNetUnfolder]: 11/464 cut-off events. [2022-11-16 11:05:27,104 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2022-11-16 11:05:27,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 464 events. 11/464 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1792 event pairs, 0 based on Foata normal form. 3/421 useless extension candidates. Maximal degree in co-relation 525. Up to 12 conditions per place. [2022-11-16 11:05:27,124 INFO L137 encePairwiseOnDemand]: 312/318 looper letters, 48 selfloop transitions, 30 changer transitions 0/341 dead transitions. [2022-11-16 11:05:27,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 341 transitions, 1204 flow [2022-11-16 11:05:27,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 11:05:27,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-16 11:05:27,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 7881 transitions. [2022-11-16 11:05:27,140 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8261006289308176 [2022-11-16 11:05:27,140 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 7881 transitions. [2022-11-16 11:05:27,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 7881 transitions. [2022-11-16 11:05:27,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:27,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 7881 transitions. [2022-11-16 11:05:27,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 262.7) internal successors, (7881), 30 states have internal predecessors, (7881), 0 states have call successors, (0), 0 states 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:05:27,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 318.0) internal successors, (9858), 31 states have internal predecessors, (9858), 0 states have call successors, (0), 0 states 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:05:27,213 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 318.0) internal successors, (9858), 31 states have internal predecessors, (9858), 0 states have call successors, (0), 0 states 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:05:27,213 INFO L175 Difference]: Start difference. First operand has 318 places, 298 transitions, 838 flow. Second operand 30 states and 7881 transitions. [2022-11-16 11:05:27,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 341 transitions, 1204 flow [2022-11-16 11:05:27,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 341 transitions, 1124 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-16 11:05:27,224 INFO L231 Difference]: Finished difference. Result has 343 places, 308 transitions, 936 flow [2022-11-16 11:05:27,225 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=936, PETRI_PLACES=343, PETRI_TRANSITIONS=308} [2022-11-16 11:05:27,225 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 68 predicate places. [2022-11-16 11:05:27,225 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 308 transitions, 936 flow [2022-11-16 11:05:27,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 263.3478260869565) internal successors, (6057), 23 states have internal predecessors, (6057), 0 states have call successors, (0), 0 states 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:05:27,228 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:27,228 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:27,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:05:27,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 11:05:27,445 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-16 11:05:27,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:27,447 INFO L85 PathProgramCache]: Analyzing trace with hash -2073886510, now seen corresponding path program 3 times [2022-11-16 11:05:27,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:27,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592837376] [2022-11-16 11:05:27,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:27,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-16 11:05:27,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:27,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592837376] [2022-11-16 11:05:27,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592837376] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:05:27,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760971265] [2022-11-16 11:05:27,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:05:27,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:27,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:27,603 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:05:27,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 11:05:27,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 11:05:27,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:05:27,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:05:27,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:27,789 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-16 11:05:27,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:05:27,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760971265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:27,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:05:27,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-16 11:05:27,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845459336] [2022-11-16 11:05:27,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:27,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:05:27,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:27,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:05:27,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:05:27,793 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 318 [2022-11-16 11:05:27,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 308 transitions, 936 flow. Second operand has 5 states, 5 states have (on average 263.2) internal successors, (1316), 5 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states 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:05:27,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:27,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 318 [2022-11-16 11:05:27,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:27,954 INFO L130 PetriNetUnfolder]: 11/463 cut-off events. [2022-11-16 11:05:27,954 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-11-16 11:05:27,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 463 events. 11/463 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1796 event pairs, 0 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 466. Up to 17 conditions per place. [2022-11-16 11:05:27,964 INFO L137 encePairwiseOnDemand]: 314/318 looper letters, 13 selfloop transitions, 5 changer transitions 0/307 dead transitions. [2022-11-16 11:05:27,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 307 transitions, 968 flow [2022-11-16 11:05:27,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:05:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 11:05:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1055 transitions. [2022-11-16 11:05:27,967 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8294025157232704 [2022-11-16 11:05:27,967 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1055 transitions. [2022-11-16 11:05:27,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1055 transitions. [2022-11-16 11:05:27,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:27,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1055 transitions. [2022-11-16 11:05:27,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states 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:05:27,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states 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:05:27,974 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states 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:05:27,975 INFO L175 Difference]: Start difference. First operand has 343 places, 308 transitions, 936 flow. Second operand 4 states and 1055 transitions. [2022-11-16 11:05:27,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 307 transitions, 968 flow [2022-11-16 11:05:27,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 307 transitions, 922 flow, removed 5 selfloop flow, removed 18 redundant places. [2022-11-16 11:05:27,985 INFO L231 Difference]: Finished difference. Result has 327 places, 307 transitions, 896 flow [2022-11-16 11:05:27,986 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=896, PETRI_PLACES=327, PETRI_TRANSITIONS=307} [2022-11-16 11:05:27,986 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 52 predicate places. [2022-11-16 11:05:27,987 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 307 transitions, 896 flow [2022-11-16 11:05:27,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 263.2) internal successors, (1316), 5 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states 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:05:27,987 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:27,988 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:28,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:05:28,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 11:05:28,194 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-16 11:05:28,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:28,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1408995081, now seen corresponding path program 1 times [2022-11-16 11:05:28,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:28,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947403527] [2022-11-16 11:05:28,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:28,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-16 11:05:28,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:28,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947403527] [2022-11-16 11:05:28,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947403527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:28,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:28,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:05:28,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744520919] [2022-11-16 11:05:28,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:28,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:05:28,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:28,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:05:28,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:05:28,904 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 318 [2022-11-16 11:05:28,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 307 transitions, 896 flow. Second operand has 11 states, 11 states have (on average 224.36363636363637) internal successors, (2468), 11 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states 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:05:28,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:28,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 318 [2022-11-16 11:05:28,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:36,890 INFO L130 PetriNetUnfolder]: 7691/30351 cut-off events. [2022-11-16 11:05:36,890 INFO L131 PetriNetUnfolder]: For 818/818 co-relation queries the response was YES. [2022-11-16 11:05:37,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42249 conditions, 30351 events. 7691/30351 cut-off events. For 818/818 co-relation queries the response was YES. Maximal size of possible extension queue 919. Compared 405942 event pairs, 1007 based on Foata normal form. 0/26339 useless extension candidates. Maximal degree in co-relation 41982. Up to 5292 conditions per place. [2022-11-16 11:05:37,257 INFO L137 encePairwiseOnDemand]: 299/318 looper letters, 286 selfloop transitions, 64 changer transitions 0/603 dead transitions. [2022-11-16 11:05:37,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 603 transitions, 2269 flow [2022-11-16 11:05:37,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 11:05:37,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-16 11:05:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 5690 transitions. [2022-11-16 11:05:37,266 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7455450733752621 [2022-11-16 11:05:37,267 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 5690 transitions. [2022-11-16 11:05:37,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 5690 transitions. [2022-11-16 11:05:37,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:37,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 5690 transitions. [2022-11-16 11:05:37,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 237.08333333333334) internal successors, (5690), 24 states have internal predecessors, (5690), 0 states have call successors, (0), 0 states 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:05:37,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 318.0) internal successors, (7950), 25 states have internal predecessors, (7950), 0 states have call successors, (0), 0 states 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:05:37,292 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 318.0) internal successors, (7950), 25 states have internal predecessors, (7950), 0 states have call successors, (0), 0 states 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:05:37,293 INFO L175 Difference]: Start difference. First operand has 327 places, 307 transitions, 896 flow. Second operand 24 states and 5690 transitions. [2022-11-16 11:05:37,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 603 transitions, 2269 flow [2022-11-16 11:05:37,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 603 transitions, 2259 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:05:37,309 INFO L231 Difference]: Finished difference. Result has 365 places, 383 transitions, 1398 flow [2022-11-16 11:05:37,310 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1398, PETRI_PLACES=365, PETRI_TRANSITIONS=383} [2022-11-16 11:05:37,311 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 90 predicate places. [2022-11-16 11:05:37,311 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 383 transitions, 1398 flow [2022-11-16 11:05:37,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 224.36363636363637) internal successors, (2468), 11 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states 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:05:37,312 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:37,312 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:37,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:05:37,313 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-16 11:05:37,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:37,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1734289246, now seen corresponding path program 1 times [2022-11-16 11:05:37,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:37,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655033338] [2022-11-16 11:05:37,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:37,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-16 11:05:37,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:37,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655033338] [2022-11-16 11:05:37,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655033338] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:05:37,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79542517] [2022-11-16 11:05:37,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:37,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:37,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:37,439 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:05:37,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 11:05:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:37,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:05:37,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2022-11-16 11:05:37,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:05:37,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79542517] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:37,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:05:37,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-16 11:05:37,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884408367] [2022-11-16 11:05:37,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:37,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:05:37,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:37,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:05:37,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:05:37,589 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 318 [2022-11-16 11:05:37,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 383 transitions, 1398 flow. Second operand has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states 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:05:37,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:37,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 318 [2022-11-16 11:05:37,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:38,448 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1088] t_funEXIT-->L957-4: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#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~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_7|} AuxVars[] AssignedVars[][322], [Black: 2199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2193#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2211#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 288#true, Black: 2203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2195#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2197#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2205#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2209#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 1002#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 714#(<= |ULTIMATE.start_main_~i~1#1| 3), 706#true, Black: 1042#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1019#(< |ULTIMATE.start_main_~i~1#1| 9), 225#L957-4true, t_funThread1of2ForFork0NotInUse, Black: 1556#(< |ULTIMATE.start_main_~i~1#1| 10), 2184#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), Black: 1184#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread2of2ForFork0NotInUse, Black: 1573#(< |ULTIMATE.start_main_~i~1#1| 9), 1168#true, Black: 280#(= |ULTIMATE.start_main_~i~1#1| 0), 2249#true, 697#true, Black: 584#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 416#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 690#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2201#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 689#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2207#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 692#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), 412#true, Black: 2217#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2215#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2221#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2227#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2185#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2213#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2223#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|))]) [2022-11-16 11:05:38,449 INFO L383 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-11-16 11:05:38,449 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-16 11:05:38,449 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-16 11:05:38,449 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-16 11:05:38,825 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1088] t_funEXIT-->L957-4: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#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~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_7|} AuxVars[] AssignedVars[][322], [Black: 2199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2193#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2211#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 288#true, Black: 2203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2195#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2197#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2205#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2209#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 1002#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 714#(<= |ULTIMATE.start_main_~i~1#1| 3), 706#true, Black: 1042#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1019#(< |ULTIMATE.start_main_~i~1#1| 9), 225#L957-4true, t_funThread1of2ForFork0NotInUse, Black: 1556#(< |ULTIMATE.start_main_~i~1#1| 10), 2184#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), Black: 1184#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1573#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread2of2ForFork0InUse, 1168#true, Black: 280#(= |ULTIMATE.start_main_~i~1#1| 0), 16#t_funENTRYtrue, 2249#true, 697#true, Black: 584#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 416#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 690#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2201#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 689#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 692#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2207#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 412#true, Black: 2217#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2215#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2221#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2227#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2185#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2213#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2223#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|))]) [2022-11-16 11:05:38,825 INFO L383 tUnfolder$Statistics]: this new event has 218 ancestors and is cut-off event [2022-11-16 11:05:38,825 INFO L386 tUnfolder$Statistics]: existing Event has 176 ancestors and is cut-off event [2022-11-16 11:05:38,825 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-16 11:05:38,826 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-16 11:05:39,195 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1089] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][354], [Black: 2199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2193#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2211#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 288#true, Black: 2203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2195#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2197#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2205#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2209#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 1002#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 714#(<= |ULTIMATE.start_main_~i~1#1| 3), 706#true, Black: 1042#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1019#(< |ULTIMATE.start_main_~i~1#1| 9), 225#L957-4true, t_funThread1of2ForFork0NotInUse, Black: 1556#(< |ULTIMATE.start_main_~i~1#1| 10), 2184#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), Black: 1184#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread2of2ForFork0NotInUse, Black: 1573#(< |ULTIMATE.start_main_~i~1#1| 9), 1168#true, Black: 280#(= |ULTIMATE.start_main_~i~1#1| 0), 2249#true, 697#true, Black: 584#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 416#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 690#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 689#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2201#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 692#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2207#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 412#true, Black: 2217#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2215#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2221#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2227#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2185#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2213#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2223#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|))]) [2022-11-16 11:05:39,195 INFO L383 tUnfolder$Statistics]: this new event has 251 ancestors and is cut-off event [2022-11-16 11:05:39,195 INFO L386 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-11-16 11:05:39,196 INFO L386 tUnfolder$Statistics]: existing Event has 221 ancestors and is cut-off event [2022-11-16 11:05:39,196 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-16 11:05:39,566 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] L947-1-->L947-2: Formula: (and (= |v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset_1| (+ (* |v_t_funThread1of2ForFork0_~i~0#1_9| 28) |v_~#cache~0.offset_4|)) (= |v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base_1| |v_~#cache~0.base_5|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_4|, ~#cache~0.base=|v_~#cache~0.base_5|, t_funThread1of2ForFork0_~i~0#1=|v_t_funThread1of2ForFork0_~i~0#1_9|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_4|, ~#cache~0.base=|v_~#cache~0.base_5|, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base=|v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base_1|, t_funThread1of2ForFork0_~i~0#1=|v_t_funThread1of2ForFork0_~i~0#1_9|, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset=|v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset_1|} AuxVars[] AssignedVars[t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base][200], [Black: 2199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 30#L947-2true, Black: 2193#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2211#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 288#true, Black: 2203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2195#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2197#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2205#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2209#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 1002#(< |ULTIMATE.start_main_~i~1#1| 10), 109#L958true, Black: 714#(<= |ULTIMATE.start_main_~i~1#1| 3), 706#true, Black: 1042#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1019#(< |ULTIMATE.start_main_~i~1#1| 9), 2184#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), Black: 1556#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread1of2ForFork0InUse, Black: 1184#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1573#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread2of2ForFork0InUse, 1168#true, Black: 280#(= |ULTIMATE.start_main_~i~1#1| 0), 2249#true, 697#true, Black: 584#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 416#(<= |ULTIMATE.start_main_~i~1#1| 1), 203#L941-10true, Black: 690#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2201#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 689#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2207#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 692#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), 412#true, Black: 2217#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2215#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2221#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2227#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2185#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2213#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2223#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|))]) [2022-11-16 11:05:39,566 INFO L383 tUnfolder$Statistics]: this new event has 228 ancestors and is cut-off event [2022-11-16 11:05:39,566 INFO L386 tUnfolder$Statistics]: existing Event has 186 ancestors and is cut-off event [2022-11-16 11:05:39,567 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-16 11:05:39,567 INFO L386 tUnfolder$Statistics]: existing Event has 228 ancestors and is cut-off event [2022-11-16 11:05:39,610 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([723] L954-17-->L954-18: Formula: (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t_ids~0#1.base_5| 0)) InVars {ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid][318], [Black: 2184#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), Black: 2199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2193#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2211#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 288#true, Black: 2203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2195#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2197#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2205#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2209#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 1002#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 714#(<= |ULTIMATE.start_main_~i~1#1| 3), 706#true, Black: 1042#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1019#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread1of2ForFork0NotInUse, Black: 1556#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1184#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1573#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread2of2ForFork0InUse, 1168#true, Black: 280#(= |ULTIMATE.start_main_~i~1#1| 0), 2249#true, 697#true, Black: 584#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 416#(<= |ULTIMATE.start_main_~i~1#1| 1), 203#L941-10true, 10#L954-18true, Black: 690#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2201#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 689#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 692#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2207#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 412#true, Black: 2217#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2215#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2221#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2227#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2185#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 2183#(= 3 |~#cache~0.base|), Black: 2213#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2223#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|))]) [2022-11-16 11:05:39,610 INFO L383 tUnfolder$Statistics]: this new event has 236 ancestors and is cut-off event [2022-11-16 11:05:39,610 INFO L386 tUnfolder$Statistics]: existing Event has 224 ancestors and is cut-off event [2022-11-16 11:05:39,611 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-16 11:05:39,611 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-16 11:05:39,612 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1089] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][354], [Black: 2199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2193#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2211#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 288#true, Black: 2203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2195#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2197#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2205#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2209#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 1002#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 714#(<= |ULTIMATE.start_main_~i~1#1| 3), 706#true, Black: 1042#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1019#(< |ULTIMATE.start_main_~i~1#1| 9), 225#L957-4true, t_funThread1of2ForFork0NotInUse, Black: 1556#(< |ULTIMATE.start_main_~i~1#1| 10), 2184#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), Black: 1184#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread2of2ForFork0NotInUse, Black: 1573#(< |ULTIMATE.start_main_~i~1#1| 9), 1168#true, Black: 280#(= |ULTIMATE.start_main_~i~1#1| 0), 2249#true, 697#true, Black: 584#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 416#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 690#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2201#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 689#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 692#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2207#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 412#true, Black: 2217#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2215#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2221#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2227#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2185#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2213#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2223#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|))]) [2022-11-16 11:05:39,612 INFO L383 tUnfolder$Statistics]: this new event has 263 ancestors and is cut-off event [2022-11-16 11:05:39,612 INFO L386 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-11-16 11:05:39,613 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:05:39,613 INFO L386 tUnfolder$Statistics]: existing Event has 221 ancestors and is cut-off event [2022-11-16 11:05:39,613 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-16 11:05:39,676 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([723] L954-17-->L954-18: Formula: (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t_ids~0#1.base_5| 0)) InVars {ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid][318], [Black: 2184#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), Black: 2199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2193#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2211#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 288#true, Black: 2203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2195#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2197#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2205#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2209#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 1002#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 714#(<= |ULTIMATE.start_main_~i~1#1| 3), 706#true, Black: 1042#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1019#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1556#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread1of2ForFork0InUse, Black: 1184#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread2of2ForFork0NotInUse, Black: 1573#(< |ULTIMATE.start_main_~i~1#1| 9), 1168#true, Black: 280#(= |ULTIMATE.start_main_~i~1#1| 0), 2249#true, 697#true, Black: 584#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 416#(<= |ULTIMATE.start_main_~i~1#1| 1), 10#L954-18true, Black: 690#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2201#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 689#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 692#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2207#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 412#true, Black: 2217#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2215#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2221#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 129#L941-10true, Black: 2227#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2185#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2213#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 2183#(= 3 |~#cache~0.base|), Black: 2223#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|))]) [2022-11-16 11:05:39,677 INFO L383 tUnfolder$Statistics]: this new event has 248 ancestors and is cut-off event [2022-11-16 11:05:39,677 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-16 11:05:39,677 INFO L386 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-11-16 11:05:39,677 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-16 11:05:39,703 INFO L130 PetriNetUnfolder]: 549/6263 cut-off events. [2022-11-16 11:05:39,703 INFO L131 PetriNetUnfolder]: For 3485/3736 co-relation queries the response was YES. [2022-11-16 11:05:39,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8838 conditions, 6263 events. 549/6263 cut-off events. For 3485/3736 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 65267 event pairs, 76 based on Foata normal form. 35/5458 useless extension candidates. Maximal degree in co-relation 8651. Up to 191 conditions per place. [2022-11-16 11:05:39,881 INFO L137 encePairwiseOnDemand]: 315/318 looper letters, 14 selfloop transitions, 2 changer transitions 0/387 dead transitions. [2022-11-16 11:05:39,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 387 transitions, 1438 flow [2022-11-16 11:05:39,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:05:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:05:39,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 809 transitions. [2022-11-16 11:05:39,886 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8480083857442348 [2022-11-16 11:05:39,886 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 809 transitions. [2022-11-16 11:05:39,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 809 transitions. [2022-11-16 11:05:39,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:39,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 809 transitions. [2022-11-16 11:05:39,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.6666666666667) internal successors, (809), 3 states have internal predecessors, (809), 0 states have call successors, (0), 0 states 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:05:39,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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:05:39,892 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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:05:39,892 INFO L175 Difference]: Start difference. First operand has 365 places, 383 transitions, 1398 flow. Second operand 3 states and 809 transitions. [2022-11-16 11:05:39,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 387 transitions, 1438 flow [2022-11-16 11:05:39,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 387 transitions, 1437 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:05:39,921 INFO L231 Difference]: Finished difference. Result has 367 places, 384 transitions, 1409 flow [2022-11-16 11:05:39,922 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1409, PETRI_PLACES=367, PETRI_TRANSITIONS=384} [2022-11-16 11:05:39,922 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 92 predicate places. [2022-11-16 11:05:39,923 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 384 transitions, 1409 flow [2022-11-16 11:05:39,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states 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:05:39,923 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:39,924 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:39,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:05:40,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:40,134 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-16 11:05:40,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:40,135 INFO L85 PathProgramCache]: Analyzing trace with hash 528829954, now seen corresponding path program 1 times [2022-11-16 11:05:40,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:40,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780098532] [2022-11-16 11:05:40,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:40,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:05:40,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:05:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:05:40,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:05:40,216 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:05:40,216 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2022-11-16 11:05:40,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 31 remaining) [2022-11-16 11:05:40,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 31 remaining) [2022-11-16 11:05:40,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 31 remaining) [2022-11-16 11:05:40,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 31 remaining) [2022-11-16 11:05:40,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 31 remaining) [2022-11-16 11:05:40,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 31 remaining) [2022-11-16 11:05:40,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 31 remaining) [2022-11-16 11:05:40,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 31 remaining) [2022-11-16 11:05:40,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 31 remaining) [2022-11-16 11:05:40,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 31 remaining) [2022-11-16 11:05:40,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 31 remaining) [2022-11-16 11:05:40,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 31 remaining) [2022-11-16 11:05:40,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 31 remaining) [2022-11-16 11:05:40,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 31 remaining) [2022-11-16 11:05:40,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 31 remaining) [2022-11-16 11:05:40,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 31 remaining) [2022-11-16 11:05:40,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 31 remaining) [2022-11-16 11:05:40,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 31 remaining) [2022-11-16 11:05:40,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 31 remaining) [2022-11-16 11:05:40,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 31 remaining) [2022-11-16 11:05:40,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 31 remaining) [2022-11-16 11:05:40,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 31 remaining) [2022-11-16 11:05:40,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 31 remaining) [2022-11-16 11:05:40,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 31 remaining) [2022-11-16 11:05:40,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 31 remaining) [2022-11-16 11:05:40,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 31 remaining) [2022-11-16 11:05:40,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 31 remaining) [2022-11-16 11:05:40,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 31 remaining) [2022-11-16 11:05:40,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 31 remaining) [2022-11-16 11:05:40,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 31 remaining) [2022-11-16 11:05:40,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:05:40,225 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:40,226 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:05:40,226 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-16 11:05:40,286 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 11:05:40,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 346 places, 402 transitions, 834 flow [2022-11-16 11:05:40,487 INFO L130 PetriNetUnfolder]: 120/802 cut-off events. [2022-11-16 11:05:40,487 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-16 11:05:40,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 802 events. 120/802 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4124 event pairs, 1 based on Foata normal form. 0/614 useless extension candidates. Maximal degree in co-relation 553. Up to 16 conditions per place. [2022-11-16 11:05:40,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 346 places, 402 transitions, 834 flow [2022-11-16 11:05:40,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 346 places, 402 transitions, 834 flow [2022-11-16 11:05:40,520 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:05:40,520 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;@2e72c1a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:05:40,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2022-11-16 11:05:40,524 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-16 11:05:40,524 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:05:40,524 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:40,525 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:40,525 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-16 11:05:40,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:40,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1606624309, now seen corresponding path program 1 times [2022-11-16 11:05:40,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:40,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342277044] [2022-11-16 11:05:40,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:40,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:40,567 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:05:40,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:40,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342277044] [2022-11-16 11:05:40,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342277044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:40,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:40,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:05:40,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329236629] [2022-11-16 11:05:40,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:40,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:05:40,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:40,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:05:40,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:05:40,572 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 402 [2022-11-16 11:05:40,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 402 transitions, 834 flow. Second operand has 4 states, 4 states have (on average 330.5) internal successors, (1322), 4 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states 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:05:40,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:40,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 402 [2022-11-16 11:05:40,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:40,959 INFO L130 PetriNetUnfolder]: 23/705 cut-off events. [2022-11-16 11:05:40,959 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-16 11:05:40,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 705 events. 23/705 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3799 event pairs, 1 based on Foata normal form. 185/792 useless extension candidates. Maximal degree in co-relation 512. Up to 28 conditions per place. [2022-11-16 11:05:40,972 INFO L137 encePairwiseOnDemand]: 344/402 looper letters, 21 selfloop transitions, 4 changer transitions 0/354 dead transitions. [2022-11-16 11:05:40,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 354 transitions, 788 flow [2022-11-16 11:05:40,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:05:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:05:40,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1725 transitions. [2022-11-16 11:05:40,975 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8582089552238806 [2022-11-16 11:05:40,976 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1725 transitions. [2022-11-16 11:05:40,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1725 transitions. [2022-11-16 11:05:40,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:40,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1725 transitions. [2022-11-16 11:05:40,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states 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:05:40,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 402.0) internal successors, (2412), 6 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states 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:05:40,986 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 402.0) internal successors, (2412), 6 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states 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:05:40,986 INFO L175 Difference]: Start difference. First operand has 346 places, 402 transitions, 834 flow. Second operand 5 states and 1725 transitions. [2022-11-16 11:05:40,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 354 transitions, 788 flow [2022-11-16 11:05:40,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 354 transitions, 788 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:05:40,992 INFO L231 Difference]: Finished difference. Result has 349 places, 350 transitions, 756 flow [2022-11-16 11:05:40,993 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=756, PETRI_PLACES=349, PETRI_TRANSITIONS=350} [2022-11-16 11:05:40,994 INFO L288 CegarLoopForPetriNet]: 346 programPoint places, 3 predicate places. [2022-11-16 11:05:40,994 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 350 transitions, 756 flow [2022-11-16 11:05:40,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 330.5) internal successors, (1322), 4 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states 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:05:40,995 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:40,995 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:40,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:05:40,995 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-16 11:05:40,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash -291862096, now seen corresponding path program 1 times [2022-11-16 11:05:40,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:40,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536847139] [2022-11-16 11:05:40,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:40,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:05:41,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:41,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536847139] [2022-11-16 11:05:41,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536847139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:41,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:41,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:05:41,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813989874] [2022-11-16 11:05:41,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:41,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:05:41,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:41,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:05:41,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:05:41,029 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 402 [2022-11-16 11:05:41,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 350 transitions, 756 flow. Second operand has 4 states, 4 states have (on average 332.25) internal successors, (1329), 4 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states 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:05:41,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:41,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 402 [2022-11-16 11:05:41,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:41,204 INFO L130 PetriNetUnfolder]: 23/704 cut-off events. [2022-11-16 11:05:41,205 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-11-16 11:05:41,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 704 events. 23/704 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3773 event pairs, 1 based on Foata normal form. 1/610 useless extension candidates. Maximal degree in co-relation 727. Up to 20 conditions per place. [2022-11-16 11:05:41,221 INFO L137 encePairwiseOnDemand]: 396/402 looper letters, 13 selfloop transitions, 8 changer transitions 0/350 dead transitions. [2022-11-16 11:05:41,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 350 transitions, 796 flow [2022-11-16 11:05:41,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:05:41,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:05:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1664 transitions. [2022-11-16 11:05:41,224 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8278606965174129 [2022-11-16 11:05:41,224 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1664 transitions. [2022-11-16 11:05:41,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1664 transitions. [2022-11-16 11:05:41,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:41,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1664 transitions. [2022-11-16 11:05:41,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 332.8) internal successors, (1664), 5 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states 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:05:41,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 402.0) internal successors, (2412), 6 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states 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:05:41,232 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 402.0) internal successors, (2412), 6 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states 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:05:41,232 INFO L175 Difference]: Start difference. First operand has 349 places, 350 transitions, 756 flow. Second operand 5 states and 1664 transitions. [2022-11-16 11:05:41,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 350 transitions, 796 flow [2022-11-16 11:05:41,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 350 transitions, 794 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:05:41,239 INFO L231 Difference]: Finished difference. Result has 352 places, 350 transitions, 774 flow [2022-11-16 11:05:41,240 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=774, PETRI_PLACES=352, PETRI_TRANSITIONS=350} [2022-11-16 11:05:41,240 INFO L288 CegarLoopForPetriNet]: 346 programPoint places, 6 predicate places. [2022-11-16 11:05:41,240 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 350 transitions, 774 flow [2022-11-16 11:05:41,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 332.25) internal successors, (1329), 4 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states 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:05:41,241 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:41,241 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:41,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 11:05:41,242 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-16 11:05:41,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:41,242 INFO L85 PathProgramCache]: Analyzing trace with hash -457789069, now seen corresponding path program 1 times [2022-11-16 11:05:41,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:41,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597216829] [2022-11-16 11:05:41,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:41,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:41,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:05:41,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:41,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597216829] [2022-11-16 11:05:41,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597216829] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:05:41,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352114157] [2022-11-16 11:05:41,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:41,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:41,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:41,298 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:05:41,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 11:05:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:41,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:05:41,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:05:41,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:05:41,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352114157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:41,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:05:41,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-16 11:05:41,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277304339] [2022-11-16 11:05:41,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:41,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:05:41,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:41,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:05:41,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:05:41,453 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 402 [2022-11-16 11:05:41,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 350 transitions, 774 flow. Second operand has 5 states, 5 states have (on average 331.8) internal successors, (1659), 5 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states 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:05:41,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:41,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 402 [2022-11-16 11:05:41,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:41,636 INFO L130 PetriNetUnfolder]: 23/703 cut-off events. [2022-11-16 11:05:41,636 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-11-16 11:05:41,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 703 events. 23/703 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3785 event pairs, 1 based on Foata normal form. 1/609 useless extension candidates. Maximal degree in co-relation 725. Up to 23 conditions per place. [2022-11-16 11:05:41,652 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 15 selfloop transitions, 5 changer transitions 0/349 dead transitions. [2022-11-16 11:05:41,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 349 transitions, 810 flow [2022-11-16 11:05:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:05:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 11:05:41,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1333 transitions. [2022-11-16 11:05:41,655 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8289800995024875 [2022-11-16 11:05:41,655 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1333 transitions. [2022-11-16 11:05:41,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1333 transitions. [2022-11-16 11:05:41,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:41,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1333 transitions. [2022-11-16 11:05:41,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 333.25) internal successors, (1333), 4 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states 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:05:41,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 402.0) internal successors, (2010), 5 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states 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:05:41,662 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 402.0) internal successors, (2010), 5 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states 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:05:41,662 INFO L175 Difference]: Start difference. First operand has 352 places, 350 transitions, 774 flow. Second operand 4 states and 1333 transitions. [2022-11-16 11:05:41,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 349 transitions, 810 flow [2022-11-16 11:05:41,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 349 transitions, 798 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:05:41,671 INFO L231 Difference]: Finished difference. Result has 351 places, 349 transitions, 768 flow [2022-11-16 11:05:41,672 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=768, PETRI_PLACES=351, PETRI_TRANSITIONS=349} [2022-11-16 11:05:41,673 INFO L288 CegarLoopForPetriNet]: 346 programPoint places, 5 predicate places. [2022-11-16 11:05:41,673 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 349 transitions, 768 flow [2022-11-16 11:05:41,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 331.8) internal successors, (1659), 5 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states 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:05:41,674 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:41,674 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:41,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 11:05:41,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:41,879 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-16 11:05:41,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:41,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1536978863, now seen corresponding path program 1 times [2022-11-16 11:05:41,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:41,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388802844] [2022-11-16 11:05:41,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:41,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:41,930 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:05:41,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:41,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388802844] [2022-11-16 11:05:41,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388802844] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:05:41,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059204921] [2022-11-16 11:05:41,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:41,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:41,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:41,932 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:05:41,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 11:05:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:42,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:05:42,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:42,082 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:05:42,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:05:42,119 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:05:42,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059204921] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:05:42,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:05:42,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 11:05:42,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223088593] [2022-11-16 11:05:42,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:05:42,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:05:42,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:42,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:05:42,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:05:42,124 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 402 [2022-11-16 11:05:42,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 349 transitions, 768 flow. Second operand has 10 states, 10 states have (on average 331.7) internal successors, (3317), 10 states have internal predecessors, (3317), 0 states have call successors, (0), 0 states 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:05:42,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:42,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 402 [2022-11-16 11:05:42,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:42,376 INFO L130 PetriNetUnfolder]: 23/711 cut-off events. [2022-11-16 11:05:42,377 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-11-16 11:05:42,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 711 events. 23/711 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3786 event pairs, 1 based on Foata normal form. 2/618 useless extension candidates. Maximal degree in co-relation 715. Up to 20 conditions per place. [2022-11-16 11:05:42,393 INFO L137 encePairwiseOnDemand]: 396/402 looper letters, 22 selfloop transitions, 9 changer transitions 0/360 dead transitions. [2022-11-16 11:05:42,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 360 transitions, 868 flow [2022-11-16 11:05:42,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:05:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:05:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2994 transitions. [2022-11-16 11:05:42,398 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8275290215588723 [2022-11-16 11:05:42,398 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2994 transitions. [2022-11-16 11:05:42,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2994 transitions. [2022-11-16 11:05:42,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:42,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2994 transitions. [2022-11-16 11:05:42,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 332.6666666666667) internal successors, (2994), 9 states have internal predecessors, (2994), 0 states have call successors, (0), 0 states 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:05:42,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 402.0) internal successors, (4020), 10 states have internal predecessors, (4020), 0 states have call successors, (0), 0 states 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:05:42,411 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 402.0) internal successors, (4020), 10 states have internal predecessors, (4020), 0 states have call successors, (0), 0 states 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:05:42,411 INFO L175 Difference]: Start difference. First operand has 351 places, 349 transitions, 768 flow. Second operand 9 states and 2994 transitions. [2022-11-16 11:05:42,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 360 transitions, 868 flow [2022-11-16 11:05:42,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 360 transitions, 854 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:05:42,418 INFO L231 Difference]: Finished difference. Result has 360 places, 353 transitions, 814 flow [2022-11-16 11:05:42,419 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=814, PETRI_PLACES=360, PETRI_TRANSITIONS=353} [2022-11-16 11:05:42,420 INFO L288 CegarLoopForPetriNet]: 346 programPoint places, 14 predicate places. [2022-11-16 11:05:42,420 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 353 transitions, 814 flow [2022-11-16 11:05:42,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 331.7) internal successors, (3317), 10 states have internal predecessors, (3317), 0 states have call successors, (0), 0 states 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:05:42,421 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:42,421 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:42,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-16 11:05:42,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-16 11:05:42,627 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-16 11:05:42,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:42,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2079449265, now seen corresponding path program 2 times [2022-11-16 11:05:42,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:42,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462959908] [2022-11-16 11:05:42,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:42,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 11:05:42,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:42,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462959908] [2022-11-16 11:05:42,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462959908] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:42,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:42,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:05:42,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348033815] [2022-11-16 11:05:42,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:42,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:05:42,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:42,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:05:42,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:05:42,686 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 402 [2022-11-16 11:05:42,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 353 transitions, 814 flow. Second operand has 4 states, 4 states have (on average 330.75) internal successors, (1323), 4 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states 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:05:42,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:42,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 402 [2022-11-16 11:05:42,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:42,955 INFO L130 PetriNetUnfolder]: 20/642 cut-off events. [2022-11-16 11:05:42,956 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-11-16 11:05:42,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 642 events. 20/642 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3325 event pairs, 1 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 678. Up to 40 conditions per place. [2022-11-16 11:05:42,970 INFO L137 encePairwiseOnDemand]: 395/402 looper letters, 21 selfloop transitions, 4 changer transitions 0/360 dead transitions. [2022-11-16 11:05:42,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 360 transitions, 878 flow [2022-11-16 11:05:42,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:05:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:05:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1673 transitions. [2022-11-16 11:05:42,973 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8323383084577114 [2022-11-16 11:05:42,973 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1673 transitions. [2022-11-16 11:05:42,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1673 transitions. [2022-11-16 11:05:42,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:42,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1673 transitions. [2022-11-16 11:05:42,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 334.6) internal successors, (1673), 5 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states 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:05:42,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 402.0) internal successors, (2412), 6 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states 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:05:42,980 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 402.0) internal successors, (2412), 6 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states 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:05:42,980 INFO L175 Difference]: Start difference. First operand has 360 places, 353 transitions, 814 flow. Second operand 5 states and 1673 transitions. [2022-11-16 11:05:42,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 360 transitions, 878 flow [2022-11-16 11:05:42,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 360 transitions, 862 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-16 11:05:42,987 INFO L231 Difference]: Finished difference. Result has 363 places, 356 transitions, 830 flow [2022-11-16 11:05:42,988 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=830, PETRI_PLACES=363, PETRI_TRANSITIONS=356} [2022-11-16 11:05:42,989 INFO L288 CegarLoopForPetriNet]: 346 programPoint places, 17 predicate places. [2022-11-16 11:05:42,989 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 356 transitions, 830 flow [2022-11-16 11:05:42,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 330.75) internal successors, (1323), 4 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states 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:05:42,990 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:42,990 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:42,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-16 11:05:42,991 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-16 11:05:42,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:42,991 INFO L85 PathProgramCache]: Analyzing trace with hash -71279194, now seen corresponding path program 1 times [2022-11-16 11:05:42,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:42,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822251283] [2022-11-16 11:05:42,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:42,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-16 11:05:43,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:43,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822251283] [2022-11-16 11:05:43,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822251283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:43,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:43,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:05:43,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885881347] [2022-11-16 11:05:43,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:43,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:05:43,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:43,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:05:43,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:05:43,059 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 402 [2022-11-16 11:05:43,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 356 transitions, 830 flow. Second operand has 4 states, 4 states have (on average 332.75) internal successors, (1331), 4 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states 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:05:43,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:43,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 402 [2022-11-16 11:05:43,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:43,251 INFO L130 PetriNetUnfolder]: 20/640 cut-off events. [2022-11-16 11:05:43,251 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-11-16 11:05:43,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 640 events. 20/640 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3309 event pairs, 1 based on Foata normal form. 2/566 useless extension candidates. Maximal degree in co-relation 688. Up to 20 conditions per place. [2022-11-16 11:05:43,267 INFO L137 encePairwiseOnDemand]: 396/402 looper letters, 13 selfloop transitions, 8 changer transitions 0/356 dead transitions. [2022-11-16 11:05:43,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 356 transitions, 870 flow [2022-11-16 11:05:43,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:05:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:05:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1664 transitions. [2022-11-16 11:05:43,270 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8278606965174129 [2022-11-16 11:05:43,271 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1664 transitions. [2022-11-16 11:05:43,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1664 transitions. [2022-11-16 11:05:43,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:43,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1664 transitions. [2022-11-16 11:05:43,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 332.8) internal successors, (1664), 5 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states 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:05:43,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 402.0) internal successors, (2412), 6 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states 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:05:43,278 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 402.0) internal successors, (2412), 6 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states 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:05:43,278 INFO L175 Difference]: Start difference. First operand has 363 places, 356 transitions, 830 flow. Second operand 5 states and 1664 transitions. [2022-11-16 11:05:43,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 356 transitions, 870 flow [2022-11-16 11:05:43,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 356 transitions, 868 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:05:43,286 INFO L231 Difference]: Finished difference. Result has 366 places, 356 transitions, 848 flow [2022-11-16 11:05:43,287 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=848, PETRI_PLACES=366, PETRI_TRANSITIONS=356} [2022-11-16 11:05:43,287 INFO L288 CegarLoopForPetriNet]: 346 programPoint places, 20 predicate places. [2022-11-16 11:05:43,287 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 356 transitions, 848 flow [2022-11-16 11:05:43,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 332.75) internal successors, (1331), 4 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states 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:05:43,288 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:43,288 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:43,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-16 11:05:43,289 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-16 11:05:43,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:43,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2085313531, now seen corresponding path program 1 times [2022-11-16 11:05:43,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:43,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456669339] [2022-11-16 11:05:43,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:43,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:05:43,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:43,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456669339] [2022-11-16 11:05:43,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456669339] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:05:43,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626344247] [2022-11-16 11:05:43,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:43,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:43,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:43,477 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:05:43,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 11:05:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:43,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 11:05:43,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:05:43,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:05:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:05:43,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626344247] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:05:43,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:05:43,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-16 11:05:43,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031832700] [2022-11-16 11:05:43,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:05:43,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:05:43,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:43,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:05:43,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:05:43,789 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 402 [2022-11-16 11:05:43,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 356 transitions, 848 flow. Second operand has 18 states, 18 states have (on average 332.1111111111111) internal successors, (5978), 18 states have internal predecessors, (5978), 0 states have call successors, (0), 0 states 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:05:43,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:43,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 402 [2022-11-16 11:05:43,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:44,191 INFO L130 PetriNetUnfolder]: 20/668 cut-off events. [2022-11-16 11:05:44,191 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-11-16 11:05:44,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 668 events. 20/668 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3302 event pairs, 1 based on Foata normal form. 4/596 useless extension candidates. Maximal degree in co-relation 678. Up to 20 conditions per place. [2022-11-16 11:05:44,208 INFO L137 encePairwiseOnDemand]: 396/402 looper letters, 38 selfloop transitions, 21 changer transitions 0/391 dead transitions. [2022-11-16 11:05:44,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 391 transitions, 1120 flow [2022-11-16 11:05:44,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:05:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-16 11:05:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6972 transitions. [2022-11-16 11:05:44,219 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8258706467661692 [2022-11-16 11:05:44,220 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 6972 transitions. [2022-11-16 11:05:44,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 6972 transitions. [2022-11-16 11:05:44,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:44,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 6972 transitions. [2022-11-16 11:05:44,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 332.0) internal successors, (6972), 21 states have internal predecessors, (6972), 0 states have call successors, (0), 0 states 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:05:44,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 402.0) internal successors, (8844), 22 states have internal predecessors, (8844), 0 states have call successors, (0), 0 states 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:05:44,257 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 402.0) internal successors, (8844), 22 states have internal predecessors, (8844), 0 states have call successors, (0), 0 states 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:05:44,258 INFO L175 Difference]: Start difference. First operand has 366 places, 356 transitions, 848 flow. Second operand 21 states and 6972 transitions. [2022-11-16 11:05:44,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 391 transitions, 1120 flow [2022-11-16 11:05:44,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 391 transitions, 1108 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:05:44,266 INFO L231 Difference]: Finished difference. Result has 388 places, 369 transitions, 992 flow [2022-11-16 11:05:44,266 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=992, PETRI_PLACES=388, PETRI_TRANSITIONS=369} [2022-11-16 11:05:44,267 INFO L288 CegarLoopForPetriNet]: 346 programPoint places, 42 predicate places. [2022-11-16 11:05:44,267 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 369 transitions, 992 flow [2022-11-16 11:05:44,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 332.1111111111111) internal successors, (5978), 18 states have internal predecessors, (5978), 0 states have call successors, (0), 0 states 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:05:44,269 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:44,269 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:44,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:05:44,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-16 11:05:44,475 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-16 11:05:44,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:44,475 INFO L85 PathProgramCache]: Analyzing trace with hash 355028155, now seen corresponding path program 2 times [2022-11-16 11:05:44,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:44,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232115327] [2022-11-16 11:05:44,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:44,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:05:44,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:44,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232115327] [2022-11-16 11:05:44,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232115327] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:05:44,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247945577] [2022-11-16 11:05:44,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:05:44,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:44,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:44,791 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:05:44,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 11:05:44,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:05:44,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:05:44,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 11:05:44,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:05:45,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:05:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:05:45,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247945577] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:05:45,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:05:45,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-16 11:05:45,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280512255] [2022-11-16 11:05:45,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:05:45,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 11:05:45,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:45,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 11:05:45,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-16 11:05:45,320 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 402 [2022-11-16 11:05:45,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 369 transitions, 992 flow. Second operand has 23 states, 23 states have (on average 332.3478260869565) internal successors, (7644), 23 states have internal predecessors, (7644), 0 states have call successors, (0), 0 states 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:05:45,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:45,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 402 [2022-11-16 11:05:45,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:45,918 INFO L130 PetriNetUnfolder]: 20/689 cut-off events. [2022-11-16 11:05:45,918 INFO L131 PetriNetUnfolder]: For 274/274 co-relation queries the response was YES. [2022-11-16 11:05:45,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 689 events. 20/689 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3310 event pairs, 1 based on Foata normal form. 3/616 useless extension candidates. Maximal degree in co-relation 728. Up to 20 conditions per place. [2022-11-16 11:05:45,933 INFO L137 encePairwiseOnDemand]: 396/402 looper letters, 50 selfloop transitions, 30 changer transitions 0/412 dead transitions. [2022-11-16 11:05:45,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 412 transitions, 1362 flow [2022-11-16 11:05:45,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 11:05:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-16 11:05:45,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9953 transitions. [2022-11-16 11:05:45,954 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8252902155887231 [2022-11-16 11:05:45,954 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 9953 transitions. [2022-11-16 11:05:45,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 9953 transitions. [2022-11-16 11:05:45,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:45,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 9953 transitions. [2022-11-16 11:05:45,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 331.76666666666665) internal successors, (9953), 30 states have internal predecessors, (9953), 0 states have call successors, (0), 0 states 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:05:45,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 402.0) internal successors, (12462), 31 states have internal predecessors, (12462), 0 states have call successors, (0), 0 states 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:05:45,992 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 402.0) internal successors, (12462), 31 states have internal predecessors, (12462), 0 states have call successors, (0), 0 states 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:05:45,993 INFO L175 Difference]: Start difference. First operand has 388 places, 369 transitions, 992 flow. Second operand 30 states and 9953 transitions. [2022-11-16 11:05:45,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 412 transitions, 1362 flow [2022-11-16 11:05:45,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 412 transitions, 1282 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-16 11:05:46,002 INFO L231 Difference]: Finished difference. Result has 413 places, 379 transitions, 1090 flow [2022-11-16 11:05:46,003 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1090, PETRI_PLACES=413, PETRI_TRANSITIONS=379} [2022-11-16 11:05:46,004 INFO L288 CegarLoopForPetriNet]: 346 programPoint places, 67 predicate places. [2022-11-16 11:05:46,004 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 379 transitions, 1090 flow [2022-11-16 11:05:46,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 332.3478260869565) internal successors, (7644), 23 states have internal predecessors, (7644), 0 states have call successors, (0), 0 states 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:05:46,005 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:46,005 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:46,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 11:05:46,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-16 11:05:46,211 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-16 11:05:46,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:46,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1619048832, now seen corresponding path program 3 times [2022-11-16 11:05:46,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:46,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455958369] [2022-11-16 11:05:46,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:46,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:46,342 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-16 11:05:46,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:46,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455958369] [2022-11-16 11:05:46,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455958369] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:05:46,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094835473] [2022-11-16 11:05:46,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:05:46,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:46,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:46,344 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:05:46,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 11:05:46,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 11:05:46,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:05:46,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:05:46,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-16 11:05:46,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:05:46,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094835473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:46,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:05:46,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-16 11:05:46,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368343700] [2022-11-16 11:05:46,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:46,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:05:46,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:46,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:05:46,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:05:46,532 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 402 [2022-11-16 11:05:46,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 379 transitions, 1090 flow. Second operand has 5 states, 5 states have (on average 332.2) internal successors, (1661), 5 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states 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:05:46,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:46,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 402 [2022-11-16 11:05:46,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:05:46,769 INFO L130 PetriNetUnfolder]: 20/687 cut-off events. [2022-11-16 11:05:46,769 INFO L131 PetriNetUnfolder]: For 235/235 co-relation queries the response was YES. [2022-11-16 11:05:46,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 687 events. 20/687 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3291 event pairs, 1 based on Foata normal form. 2/613 useless extension candidates. Maximal degree in co-relation 696. Up to 30 conditions per place. [2022-11-16 11:05:46,780 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 15 selfloop transitions, 5 changer transitions 0/378 dead transitions. [2022-11-16 11:05:46,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 378 transitions, 1126 flow [2022-11-16 11:05:46,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:05:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 11:05:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1333 transitions. [2022-11-16 11:05:46,783 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8289800995024875 [2022-11-16 11:05:46,784 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1333 transitions. [2022-11-16 11:05:46,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1333 transitions. [2022-11-16 11:05:46,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:05:46,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1333 transitions. [2022-11-16 11:05:46,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 333.25) internal successors, (1333), 4 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states 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:05:46,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 402.0) internal successors, (2010), 5 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states 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:05:46,789 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 402.0) internal successors, (2010), 5 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states 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:05:46,789 INFO L175 Difference]: Start difference. First operand has 413 places, 379 transitions, 1090 flow. Second operand 4 states and 1333 transitions. [2022-11-16 11:05:46,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 378 transitions, 1126 flow [2022-11-16 11:05:46,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 378 transitions, 1080 flow, removed 5 selfloop flow, removed 18 redundant places. [2022-11-16 11:05:46,798 INFO L231 Difference]: Finished difference. Result has 397 places, 378 transitions, 1050 flow [2022-11-16 11:05:46,799 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1050, PETRI_PLACES=397, PETRI_TRANSITIONS=378} [2022-11-16 11:05:46,800 INFO L288 CegarLoopForPetriNet]: 346 programPoint places, 51 predicate places. [2022-11-16 11:05:46,800 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 378 transitions, 1050 flow [2022-11-16 11:05:46,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 332.2) internal successors, (1661), 5 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states 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:05:46,801 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:05:46,801 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:46,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 11:05:47,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc8f0c3-5126-4856-a1d8-dc764ffdeb2b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-16 11:05:47,006 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-16 11:05:47,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:47,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1922870811, now seen corresponding path program 1 times [2022-11-16 11:05:47,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:05:47,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934369160] [2022-11-16 11:05:47,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:47,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:05:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-16 11:05:47,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:05:47,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934369160] [2022-11-16 11:05:47,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934369160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:47,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:47,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:05:47,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792689303] [2022-11-16 11:05:47,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:47,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:05:47,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:05:47,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:05:47,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:05:47,388 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 402 [2022-11-16 11:05:47,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 378 transitions, 1050 flow. Second operand has 11 states, 11 states have (on average 287.3636363636364) internal successors, (3161), 11 states have internal predecessors, (3161), 0 states have call successors, (0), 0 states 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:05:47,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:05:47,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 402 [2022-11-16 11:05:47,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand