./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/array-tiling/mbpr4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a 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_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-tiling/mbpr4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d3770c63a87ff983494c9353997301d9eb30588c650f83b67bcf55f325443055 --- 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-38b53e6 [2022-11-25 23:56:04,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:56:04,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:56:04,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:56:04,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:56:04,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:56:04,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:56:04,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:56:04,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:56:04,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:56:04,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:56:04,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:56:04,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:56:04,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:56:04,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:56:04,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:56:04,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:56:04,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:56:04,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:56:04,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:56:04,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:56:04,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:56:04,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:56:04,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:56:04,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:56:04,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:56:04,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:56:04,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:56:04,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:56:04,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:56:04,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:56:04,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:56:04,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:56:04,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:56:04,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:56:04,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:56:04,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:56:04,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:56:04,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:56:04,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:56:04,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:56:04,873 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-25 23:56:04,905 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:56:04,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:56:04,913 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:56:04,913 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:56:04,914 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:56:04,914 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:56:04,915 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:56:04,915 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:56:04,915 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:56:04,915 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:56:04,916 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:56:04,917 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:56:04,917 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:56:04,917 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:56:04,917 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:56:04,918 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:56:04,918 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:56:04,918 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:56:04,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:56:04,919 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:56:04,920 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:56:04,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:56:04,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:56:04,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:56:04,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:56:04,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:56:04,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:56:04,921 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 23:56:04,921 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:56:04,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:56:04,922 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:56:04,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:56:04,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:56:04,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:56:04,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:56:04,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:56:04,924 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:56:04,924 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:56:04,924 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:56:04,925 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:56:04,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:56:04,925 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:56:04,925 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:56:04,925 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_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/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_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur 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 -> Taipan 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 -> d3770c63a87ff983494c9353997301d9eb30588c650f83b67bcf55f325443055 [2022-11-25 23:56:05,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:56:05,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:56:05,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:56:05,258 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:56:05,258 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:56:05,259 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/array-tiling/mbpr4.c [2022-11-25 23:56:08,320 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:56:08,520 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:56:08,521 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/sv-benchmarks/c/array-tiling/mbpr4.c [2022-11-25 23:56:08,527 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/data/1294048c9/644f8a0045a24644985a6c7ae514b778/FLAGc3a564cd1 [2022-11-25 23:56:08,542 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/data/1294048c9/644f8a0045a24644985a6c7ae514b778 [2022-11-25 23:56:08,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:56:08,551 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:56:08,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:56:08,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:56:08,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:56:08,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:56:08" (1/1) ... [2022-11-25 23:56:08,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dd96f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:56:08, skipping insertion in model container [2022-11-25 23:56:08,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:56:08" (1/1) ... [2022-11-25 23:56:08,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:56:08,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:56:08,800 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/sv-benchmarks/c/array-tiling/mbpr4.c[396,409] [2022-11-25 23:56:08,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:56:08,849 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:56:08,861 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/sv-benchmarks/c/array-tiling/mbpr4.c[396,409] [2022-11-25 23:56:08,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:56:08,913 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:56:08,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:56:08 WrapperNode [2022-11-25 23:56:08,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:56:08,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:56:08,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:56:08,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:56:08,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:56:08" (1/1) ... [2022-11-25 23:56:08,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:56:08" (1/1) ... [2022-11-25 23:56:08,969 INFO L138 Inliner]: procedures = 15, calls = 54, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 291 [2022-11-25 23:56:08,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:56:08,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:56:08,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:56:08,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:56:08,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:56:08" (1/1) ... [2022-11-25 23:56:08,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:56:08" (1/1) ... [2022-11-25 23:56:08,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:56:08" (1/1) ... [2022-11-25 23:56:08,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:56:08" (1/1) ... [2022-11-25 23:56:09,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:56:08" (1/1) ... [2022-11-25 23:56:09,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:56:08" (1/1) ... [2022-11-25 23:56:09,018 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:56:08" (1/1) ... [2022-11-25 23:56:09,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:56:08" (1/1) ... [2022-11-25 23:56:09,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:56:09,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:56:09,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:56:09,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:56:09,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:56:08" (1/1) ... [2022-11-25 23:56:09,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:56:09,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:56:09,072 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:56:09,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:56:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:56:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:56:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:56:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:56:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:56:09,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:56:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:56:09,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:56:09,233 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:56:09,235 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:56:10,018 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:56:10,101 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:56:10,102 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-25 23:56:10,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:56:10 BoogieIcfgContainer [2022-11-25 23:56:10,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:56:10,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:56:10,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:56:10,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:56:10,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:56:08" (1/3) ... [2022-11-25 23:56:10,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1898c2c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:56:10, skipping insertion in model container [2022-11-25 23:56:10,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:56:08" (2/3) ... [2022-11-25 23:56:10,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1898c2c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:56:10, skipping insertion in model container [2022-11-25 23:56:10,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:56:10" (3/3) ... [2022-11-25 23:56:10,116 INFO L112 eAbstractionObserver]: Analyzing ICFG mbpr4.c [2022-11-25 23:56:10,134 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:56:10,135 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 146 error locations. [2022-11-25 23:56:10,194 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:56:10,201 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=FINITE_AUTOMATA, 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;@399336e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:56:10,201 INFO L358 AbstractCegarLoop]: Starting to check reachability of 146 error locations. [2022-11-25 23:56:10,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 311 states, 164 states have (on average 1.9817073170731707) internal successors, (325), 310 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:56:10,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:10,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:56:10,221 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:56:10,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:10,227 INFO L85 PathProgramCache]: Analyzing trace with hash 13781815, now seen corresponding path program 1 times [2022-11-25 23:56:10,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:10,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163735090] [2022-11-25 23:56:10,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:10,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:10,663 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-25 23:56:10,664 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:10,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163735090] [2022-11-25 23:56:10,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163735090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:56:10,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:56:10,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:56:10,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990737408] [2022-11-25 23:56:10,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:56:10,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:56:10,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:10,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:56:10,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:56:10,703 INFO L87 Difference]: Start difference. First operand has 311 states, 164 states have (on average 1.9817073170731707) internal successors, (325), 310 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:10,852 INFO L93 Difference]: Finished difference Result 547 states and 571 transitions. [2022-11-25 23:56:10,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:56:10,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 23:56:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:10,868 INFO L225 Difference]: With dead ends: 547 [2022-11-25 23:56:10,870 INFO L226 Difference]: Without dead ends: 304 [2022-11-25 23:56:10,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:56:10,877 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 314 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:10,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 290 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:56:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-25 23:56:10,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2022-11-25 23:56:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 162 states have (on average 1.9259259259259258) internal successors, (312), 303 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 312 transitions. [2022-11-25 23:56:10,944 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 312 transitions. Word has length 4 [2022-11-25 23:56:10,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:10,945 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 312 transitions. [2022-11-25 23:56:10,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 312 transitions. [2022-11-25 23:56:10,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:56:10,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:10,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:56:10,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:56:10,947 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:56:10,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:10,948 INFO L85 PathProgramCache]: Analyzing trace with hash 427236319, now seen corresponding path program 1 times [2022-11-25 23:56:10,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:10,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254679041] [2022-11-25 23:56:10,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:10,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:11,212 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-25 23:56:11,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:11,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254679041] [2022-11-25 23:56:11,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254679041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:56:11,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:56:11,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:56:11,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896989440] [2022-11-25 23:56:11,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:56:11,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:56:11,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:11,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:56:11,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:56:11,218 INFO L87 Difference]: Start difference. First operand 304 states and 312 transitions. Second operand has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:11,289 INFO L93 Difference]: Finished difference Result 304 states and 312 transitions. [2022-11-25 23:56:11,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:56:11,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 23:56:11,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:11,291 INFO L225 Difference]: With dead ends: 304 [2022-11-25 23:56:11,292 INFO L226 Difference]: Without dead ends: 300 [2022-11-25 23:56:11,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:56:11,294 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 609 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:11,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 284 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:56:11,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-11-25 23:56:11,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2022-11-25 23:56:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 162 states have (on average 1.9012345679012346) internal successors, (308), 299 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 308 transitions. [2022-11-25 23:56:11,311 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 308 transitions. Word has length 5 [2022-11-25 23:56:11,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:11,312 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 308 transitions. [2022-11-25 23:56:11,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 308 transitions. [2022-11-25 23:56:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:56:11,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:11,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:56:11,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:56:11,313 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:56:11,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1809139966, now seen corresponding path program 1 times [2022-11-25 23:56:11,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:11,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718018349] [2022-11-25 23:56:11,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:11,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:11,372 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-25 23:56:11,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:11,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718018349] [2022-11-25 23:56:11,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718018349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:56:11,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:56:11,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:56:11,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662036713] [2022-11-25 23:56:11,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:56:11,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:56:11,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:11,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:56:11,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:56:11,375 INFO L87 Difference]: Start difference. First operand 300 states and 308 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:12,006 INFO L93 Difference]: Finished difference Result 592 states and 608 transitions. [2022-11-25 23:56:12,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:56:12,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 23:56:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:12,009 INFO L225 Difference]: With dead ends: 592 [2022-11-25 23:56:12,009 INFO L226 Difference]: Without dead ends: 464 [2022-11-25 23:56:12,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:56:12,011 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 160 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:12,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 200 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:56:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-11-25 23:56:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 444. [2022-11-25 23:56:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 306 states have (on average 1.5032679738562091) internal successors, (460), 443 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 460 transitions. [2022-11-25 23:56:12,034 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 460 transitions. Word has length 8 [2022-11-25 23:56:12,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:12,035 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 460 transitions. [2022-11-25 23:56:12,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:12,035 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 460 transitions. [2022-11-25 23:56:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:56:12,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:12,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:56:12,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:56:12,037 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:56:12,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:12,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1023231597, now seen corresponding path program 1 times [2022-11-25 23:56:12,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:12,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466752601] [2022-11-25 23:56:12,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:12,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:12,201 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-25 23:56:12,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:12,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466752601] [2022-11-25 23:56:12,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466752601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:56:12,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:56:12,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:56:12,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641932028] [2022-11-25 23:56:12,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:56:12,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:56:12,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:12,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:56:12,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:56:12,205 INFO L87 Difference]: Start difference. First operand 444 states and 460 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:12,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:12,569 INFO L93 Difference]: Finished difference Result 449 states and 465 transitions. [2022-11-25 23:56:12,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:56:12,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:56:12,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:12,572 INFO L225 Difference]: With dead ends: 449 [2022-11-25 23:56:12,572 INFO L226 Difference]: Without dead ends: 447 [2022-11-25 23:56:12,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:56:12,574 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 3 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:12,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 627 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:56:12,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-11-25 23:56:12,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2022-11-25 23:56:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 309 states have (on average 1.4983818770226538) internal successors, (463), 446 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 463 transitions. [2022-11-25 23:56:12,593 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 463 transitions. Word has length 21 [2022-11-25 23:56:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:12,594 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 463 transitions. [2022-11-25 23:56:12,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 463 transitions. [2022-11-25 23:56:12,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 23:56:12,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:12,596 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:56:12,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:56:12,596 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:56:12,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:12,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1710049328, now seen corresponding path program 1 times [2022-11-25 23:56:12,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:12,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760737981] [2022-11-25 23:56:12,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:12,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:12,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:56:12,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:12,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760737981] [2022-11-25 23:56:12,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760737981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:56:12,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:56:12,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:56:12,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214584035] [2022-11-25 23:56:12,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:56:12,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:56:12,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:12,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:56:12,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:56:12,925 INFO L87 Difference]: Start difference. First operand 447 states and 463 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:13,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:13,531 INFO L93 Difference]: Finished difference Result 799 states and 827 transitions. [2022-11-25 23:56:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:56:13,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 23:56:13,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:13,534 INFO L225 Difference]: With dead ends: 799 [2022-11-25 23:56:13,534 INFO L226 Difference]: Without dead ends: 463 [2022-11-25 23:56:13,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:56:13,536 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 613 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:13,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 184 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:56:13,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-11-25 23:56:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 447. [2022-11-25 23:56:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 309 states have (on average 1.4854368932038835) internal successors, (459), 446 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 459 transitions. [2022-11-25 23:56:13,577 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 459 transitions. Word has length 24 [2022-11-25 23:56:13,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:13,578 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 459 transitions. [2022-11-25 23:56:13,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:13,578 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 459 transitions. [2022-11-25 23:56:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 23:56:13,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:13,580 INFO L195 NwaCegarLoop]: 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] [2022-11-25 23:56:13,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:56:13,581 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:56:13,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:13,582 INFO L85 PathProgramCache]: Analyzing trace with hash 428372734, now seen corresponding path program 1 times [2022-11-25 23:56:13,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:13,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379140659] [2022-11-25 23:56:13,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:13,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:13,678 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-25 23:56:13,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:13,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379140659] [2022-11-25 23:56:13,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379140659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:56:13,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:56:13,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:56:13,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534915281] [2022-11-25 23:56:13,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:56:13,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:56:13,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:13,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:56:13,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:56:13,683 INFO L87 Difference]: Start difference. First operand 447 states and 459 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:14,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:14,183 INFO L93 Difference]: Finished difference Result 463 states and 475 transitions. [2022-11-25 23:56:14,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:56:14,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-25 23:56:14,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:14,186 INFO L225 Difference]: With dead ends: 463 [2022-11-25 23:56:14,186 INFO L226 Difference]: Without dead ends: 461 [2022-11-25 23:56:14,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:56:14,187 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 128 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:14,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 371 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:56:14,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-11-25 23:56:14,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 449. [2022-11-25 23:56:14,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 311 states have (on average 1.482315112540193) internal successors, (461), 448 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 461 transitions. [2022-11-25 23:56:14,205 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 461 transitions. Word has length 36 [2022-11-25 23:56:14,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:14,205 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 461 transitions. [2022-11-25 23:56:14,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 461 transitions. [2022-11-25 23:56:14,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 23:56:14,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:14,213 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:56:14,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:56:14,214 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:56:14,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:14,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1079103534, now seen corresponding path program 1 times [2022-11-25 23:56:14,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:14,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500020661] [2022-11-25 23:56:14,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:14,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:14,345 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-25 23:56:14,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:14,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500020661] [2022-11-25 23:56:14,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500020661] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:56:14,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715633641] [2022-11-25 23:56:14,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:14,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:56:14,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:56:14,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:56:14,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:56:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:14,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:56:14,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:56:14,586 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-25 23:56:14,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:56:14,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715633641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:56:14,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:56:14,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-25 23:56:14,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699163821] [2022-11-25 23:56:14,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:56:14,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:56:14,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:14,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:56:14,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:56:14,589 INFO L87 Difference]: Start difference. First operand 449 states and 461 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:15,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:15,208 INFO L93 Difference]: Finished difference Result 461 states and 473 transitions. [2022-11-25 23:56:15,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:56:15,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-25 23:56:15,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:15,211 INFO L225 Difference]: With dead ends: 461 [2022-11-25 23:56:15,211 INFO L226 Difference]: Without dead ends: 444 [2022-11-25 23:56:15,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:56:15,212 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 198 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:15,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 329 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:56:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-11-25 23:56:15,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 432. [2022-11-25 23:56:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 311 states have (on average 1.427652733118971) internal successors, (444), 431 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 444 transitions. [2022-11-25 23:56:15,226 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 444 transitions. Word has length 42 [2022-11-25 23:56:15,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:15,228 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 444 transitions. [2022-11-25 23:56:15,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:15,228 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 444 transitions. [2022-11-25 23:56:15,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 23:56:15,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:15,230 INFO L195 NwaCegarLoop]: trace histogram [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-25 23:56:15,241 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 23:56:15,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-25 23:56:15,436 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:56:15,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:15,437 INFO L85 PathProgramCache]: Analyzing trace with hash 907528880, now seen corresponding path program 1 times [2022-11-25 23:56:15,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:15,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069380457] [2022-11-25 23:56:15,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:15,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:56:15,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:15,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069380457] [2022-11-25 23:56:15,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069380457] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:56:15,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392222712] [2022-11-25 23:56:15,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:15,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:56:15,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:56:15,554 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:56:15,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:56:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:15,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:56:15,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:56:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:56:15,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:56:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:56:15,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392222712] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:56:15,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [88626279] [2022-11-25 23:56:15,823 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-25 23:56:15,823 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:56:15,826 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:56:15,831 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:56:15,832 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:56:15,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:15,964 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:56:15,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-25 23:56:15,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:15,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-25 23:56:16,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:16,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-25 23:56:16,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:16,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-25 23:56:16,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:16,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-25 23:56:16,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:16,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-25 23:56:17,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,320 INFO L321 Elim1Store]: treesize reduction 96, result has 13.5 percent of original size [2022-11-25 23:56:17,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 43 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 12 case distinctions, treesize of input 569 treesize of output 558 [2022-11-25 23:56:17,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:17,960 INFO L321 Elim1Store]: treesize reduction 113, result has 5.8 percent of original size [2022-11-25 23:56:17,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 52 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 590 treesize of output 573 [2022-11-25 23:56:18,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:18,540 INFO L321 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2022-11-25 23:56:18,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 53 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 30 case distinctions, treesize of input 590 treesize of output 573 [2022-11-25 23:56:19,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:19,082 INFO L321 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2022-11-25 23:56:19,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 53 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 30 case distinctions, treesize of input 590 treesize of output 573 [2022-11-25 23:56:19,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:56:19,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:19,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:19,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:19,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:56:20,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:20,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:20,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:20,404 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:56:22,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [88626279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:56:22,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:56:22,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 4, 4] total 16 [2022-11-25 23:56:22,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034946660] [2022-11-25 23:56:22,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:56:22,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:56:22,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:22,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:56:22,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:56:22,068 INFO L87 Difference]: Start difference. First operand 432 states and 444 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:24,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:24,713 INFO L93 Difference]: Finished difference Result 796 states and 834 transitions. [2022-11-25 23:56:24,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:56:24,714 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-25 23:56:24,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:24,716 INFO L225 Difference]: With dead ends: 796 [2022-11-25 23:56:24,716 INFO L226 Difference]: Without dead ends: 375 [2022-11-25 23:56:24,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 106 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:56:24,718 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 592 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:24,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 170 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 23:56:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-11-25 23:56:24,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 340. [2022-11-25 23:56:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 248 states have (on average 1.3870967741935485) internal successors, (344), 339 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 344 transitions. [2022-11-25 23:56:24,746 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 344 transitions. Word has length 43 [2022-11-25 23:56:24,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:24,746 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 344 transitions. [2022-11-25 23:56:24,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:24,746 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 344 transitions. [2022-11-25 23:56:24,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-25 23:56:24,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:24,748 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:56:24,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:56:24,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:56:24,954 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:56:24,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:24,954 INFO L85 PathProgramCache]: Analyzing trace with hash 947001044, now seen corresponding path program 1 times [2022-11-25 23:56:24,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:24,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717006732] [2022-11-25 23:56:24,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:24,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:56:25,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:25,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717006732] [2022-11-25 23:56:25,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717006732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:56:25,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:56:25,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:56:25,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761525110] [2022-11-25 23:56:25,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:56:25,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:56:25,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:25,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:56:25,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:56:25,160 INFO L87 Difference]: Start difference. First operand 340 states and 344 transitions. Second operand has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:25,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:25,607 INFO L93 Difference]: Finished difference Result 383 states and 387 transitions. [2022-11-25 23:56:25,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:56:25,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-11-25 23:56:25,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:25,613 INFO L225 Difference]: With dead ends: 383 [2022-11-25 23:56:25,613 INFO L226 Difference]: Without dead ends: 381 [2022-11-25 23:56:25,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:56:25,614 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 106 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:25,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 265 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:56:25,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-11-25 23:56:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 342. [2022-11-25 23:56:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 250 states have (on average 1.384) internal successors, (346), 341 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:25,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 346 transitions. [2022-11-25 23:56:25,632 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 346 transitions. Word has length 74 [2022-11-25 23:56:25,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:25,632 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 346 transitions. [2022-11-25 23:56:25,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:25,633 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 346 transitions. [2022-11-25 23:56:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-25 23:56:25,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:25,634 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:56:25,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:56:25,635 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:56:25,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:25,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1103061592, now seen corresponding path program 1 times [2022-11-25 23:56:25,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:25,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86428325] [2022-11-25 23:56:25,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:25,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:56:25,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:25,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86428325] [2022-11-25 23:56:25,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86428325] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:56:25,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737861227] [2022-11-25 23:56:25,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:25,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:56:25,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:56:25,819 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:56:25,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:56:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:25,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:56:25,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:56:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:56:26,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:56:26,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737861227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:56:26,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:56:26,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-25 23:56:26,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542251628] [2022-11-25 23:56:26,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:56:26,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:56:26,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:26,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:56:26,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:56:26,021 INFO L87 Difference]: Start difference. First operand 342 states and 346 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:26,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:26,503 INFO L93 Difference]: Finished difference Result 381 states and 385 transitions. [2022-11-25 23:56:26,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:56:26,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-25 23:56:26,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:26,505 INFO L225 Difference]: With dead ends: 381 [2022-11-25 23:56:26,505 INFO L226 Difference]: Without dead ends: 366 [2022-11-25 23:56:26,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:56:26,506 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 167 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:26,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 224 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:56:26,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-11-25 23:56:26,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 327. [2022-11-25 23:56:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 250 states have (on average 1.324) internal successors, (331), 326 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 331 transitions. [2022-11-25 23:56:26,520 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 331 transitions. Word has length 80 [2022-11-25 23:56:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:26,520 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 331 transitions. [2022-11-25 23:56:26,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 331 transitions. [2022-11-25 23:56:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 23:56:26,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:26,521 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:56:26,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:56:26,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:56:26,727 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:56:26,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash 164829174, now seen corresponding path program 1 times [2022-11-25 23:56:26,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:26,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144991033] [2022-11-25 23:56:26,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:26,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:26,862 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:56:26,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:26,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144991033] [2022-11-25 23:56:26,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144991033] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:56:26,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369960769] [2022-11-25 23:56:26,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:26,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:56:26,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:56:26,864 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:56:26,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:56:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:26,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:56:26,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:56:27,025 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:56:27,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:56:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:56:27,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369960769] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:56:27,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1654746371] [2022-11-25 23:56:27,111 INFO L159 IcfgInterpreter]: Started Sifa with 73 locations of interest [2022-11-25 23:56:27,111 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:56:27,111 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:56:27,112 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:56:27,112 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:56:27,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:27,189 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:56:27,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-25 23:56:27,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:27,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-25 23:56:27,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:27,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-25 23:56:27,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:27,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-25 23:56:27,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:27,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-25 23:56:27,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:27,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-25 23:56:28,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:28,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:28,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:28,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:28,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:28,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:28,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:28,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:56:28,196 INFO L321 Elim1Store]: treesize reduction 94, result has 23.0 percent of original size [2022-11-25 23:56:28,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 13 case distinctions, treesize of input 490 treesize of output 485 [2022-11-25 23:56:29,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:29,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:29,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:29,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:29,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:29,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:29,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:29,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:29,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:29,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:29,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:29,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:29,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:29,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:29,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:29,135 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:56:29,161 INFO L321 Elim1Store]: treesize reduction 107, result has 6.1 percent of original size [2022-11-25 23:56:29,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 44 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 32 case distinctions, treesize of input 983 treesize of output 886 [2022-11-25 23:56:30,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,037 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:56:30,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,060 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-25 23:56:30,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 983 treesize of output 886 [2022-11-25 23:56:30,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:56:30,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:30,904 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-25 23:56:30,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 983 treesize of output 886 [2022-11-25 23:56:31,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:56:31,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:31,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:31,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:31,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:56:31,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:31,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:31,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:31,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:56:31,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:31,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:31,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:31,896 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 23:56:31,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 217 treesize of output 222 [2022-11-25 23:56:32,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:32,032 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 23:56:32,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 237 [2022-11-25 23:56:32,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:32,209 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 23:56:32,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 237 [2022-11-25 23:56:32,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:32,344 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 23:56:32,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 237 [2022-11-25 23:56:32,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:56:32,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:32,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:32,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:32,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:56:32,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:32,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:32,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:32,856 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:56:36,304 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10709#(and (= |ULTIMATE.start_main_~CCCELVOL3~0#1| 7) (= |ULTIMATE.start_main_~CCCELVOL4~0#1| 5) (= 2 |ULTIMATE.start_main_~MINVAL~0#1|) (<= ~CELLCOUNT~0 2147483647) (= |ULTIMATE.start_main_~CCCELVOL1~0#1| 1) (<= 1 ~CELLCOUNT~0) (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start_main_~CCCELVOL2~0#1| 3) (not (<= (* |ULTIMATE.start_main_~i~0#1| 4) 2147483647)) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#volArray~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-25 23:56:36,304 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:56:36,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:56:36,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-11-25 23:56:36,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143889761] [2022-11-25 23:56:36,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:56:36,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:56:36,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:36,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:56:36,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-11-25 23:56:36,307 INFO L87 Difference]: Start difference. First operand 327 states and 331 transitions. Second operand has 10 states, 9 states have (on average 17.22222222222222) internal successors, (155), 10 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:36,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:36,963 INFO L93 Difference]: Finished difference Result 410 states and 430 transitions. [2022-11-25 23:56:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:56:36,964 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 17.22222222222222) internal successors, (155), 10 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-11-25 23:56:36,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:36,965 INFO L225 Difference]: With dead ends: 410 [2022-11-25 23:56:36,965 INFO L226 Difference]: Without dead ends: 369 [2022-11-25 23:56:36,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 186 SyntacticMatches, 38 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2022-11-25 23:56:36,966 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 363 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:36,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 164 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:56:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-11-25 23:56:36,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 326. [2022-11-25 23:56:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 288 states have (on average 1.1527777777777777) internal successors, (332), 325 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 332 transitions. [2022-11-25 23:56:36,990 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 332 transitions. Word has length 81 [2022-11-25 23:56:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:36,990 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 332 transitions. [2022-11-25 23:56:36,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 17.22222222222222) internal successors, (155), 10 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:36,991 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 332 transitions. [2022-11-25 23:56:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-25 23:56:36,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:36,999 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:56:37,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-25 23:56:37,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 23:56:37,205 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:56:37,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:37,205 INFO L85 PathProgramCache]: Analyzing trace with hash -887138007, now seen corresponding path program 1 times [2022-11-25 23:56:37,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:37,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409294937] [2022-11-25 23:56:37,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:37,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:56:37,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:37,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409294937] [2022-11-25 23:56:37,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409294937] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:56:37,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:56:37,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:56:37,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796610132] [2022-11-25 23:56:37,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:56:37,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:56:37,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:37,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:56:37,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:56:37,345 INFO L87 Difference]: Start difference. First operand 326 states and 332 transitions. Second operand has 4 states, 3 states have (on average 36.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:37,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:37,719 INFO L93 Difference]: Finished difference Result 367 states and 373 transitions. [2022-11-25 23:56:37,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:56:37,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 36.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2022-11-25 23:56:37,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:37,721 INFO L225 Difference]: With dead ends: 367 [2022-11-25 23:56:37,721 INFO L226 Difference]: Without dead ends: 365 [2022-11-25 23:56:37,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:56:37,722 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 104 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:37,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 156 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:56:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-11-25 23:56:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 329. [2022-11-25 23:56:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 291 states have (on average 1.1512027491408934) internal successors, (335), 328 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 335 transitions. [2022-11-25 23:56:37,737 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 335 transitions. Word has length 112 [2022-11-25 23:56:37,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:37,737 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 335 transitions. [2022-11-25 23:56:37,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 36.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 335 transitions. [2022-11-25 23:56:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-25 23:56:37,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:37,739 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:56:37,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 23:56:37,740 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:56:37,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:37,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1763675837, now seen corresponding path program 1 times [2022-11-25 23:56:37,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:37,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447163208] [2022-11-25 23:56:37,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:37,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:56:37,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:37,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447163208] [2022-11-25 23:56:37,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447163208] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:56:37,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308638102] [2022-11-25 23:56:37,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:37,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:56:37,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:56:37,927 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:56:37,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:56:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:38,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:56:38,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:56:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:56:38,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:56:38,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308638102] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:56:38,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:56:38,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-25 23:56:38,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652762998] [2022-11-25 23:56:38,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:56:38,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:56:38,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:38,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:56:38,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:56:38,111 INFO L87 Difference]: Start difference. First operand 329 states and 335 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:38,537 INFO L93 Difference]: Finished difference Result 365 states and 371 transitions. [2022-11-25 23:56:38,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:56:38,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-11-25 23:56:38,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:38,539 INFO L225 Difference]: With dead ends: 365 [2022-11-25 23:56:38,539 INFO L226 Difference]: Without dead ends: 350 [2022-11-25 23:56:38,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:56:38,540 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 136 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:38,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 143 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:56:38,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-11-25 23:56:38,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 314. [2022-11-25 23:56:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 291 states have (on average 1.0996563573883162) internal successors, (320), 313 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 320 transitions. [2022-11-25 23:56:38,555 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 320 transitions. Word has length 118 [2022-11-25 23:56:38,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:38,555 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 320 transitions. [2022-11-25 23:56:38,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:38,556 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 320 transitions. [2022-11-25 23:56:38,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-25 23:56:38,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:38,557 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:56:38,567 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-25 23:56:38,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 23:56:38,762 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:56:38,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:38,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1160623651, now seen corresponding path program 1 times [2022-11-25 23:56:38,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:38,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155775883] [2022-11-25 23:56:38,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:38,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:56:38,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:38,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155775883] [2022-11-25 23:56:38,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155775883] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:56:38,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93468124] [2022-11-25 23:56:38,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:38,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:56:38,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:56:38,921 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:56:38,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:56:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:39,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:56:39,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:56:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:56:39,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:56:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:56:39,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93468124] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:56:39,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [446969143] [2022-11-25 23:56:39,177 INFO L159 IcfgInterpreter]: Started Sifa with 108 locations of interest [2022-11-25 23:56:39,177 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:56:39,178 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:56:39,178 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:56:39,178 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:56:39,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:39,314 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:56:39,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-25 23:56:39,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:39,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-25 23:56:39,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:39,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-25 23:56:39,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:39,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-25 23:56:39,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:39,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-25 23:56:39,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:39,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-25 23:56:40,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:56:40,056 INFO L321 Elim1Store]: treesize reduction 94, result has 23.0 percent of original size [2022-11-25 23:56:40,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 13 case distinctions, treesize of input 490 treesize of output 485 [2022-11-25 23:56:40,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:40,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:56:40,900 INFO L321 Elim1Store]: treesize reduction 107, result has 6.1 percent of original size [2022-11-25 23:56:40,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 44 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 32 case distinctions, treesize of input 983 treesize of output 886 [2022-11-25 23:56:41,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:41,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:41,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:41,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:41,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:41,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:41,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:41,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:41,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:41,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:56:41,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:41,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:41,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:41,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:41,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:41,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:41,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:41,545 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-25 23:56:41,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 983 treesize of output 886 [2022-11-25 23:56:42,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:42,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:42,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:42,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:42,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:42,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:42,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:42,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:42,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:42,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:42,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:42,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:42,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:42,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:42,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:42,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:42,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:56:42,165 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-25 23:56:42,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 983 treesize of output 886 [2022-11-25 23:56:42,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:56:42,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:42,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:42,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:42,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:56:42,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:42,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:42,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:42,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:56:42,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:42,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:42,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:42,982 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 23:56:42,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 217 treesize of output 222 [2022-11-25 23:56:43,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:43,158 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 23:56:43,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 435 treesize of output 428 [2022-11-25 23:56:43,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:43,318 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 23:56:43,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 435 treesize of output 428 [2022-11-25 23:56:43,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:43,465 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 23:56:43,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 435 treesize of output 428 [2022-11-25 23:56:43,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:56:43,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:43,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:43,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:43,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:56:43,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:43,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:43,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:44,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:56:44,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:44,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:44,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:56:44,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:44,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-11-25 23:56:44,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:56:44,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:56:44,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:56:44,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:56:44,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:56:44,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:56:44,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:56:44,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:56:44,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:56:44,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:56:44,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:56:45,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:56:45,119 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:56:49,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [446969143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:56:49,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:56:49,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [4, 4, 4] total 25 [2022-11-25 23:56:49,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217511299] [2022-11-25 23:56:49,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:56:49,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 23:56:49,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:49,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 23:56:49,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2022-11-25 23:56:49,864 INFO L87 Difference]: Start difference. First operand 314 states and 320 transitions. Second operand has 18 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:58,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:58,390 INFO L93 Difference]: Finished difference Result 350 states and 356 transitions. [2022-11-25 23:56:58,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 23:56:58,391 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-11-25 23:56:58,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:58,392 INFO L225 Difference]: With dead ends: 350 [2022-11-25 23:56:58,392 INFO L226 Difference]: Without dead ends: 346 [2022-11-25 23:56:58,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 265 SyntacticMatches, 70 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=349, Invalid=1457, Unknown=0, NotChecked=0, Total=1806 [2022-11-25 23:56:58,394 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 522 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:58,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 72 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-25 23:56:58,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-11-25 23:56:58,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 208. [2022-11-25 23:56:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 189 states have (on average 1.1216931216931216) internal successors, (212), 207 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 212 transitions. [2022-11-25 23:56:58,408 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 212 transitions. Word has length 119 [2022-11-25 23:56:58,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:58,408 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 212 transitions. [2022-11-25 23:56:58,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:58,408 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 212 transitions. [2022-11-25 23:56:58,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-11-25 23:56:58,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:58,410 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:56:58,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:56:58,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:56:58,617 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:56:58,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:58,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1827392149, now seen corresponding path program 1 times [2022-11-25 23:56:58,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:58,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403379719] [2022-11-25 23:56:58,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:58,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:56:58,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:58,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403379719] [2022-11-25 23:56:58,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403379719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:56:58,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:56:58,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:56:58,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496649554] [2022-11-25 23:56:58,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:56:58,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:56:58,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:58,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:56:58,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:56:58,820 INFO L87 Difference]: Start difference. First operand 208 states and 212 transitions. Second operand has 4 states, 3 states have (on average 48.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:59,146 INFO L93 Difference]: Finished difference Result 306 states and 310 transitions. [2022-11-25 23:56:59,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:56:59,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 48.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2022-11-25 23:56:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:59,148 INFO L225 Difference]: With dead ends: 306 [2022-11-25 23:56:59,148 INFO L226 Difference]: Without dead ends: 304 [2022-11-25 23:56:59,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:56:59,149 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 102 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:59,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 115 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:56:59,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-25 23:56:59,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 211. [2022-11-25 23:56:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 192 states have (on average 1.1197916666666667) internal successors, (215), 210 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 215 transitions. [2022-11-25 23:56:59,162 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 215 transitions. Word has length 150 [2022-11-25 23:56:59,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:59,162 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 215 transitions. [2022-11-25 23:56:59,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 48.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 215 transitions. [2022-11-25 23:56:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-25 23:56:59,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:59,165 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:56:59,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 23:56:59,165 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:56:59,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:59,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1969998529, now seen corresponding path program 1 times [2022-11-25 23:56:59,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:59,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422450776] [2022-11-25 23:56:59,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:59,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:56:59,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:59,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422450776] [2022-11-25 23:56:59,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422450776] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:56:59,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785859092] [2022-11-25 23:56:59,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:59,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:56:59,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:56:59,364 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:56:59,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:56:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:59,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:56:59,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:56:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:56:59,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:56:59,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785859092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:56:59,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:56:59,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-25 23:56:59,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56379851] [2022-11-25 23:56:59,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:56:59,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:56:59,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:59,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:56:59,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:56:59,576 INFO L87 Difference]: Start difference. First operand 211 states and 215 transitions. Second operand has 5 states, 4 states have (on average 37.5) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:57:00,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:57:00,001 INFO L93 Difference]: Finished difference Result 304 states and 308 transitions. [2022-11-25 23:57:00,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:57:00,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 37.5) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2022-11-25 23:57:00,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:57:00,003 INFO L225 Difference]: With dead ends: 304 [2022-11-25 23:57:00,003 INFO L226 Difference]: Without dead ends: 289 [2022-11-25 23:57:00,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:57:00,004 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 134 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:57:00,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 99 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:57:00,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-25 23:57:00,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 196. [2022-11-25 23:57:00,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 195 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:57:00,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 200 transitions. [2022-11-25 23:57:00,016 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 200 transitions. Word has length 156 [2022-11-25 23:57:00,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:57:00,016 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 200 transitions. [2022-11-25 23:57:00,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 37.5) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:57:00,017 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 200 transitions. [2022-11-25 23:57:00,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-25 23:57:00,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:57:00,018 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:57:00,029 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:57:00,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 23:57:00,225 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:57:00,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:57:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash -940411903, now seen corresponding path program 1 times [2022-11-25 23:57:00,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:57:00,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414858857] [2022-11-25 23:57:00,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:57:00,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:57:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:57:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:57:00,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:57:00,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414858857] [2022-11-25 23:57:00,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414858857] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:57:00,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201962736] [2022-11-25 23:57:00,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:57:00,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:57:00,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:57:00,400 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:57:00,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 23:57:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:57:00,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:57:00,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:57:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:57:00,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:57:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:57:00,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201962736] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:57:00,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1805191821] [2022-11-25 23:57:00,730 INFO L159 IcfgInterpreter]: Started Sifa with 143 locations of interest [2022-11-25 23:57:00,730 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:57:00,731 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:57:00,731 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:57:00,732 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:57:01,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:01,098 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:57:01,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-25 23:57:01,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:01,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-25 23:57:01,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:01,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-25 23:57:01,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:01,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-25 23:57:01,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:01,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-25 23:57:01,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:01,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-25 23:57:01,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:01,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:01,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:01,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:01,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:01,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:01,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:01,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:57:01,883 INFO L321 Elim1Store]: treesize reduction 94, result has 23.0 percent of original size [2022-11-25 23:57:01,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 13 case distinctions, treesize of input 490 treesize of output 485 [2022-11-25 23:57:02,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:02,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:02,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:02,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:02,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:02,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:02,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:02,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:02,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:02,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:02,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:02,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:02,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:02,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:02,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:02,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:57:02,521 INFO L321 Elim1Store]: treesize reduction 107, result has 6.1 percent of original size [2022-11-25 23:57:02,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 44 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 32 case distinctions, treesize of input 983 treesize of output 886 [2022-11-25 23:57:03,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,112 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:57:03,124 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-25 23:57:03,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 983 treesize of output 886 [2022-11-25 23:57:03,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:57:03,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:03,707 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-25 23:57:03,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 983 treesize of output 886 [2022-11-25 23:57:03,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:04,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:04,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:04,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:04,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:04,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:04,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:04,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:04,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:04,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:04,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:04,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:04,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 228 [2022-11-25 23:57:04,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 243 [2022-11-25 23:57:04,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 243 [2022-11-25 23:57:04,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 243 [2022-11-25 23:57:04,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:04,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:04,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:05,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:05,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:05,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:05,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:05,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:05,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:05,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:05,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:05,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:05,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:05,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-11-25 23:57:05,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:05,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:05,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:06,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:06,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:06,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:06,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:06,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:06,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:06,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:06,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:06,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:06,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:06,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:06,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:06,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:06,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-11-25 23:57:06,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:06,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:06,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2022-11-25 23:57:06,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:06,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:06,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2022-11-25 23:57:06,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:06,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:07,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:07,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:07,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:07,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:07,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:07,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:07,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:07,626 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:57:13,704 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '17110#(and (= |ULTIMATE.start_main_~CCCELVOL3~0#1| 7) (<= |ULTIMATE.start_main_~i~0#1| 536870912) (= |ULTIMATE.start_main_~CCCELVOL4~0#1| 5) (= 2 |ULTIMATE.start_main_~MINVAL~0#1|) (<= ~CELLCOUNT~0 2147483647) (= |ULTIMATE.start_main_~CCCELVOL1~0#1| 1) (<= 1 ~CELLCOUNT~0) (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start_main_~CCCELVOL2~0#1| 3) (not (<= (* |ULTIMATE.start_main_~i~0#1| 4) 2147483647)) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#volArray~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-25 23:57:13,705 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:57:13,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:57:13,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-11-25 23:57:13,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011577560] [2022-11-25 23:57:13,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:57:13,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:57:13,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:57:13,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:57:13,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2022-11-25 23:57:13,707 INFO L87 Difference]: Start difference. First operand 196 states and 200 transitions. Second operand has 10 states, 9 states have (on average 25.22222222222222) internal successors, (227), 10 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:57:14,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:57:14,287 INFO L93 Difference]: Finished difference Result 333 states and 340 transitions. [2022-11-25 23:57:14,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:57:14,288 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 25.22222222222222) internal successors, (227), 10 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-11-25 23:57:14,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:57:14,290 INFO L225 Difference]: With dead ends: 333 [2022-11-25 23:57:14,290 INFO L226 Difference]: Without dead ends: 331 [2022-11-25 23:57:14,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 342 SyntacticMatches, 106 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2168 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2022-11-25 23:57:14,291 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 245 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:57:14,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 202 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:57:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-11-25 23:57:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 236. [2022-11-25 23:57:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 232 states have (on average 1.043103448275862) internal successors, (242), 235 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:57:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 242 transitions. [2022-11-25 23:57:14,306 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 242 transitions. Word has length 157 [2022-11-25 23:57:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:57:14,306 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 242 transitions. [2022-11-25 23:57:14,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 25.22222222222222) internal successors, (227), 10 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:57:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 242 transitions. [2022-11-25 23:57:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-11-25 23:57:14,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:57:14,308 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:57:14,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 23:57:14,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 23:57:14,519 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:57:14,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:57:14,520 INFO L85 PathProgramCache]: Analyzing trace with hash 522409209, now seen corresponding path program 1 times [2022-11-25 23:57:14,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:57:14,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688738849] [2022-11-25 23:57:14,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:57:14,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:57:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:57:14,782 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 23:57:14,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:57:14,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688738849] [2022-11-25 23:57:14,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688738849] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:57:14,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869104625] [2022-11-25 23:57:14,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:57:14,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:57:14,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:57:14,785 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:57:14,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 23:57:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:57:14,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:57:14,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:57:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 23:57:14,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:57:14,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869104625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:57:14,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:57:14,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-25 23:57:14,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234701686] [2022-11-25 23:57:14,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:57:14,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:57:14,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:57:14,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:57:14,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:57:14,954 INFO L87 Difference]: Start difference. First operand 236 states and 242 transitions. Second operand has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:57:15,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:57:15,296 INFO L93 Difference]: Finished difference Result 329 states and 335 transitions. [2022-11-25 23:57:15,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:57:15,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-11-25 23:57:15,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:57:15,298 INFO L225 Difference]: With dead ends: 329 [2022-11-25 23:57:15,298 INFO L226 Difference]: Without dead ends: 328 [2022-11-25 23:57:15,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:57:15,299 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 272 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:57:15,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 110 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:57:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-11-25 23:57:15,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 235. [2022-11-25 23:57:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 232 states have (on average 1.0387931034482758) internal successors, (241), 234 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:57:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 241 transitions. [2022-11-25 23:57:15,314 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 241 transitions. Word has length 160 [2022-11-25 23:57:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:57:15,314 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 241 transitions. [2022-11-25 23:57:15,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:57:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 241 transitions. [2022-11-25 23:57:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-25 23:57:15,316 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:57:15,317 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:57:15,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 23:57:15,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 23:57:15,523 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2022-11-25 23:57:15,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:57:15,523 INFO L85 PathProgramCache]: Analyzing trace with hash -985183260, now seen corresponding path program 1 times [2022-11-25 23:57:15,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:57:15,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706075225] [2022-11-25 23:57:15,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:57:15,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:57:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:57:15,760 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 23:57:15,761 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:57:15,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706075225] [2022-11-25 23:57:15,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706075225] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:57:15,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650190758] [2022-11-25 23:57:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:57:15,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:57:15,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:57:15,763 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:57:15,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 23:57:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:57:15,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:57:15,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:57:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 23:57:15,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:57:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 23:57:15,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650190758] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:57:15,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1480388873] [2022-11-25 23:57:15,988 INFO L159 IcfgInterpreter]: Started Sifa with 147 locations of interest [2022-11-25 23:57:15,989 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:57:15,989 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:57:15,989 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:57:15,990 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:57:16,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:16,409 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:57:16,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-25 23:57:16,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:16,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-25 23:57:16,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:16,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-25 23:57:16,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:16,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-25 23:57:16,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:16,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-25 23:57:16,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:16,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 128 [2022-11-25 23:57:17,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:57:17,193 INFO L321 Elim1Store]: treesize reduction 94, result has 23.0 percent of original size [2022-11-25 23:57:17,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 13 case distinctions, treesize of input 490 treesize of output 485 [2022-11-25 23:57:17,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:57:17,518 INFO L321 Elim1Store]: treesize reduction 107, result has 6.1 percent of original size [2022-11-25 23:57:17,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 44 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 32 case distinctions, treesize of input 517 treesize of output 500 [2022-11-25 23:57:17,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:57:17,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:17,833 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-25 23:57:17,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 517 treesize of output 500 [2022-11-25 23:57:18,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:18,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:18,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:18,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:18,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:18,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:18,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:18,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:18,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:18,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:57:18,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:18,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:18,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:18,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:18,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:18,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:18,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:18,277 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-25 23:57:18,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 31 case distinctions, treesize of input 517 treesize of output 500 [2022-11-25 23:57:18,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:18,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:18,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:18,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:18,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:18,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:18,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:18,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:18,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:18,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:18,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:18,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:18,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 228 [2022-11-25 23:57:18,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 243 [2022-11-25 23:57:19,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 243 [2022-11-25 23:57:19,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 243 [2022-11-25 23:57:19,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:19,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:19,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:19,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:19,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:19,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:19,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:19,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:19,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:20,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:20,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:20,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:20,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:20,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-11-25 23:57:20,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:20,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:20,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:20,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:20,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:20,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:20,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:20,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:20,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:20,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:20,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:20,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:20,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:20,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:21,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:21,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:21,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-11-25 23:57:21,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:21,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:21,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2022-11-25 23:57:21,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:21,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:21,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2022-11-25 23:57:21,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:21,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:21,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:21,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:21,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:57:21,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:21,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:21,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:57:22,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:57:22,213 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:57:28,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1480388873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:57:28,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:57:28,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [5, 5, 5] total 29 [2022-11-25 23:57:28,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773570511] [2022-11-25 23:57:28,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:57:28,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 23:57:28,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:57:28,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 23:57:28,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:57:28,667 INFO L87 Difference]: Start difference. First operand 235 states and 241 transitions. Second operand has 20 states, 19 states have (on average 7.947368421052632) internal successors, (151), 19 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:57:35,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:57:35,562 INFO L93 Difference]: Finished difference Result 235 states and 241 transitions. [2022-11-25 23:57:35,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 23:57:35,563 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 7.947368421052632) internal successors, (151), 19 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2022-11-25 23:57:35,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:57:35,563 INFO L225 Difference]: With dead ends: 235 [2022-11-25 23:57:35,563 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 23:57:35,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 351 SyntacticMatches, 107 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2650 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=388, Invalid=1682, Unknown=0, NotChecked=0, Total=2070 [2022-11-25 23:57:35,565 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 272 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:57:35,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 4 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-25 23:57:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 23:57:35,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 23:57:35,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:57:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 23:57:35,566 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2022-11-25 23:57:35,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:57:35,566 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 23:57:35,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 7.947368421052632) internal successors, (151), 19 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:57:35,566 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 23:57:35,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 23:57:35,569 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 146 remaining) [2022-11-25 23:57:35,569 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 146 remaining) [2022-11-25 23:57:35,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 146 remaining) [2022-11-25 23:57:35,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 146 remaining) [2022-11-25 23:57:35,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 146 remaining) [2022-11-25 23:57:35,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 146 remaining) [2022-11-25 23:57:35,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 146 remaining) [2022-11-25 23:57:35,571 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 146 remaining) [2022-11-25 23:57:35,571 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 146 remaining) [2022-11-25 23:57:35,571 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 146 remaining) [2022-11-25 23:57:35,571 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 146 remaining) [2022-11-25 23:57:35,571 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 146 remaining) [2022-11-25 23:57:35,571 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 146 remaining) [2022-11-25 23:57:35,571 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 146 remaining) [2022-11-25 23:57:35,572 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 146 remaining) [2022-11-25 23:57:35,572 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 146 remaining) [2022-11-25 23:57:35,572 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 146 remaining) [2022-11-25 23:57:35,572 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 146 remaining) [2022-11-25 23:57:35,572 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 146 remaining) [2022-11-25 23:57:35,572 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 146 remaining) [2022-11-25 23:57:35,572 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 146 remaining) [2022-11-25 23:57:35,572 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 146 remaining) [2022-11-25 23:57:35,573 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 146 remaining) [2022-11-25 23:57:35,573 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 146 remaining) [2022-11-25 23:57:35,573 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 146 remaining) [2022-11-25 23:57:35,573 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 146 remaining) [2022-11-25 23:57:35,573 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 146 remaining) [2022-11-25 23:57:35,573 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 146 remaining) [2022-11-25 23:57:35,574 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 146 remaining) [2022-11-25 23:57:35,574 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 146 remaining) [2022-11-25 23:57:35,574 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 146 remaining) [2022-11-25 23:57:35,574 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 146 remaining) [2022-11-25 23:57:35,574 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 146 remaining) [2022-11-25 23:57:35,574 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 146 remaining) [2022-11-25 23:57:35,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 146 remaining) [2022-11-25 23:57:35,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 146 remaining) [2022-11-25 23:57:35,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 146 remaining) [2022-11-25 23:57:35,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 146 remaining) [2022-11-25 23:57:35,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 146 remaining) [2022-11-25 23:57:35,576 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 146 remaining) [2022-11-25 23:57:35,576 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 146 remaining) [2022-11-25 23:57:35,576 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 146 remaining) [2022-11-25 23:57:35,576 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 146 remaining) [2022-11-25 23:57:35,576 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 146 remaining) [2022-11-25 23:57:35,576 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 146 remaining) [2022-11-25 23:57:35,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 146 remaining) [2022-11-25 23:57:35,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 146 remaining) [2022-11-25 23:57:35,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 146 remaining) [2022-11-25 23:57:35,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 146 remaining) [2022-11-25 23:57:35,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 146 remaining) [2022-11-25 23:57:35,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 146 remaining) [2022-11-25 23:57:35,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 146 remaining) [2022-11-25 23:57:35,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 146 remaining) [2022-11-25 23:57:35,578 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 146 remaining) [2022-11-25 23:57:35,578 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 146 remaining) [2022-11-25 23:57:35,578 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 146 remaining) [2022-11-25 23:57:35,578 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 146 remaining) [2022-11-25 23:57:35,578 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 146 remaining) [2022-11-25 23:57:35,578 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 146 remaining) [2022-11-25 23:57:35,578 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 146 remaining) [2022-11-25 23:57:35,578 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 146 remaining) [2022-11-25 23:57:35,578 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 146 remaining) [2022-11-25 23:57:35,579 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 146 remaining) [2022-11-25 23:57:35,579 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 146 remaining) [2022-11-25 23:57:35,579 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 146 remaining) [2022-11-25 23:57:35,579 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 146 remaining) [2022-11-25 23:57:35,579 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 146 remaining) [2022-11-25 23:57:35,579 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 146 remaining) [2022-11-25 23:57:35,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 146 remaining) [2022-11-25 23:57:35,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 146 remaining) [2022-11-25 23:57:35,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 146 remaining) [2022-11-25 23:57:35,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 146 remaining) [2022-11-25 23:57:35,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 146 remaining) [2022-11-25 23:57:35,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 146 remaining) [2022-11-25 23:57:35,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 146 remaining) [2022-11-25 23:57:35,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 146 remaining) [2022-11-25 23:57:35,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 146 remaining) [2022-11-25 23:57:35,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 146 remaining) [2022-11-25 23:57:35,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 146 remaining) [2022-11-25 23:57:35,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 146 remaining) [2022-11-25 23:57:35,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 146 remaining) [2022-11-25 23:57:35,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 146 remaining) [2022-11-25 23:57:35,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 146 remaining) [2022-11-25 23:57:35,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 146 remaining) [2022-11-25 23:57:35,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 146 remaining) [2022-11-25 23:57:35,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 146 remaining) [2022-11-25 23:57:35,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 146 remaining) [2022-11-25 23:57:35,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 146 remaining) [2022-11-25 23:57:35,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 146 remaining) [2022-11-25 23:57:35,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 146 remaining) [2022-11-25 23:57:35,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 146 remaining) [2022-11-25 23:57:35,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 146 remaining) [2022-11-25 23:57:35,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 146 remaining) [2022-11-25 23:57:35,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 146 remaining) [2022-11-25 23:57:35,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 146 remaining) [2022-11-25 23:57:35,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 146 remaining) [2022-11-25 23:57:35,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 146 remaining) [2022-11-25 23:57:35,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 146 remaining) [2022-11-25 23:57:35,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 146 remaining) [2022-11-25 23:57:35,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 146 remaining) [2022-11-25 23:57:35,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 146 remaining) [2022-11-25 23:57:35,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 146 remaining) [2022-11-25 23:57:35,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 146 remaining) [2022-11-25 23:57:35,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 146 remaining) [2022-11-25 23:57:35,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 146 remaining) [2022-11-25 23:57:35,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 146 remaining) [2022-11-25 23:57:35,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 146 remaining) [2022-11-25 23:57:35,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 146 remaining) [2022-11-25 23:57:35,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 146 remaining) [2022-11-25 23:57:35,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 146 remaining) [2022-11-25 23:57:35,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 146 remaining) [2022-11-25 23:57:35,586 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 146 remaining) [2022-11-25 23:57:35,586 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 146 remaining) [2022-11-25 23:57:35,586 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 146 remaining) [2022-11-25 23:57:35,586 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 146 remaining) [2022-11-25 23:57:35,586 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 146 remaining) [2022-11-25 23:57:35,586 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 146 remaining) [2022-11-25 23:57:35,586 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 146 remaining) [2022-11-25 23:57:35,586 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 146 remaining) [2022-11-25 23:57:35,586 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 146 remaining) [2022-11-25 23:57:35,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 146 remaining) [2022-11-25 23:57:35,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 146 remaining) [2022-11-25 23:57:35,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 146 remaining) [2022-11-25 23:57:35,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 146 remaining) [2022-11-25 23:57:35,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 146 remaining) [2022-11-25 23:57:35,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 146 remaining) [2022-11-25 23:57:35,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 146 remaining) [2022-11-25 23:57:35,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 146 remaining) [2022-11-25 23:57:35,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 146 remaining) [2022-11-25 23:57:35,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 146 remaining) [2022-11-25 23:57:35,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 146 remaining) [2022-11-25 23:57:35,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 146 remaining) [2022-11-25 23:57:35,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 146 remaining) [2022-11-25 23:57:35,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 146 remaining) [2022-11-25 23:57:35,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 146 remaining) [2022-11-25 23:57:35,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 146 remaining) [2022-11-25 23:57:35,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 146 remaining) [2022-11-25 23:57:35,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 146 remaining) [2022-11-25 23:57:35,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 146 remaining) [2022-11-25 23:57:35,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 146 remaining) [2022-11-25 23:57:35,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 146 remaining) [2022-11-25 23:57:35,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr141ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 146 remaining) [2022-11-25 23:57:35,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 146 remaining) [2022-11-25 23:57:35,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 146 remaining) [2022-11-25 23:57:35,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 146 remaining) [2022-11-25 23:57:35,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 146 remaining) [2022-11-25 23:57:35,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 23:57:35,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:57:35,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 23:57:39,299 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-25 23:57:39,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-25 23:57:39,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-25 23:57:39,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-11-25 23:57:39,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-25 23:57:39,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW(line 67) no Hoare annotation was computed. [2022-11-25 23:57:39,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-25 23:57:39,300 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2022-11-25 23:57:39,300 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2022-11-25 23:57:39,300 INFO L899 garLoopResultBuilder]: For program point L69-2(line 69) no Hoare annotation was computed. [2022-11-25 23:57:39,300 INFO L899 garLoopResultBuilder]: For program point L69-3(line 69) no Hoare annotation was computed. [2022-11-25 23:57:39,301 INFO L899 garLoopResultBuilder]: For program point L69-4(line 69) no Hoare annotation was computed. [2022-11-25 23:57:39,301 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2022-11-25 23:57:39,301 INFO L899 garLoopResultBuilder]: For program point L69-5(line 69) no Hoare annotation was computed. [2022-11-25 23:57:39,301 INFO L899 garLoopResultBuilder]: For program point L69-6(line 69) no Hoare annotation was computed. [2022-11-25 23:57:39,301 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-25 23:57:39,301 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2022-11-25 23:57:39,302 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2022-11-25 23:57:39,302 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-11-25 23:57:39,302 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2022-11-25 23:57:39,302 INFO L899 garLoopResultBuilder]: For program point L37-1(line 37) no Hoare annotation was computed. [2022-11-25 23:57:39,302 INFO L899 garLoopResultBuilder]: For program point L70-2(line 70) no Hoare annotation was computed. [2022-11-25 23:57:39,302 INFO L899 garLoopResultBuilder]: For program point L37-2(line 37) no Hoare annotation was computed. [2022-11-25 23:57:39,302 INFO L899 garLoopResultBuilder]: For program point L70-3(line 70) no Hoare annotation was computed. [2022-11-25 23:57:39,303 INFO L899 garLoopResultBuilder]: For program point L37-3(line 37) no Hoare annotation was computed. [2022-11-25 23:57:39,303 INFO L899 garLoopResultBuilder]: For program point L70-4(line 70) no Hoare annotation was computed. [2022-11-25 23:57:39,303 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-11-25 23:57:39,303 INFO L899 garLoopResultBuilder]: For program point L70-5(line 70) no Hoare annotation was computed. [2022-11-25 23:57:39,304 INFO L899 garLoopResultBuilder]: For program point L70-6(line 70) no Hoare annotation was computed. [2022-11-25 23:57:39,304 INFO L899 garLoopResultBuilder]: For program point L70-7(line 70) no Hoare annotation was computed. [2022-11-25 23:57:39,304 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW(line 74) no Hoare annotation was computed. [2022-11-25 23:57:39,304 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-25 23:57:39,304 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-25 23:57:39,304 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-11-25 23:57:39,305 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-11-25 23:57:39,305 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2022-11-25 23:57:39,305 INFO L899 garLoopResultBuilder]: For program point L71-2(line 71) no Hoare annotation was computed. [2022-11-25 23:57:39,305 INFO L899 garLoopResultBuilder]: For program point L71-3(line 71) no Hoare annotation was computed. [2022-11-25 23:57:39,305 INFO L899 garLoopResultBuilder]: For program point L71-4(line 71) no Hoare annotation was computed. [2022-11-25 23:57:39,305 INFO L899 garLoopResultBuilder]: For program point L71-5(line 71) no Hoare annotation was computed. [2022-11-25 23:57:39,305 INFO L899 garLoopResultBuilder]: For program point L71-6(line 71) no Hoare annotation was computed. [2022-11-25 23:57:39,305 INFO L899 garLoopResultBuilder]: For program point L71-7(line 71) no Hoare annotation was computed. [2022-11-25 23:57:39,305 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-25 23:57:39,305 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-11-25 23:57:39,306 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW(line 67) no Hoare annotation was computed. [2022-11-25 23:57:39,306 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-11-25 23:57:39,306 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2022-11-25 23:57:39,306 INFO L899 garLoopResultBuilder]: For program point L39-1(line 39) no Hoare annotation was computed. [2022-11-25 23:57:39,306 INFO L899 garLoopResultBuilder]: For program point L39-2(line 39) no Hoare annotation was computed. [2022-11-25 23:57:39,306 INFO L899 garLoopResultBuilder]: For program point L39-3(line 39) no Hoare annotation was computed. [2022-11-25 23:57:39,306 INFO L899 garLoopResultBuilder]: For program point L39-4(line 39) no Hoare annotation was computed. [2022-11-25 23:57:39,306 INFO L899 garLoopResultBuilder]: For program point L39-5(line 39) no Hoare annotation was computed. [2022-11-25 23:57:39,306 INFO L899 garLoopResultBuilder]: For program point L39-6(line 39) no Hoare annotation was computed. [2022-11-25 23:57:39,306 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW(line 52) no Hoare annotation was computed. [2022-11-25 23:57:39,307 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-11-25 23:57:39,307 INFO L899 garLoopResultBuilder]: For program point L40-1(line 40) no Hoare annotation was computed. [2022-11-25 23:57:39,307 INFO L899 garLoopResultBuilder]: For program point L40-2(line 40) no Hoare annotation was computed. [2022-11-25 23:57:39,307 INFO L899 garLoopResultBuilder]: For program point L40-3(line 40) no Hoare annotation was computed. [2022-11-25 23:57:39,307 INFO L899 garLoopResultBuilder]: For program point L40-4(line 40) no Hoare annotation was computed. [2022-11-25 23:57:39,307 INFO L899 garLoopResultBuilder]: For program point L40-5(line 40) no Hoare annotation was computed. [2022-11-25 23:57:39,307 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2022-11-25 23:57:39,307 INFO L899 garLoopResultBuilder]: For program point L40-6(line 40) no Hoare annotation was computed. [2022-11-25 23:57:39,307 INFO L899 garLoopResultBuilder]: For program point L40-7(line 40) no Hoare annotation was computed. [2022-11-25 23:57:39,307 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-25 23:57:39,307 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-11-25 23:57:39,307 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW(line 74) no Hoare annotation was computed. [2022-11-25 23:57:39,307 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-25 23:57:39,308 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-25 23:57:39,308 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-25 23:57:39,308 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-11-25 23:57:39,308 INFO L899 garLoopResultBuilder]: For program point L74-1(line 74) no Hoare annotation was computed. [2022-11-25 23:57:39,308 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2022-11-25 23:57:39,308 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 74 87) no Hoare annotation was computed. [2022-11-25 23:57:39,308 INFO L899 garLoopResultBuilder]: For program point L41-2(line 41) no Hoare annotation was computed. [2022-11-25 23:57:39,308 INFO L899 garLoopResultBuilder]: For program point L41-3(line 41) no Hoare annotation was computed. [2022-11-25 23:57:39,308 INFO L899 garLoopResultBuilder]: For program point L41-4(line 41) no Hoare annotation was computed. [2022-11-25 23:57:39,308 INFO L899 garLoopResultBuilder]: For program point L74-5(line 74) no Hoare annotation was computed. [2022-11-25 23:57:39,308 INFO L899 garLoopResultBuilder]: For program point L41-5(line 41) no Hoare annotation was computed. [2022-11-25 23:57:39,310 INFO L899 garLoopResultBuilder]: For program point L74-6(line 74) no Hoare annotation was computed. [2022-11-25 23:57:39,310 INFO L899 garLoopResultBuilder]: For program point L41-6(line 41) no Hoare annotation was computed. [2022-11-25 23:57:39,313 INFO L895 garLoopResultBuilder]: At program point L74-7(lines 74 87) the Hoare annotation is: (let ((.cse37 (select |#memory_int| 1)) (.cse36 (select |#memory_int| 2))) (let ((.cse0 (= 98 (select .cse36 1))) (.cse1 (= (select .cse36 7) 0)) (.cse2 (= (select .cse36 4) 52)) (.cse3 (= (select |#length| 3) 12)) (.cse4 (= |ULTIMATE.start_main_~CCCELVOL3~0#1| 7)) (.cse5 (= (* (mod ~CELLCOUNT~0 1073741824) 4) (select |#length| |ULTIMATE.start_main_~#volArray~0#1.base|))) (.cse6 (= (select |#valid| |ULTIMATE.start_main_~#volArray~0#1.base|) 1)) (.cse7 (<= 2 ~CELLCOUNT~0)) (.cse8 (= (select .cse36 6) 99)) (.cse9 (= |ULTIMATE.start_main_~CCCELVOL4~0#1| 5)) (.cse10 (= 2 (select |#length| 1))) (.cse11 (= (select |#valid| 3) 1)) (.cse12 (= 2 |ULTIMATE.start_main_~MINVAL~0#1|)) (.cse13 (<= ~CELLCOUNT~0 2147483647)) (.cse14 (= |ULTIMATE.start_main_~CCCELVOL1~0#1| 1)) (.cse15 (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0)) (.cse16 (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse17 (= 114 (select .cse36 3))) (.cse18 (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse19 (= (select |#valid| 1) 1)) (.cse20 (= |ULTIMATE.start_main_~CCCELVOL2~0#1| 3)) (.cse21 (= ~CELLCOUNT~0 (* (div ~CELLCOUNT~0 4) 4))) (.cse22 (= (select |#valid| 0) 0)) (.cse23 (= (select .cse36 5) 46)) (.cse24 (= (select |#valid| 2) 1)) (.cse25 (= |#NULL.offset| 0)) (.cse26 (= 8 (select |#length| 2))) (.cse27 (= (select .cse37 0) 48)) (.cse28 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse29 (= (select .cse36 0) 109)) (.cse30 (= (select .cse37 1) 0)) (.cse31 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse32 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse33 (< 0 |#StackHeapBarrier|)) (.cse34 (= 112 (select .cse36 2))) (.cse35 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_main_~i~0#1| 536870912) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~i~0#1| 1) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35)))) [2022-11-25 23:57:39,313 INFO L899 garLoopResultBuilder]: For program point L41-7(line 41) no Hoare annotation was computed. [2022-11-25 23:57:39,314 INFO L899 garLoopResultBuilder]: For program point L74-8(lines 74 87) no Hoare annotation was computed. [2022-11-25 23:57:39,314 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-25 23:57:39,314 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-25 23:57:39,314 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-25 23:57:39,314 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW(line 63) no Hoare annotation was computed. [2022-11-25 23:57:39,314 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-11-25 23:57:39,315 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-25 23:57:39,315 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-25 23:57:39,315 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-25 23:57:39,315 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-11-25 23:57:39,315 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 83) no Hoare annotation was computed. [2022-11-25 23:57:39,315 INFO L899 garLoopResultBuilder]: For program point L76-2(lines 76 83) no Hoare annotation was computed. [2022-11-25 23:57:39,316 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW(line 74) no Hoare annotation was computed. [2022-11-25 23:57:39,316 INFO L899 garLoopResultBuilder]: For program point L44-1(line 44) no Hoare annotation was computed. [2022-11-25 23:57:39,316 INFO L899 garLoopResultBuilder]: For program point L44-2(lines 44 57) no Hoare annotation was computed. [2022-11-25 23:57:39,316 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-25 23:57:39,316 INFO L899 garLoopResultBuilder]: For program point L44-5(line 44) no Hoare annotation was computed. [2022-11-25 23:57:39,316 INFO L899 garLoopResultBuilder]: For program point L44-6(line 44) no Hoare annotation was computed. [2022-11-25 23:57:39,317 INFO L895 garLoopResultBuilder]: At program point L44-7(lines 44 57) the Hoare annotation is: (let ((.cse36 (select |#memory_int| 1)) (.cse35 (select |#memory_int| 2))) (let ((.cse0 (= 98 (select .cse35 1))) (.cse1 (= (select .cse35 7) 0)) (.cse2 (= (select .cse35 4) 52)) (.cse3 (= (select |#length| 3) 12)) (.cse4 (= |ULTIMATE.start_main_~CCCELVOL3~0#1| 7)) (.cse5 (= (* (mod ~CELLCOUNT~0 1073741824) 4) (select |#length| |ULTIMATE.start_main_~#volArray~0#1.base|))) (.cse6 (= (select |#valid| |ULTIMATE.start_main_~#volArray~0#1.base|) 1)) (.cse7 (= (select .cse35 6) 99)) (.cse8 (= |ULTIMATE.start_main_~CCCELVOL4~0#1| 5)) (.cse9 (= 2 (select |#length| 1))) (.cse10 (= (select |#valid| 3) 1)) (.cse11 (= 2 |ULTIMATE.start_main_~MINVAL~0#1|)) (.cse12 (<= ~CELLCOUNT~0 2147483647)) (.cse13 (= |ULTIMATE.start_main_~CCCELVOL1~0#1| 1)) (.cse14 (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0)) (.cse15 (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse16 (= 114 (select .cse35 3))) (.cse17 (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse18 (= (select |#valid| 1) 1)) (.cse19 (= |ULTIMATE.start_main_~CCCELVOL2~0#1| 3)) (.cse20 (= ~CELLCOUNT~0 (* (div ~CELLCOUNT~0 4) 4))) (.cse21 (= (select |#valid| 0) 0)) (.cse22 (= (select .cse35 5) 46)) (.cse23 (= (select |#valid| 2) 1)) (.cse24 (= |#NULL.offset| 0)) (.cse25 (= 8 (select |#length| 2))) (.cse26 (= (select .cse36 0) 48)) (.cse27 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse28 (= (select .cse35 0) 109)) (.cse29 (= (select .cse36 1) 0)) (.cse30 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse31 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse32 (< 0 |#StackHeapBarrier|)) (.cse33 (= 112 (select .cse35 2))) (.cse34 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (* |ULTIMATE.start_main_~i~0#1| 4) 2147483651) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< 1 ~CELLCOUNT~0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (= |ULTIMATE.start_main_~CCCELVOL3~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#volArray~0#1.base|) (+ |ULTIMATE.start_main_~#volArray~0#1.offset| (- 28) (* 16 |ULTIMATE.start_main_~i~0#1|)))) .cse33 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~CELLCOUNT~0) .cse7 .cse8 .cse9 (= |ULTIMATE.start_main_~i~0#1| 1) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34)))) [2022-11-25 23:57:39,317 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW(line 82) no Hoare annotation was computed. [2022-11-25 23:57:39,317 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-11-25 23:57:39,317 INFO L899 garLoopResultBuilder]: For program point L44-8(lines 44 57) no Hoare annotation was computed. [2022-11-25 23:57:39,317 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-11-25 23:57:39,318 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2022-11-25 23:57:39,318 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-25 23:57:39,318 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2022-11-25 23:57:39,318 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-25 23:57:39,318 INFO L899 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2022-11-25 23:57:39,318 INFO L899 garLoopResultBuilder]: For program point L78-2(line 78) no Hoare annotation was computed. [2022-11-25 23:57:39,318 INFO L899 garLoopResultBuilder]: For program point L78-3(line 78) no Hoare annotation was computed. [2022-11-25 23:57:39,319 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-25 23:57:39,319 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-11-25 23:57:39,319 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2022-11-25 23:57:39,319 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-25 23:57:39,319 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW(line 67) no Hoare annotation was computed. [2022-11-25 23:57:39,319 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 53) no Hoare annotation was computed. [2022-11-25 23:57:39,319 INFO L899 garLoopResultBuilder]: For program point L46-2(lines 46 53) no Hoare annotation was computed. [2022-11-25 23:57:39,320 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-11-25 23:57:39,320 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-25 23:57:39,320 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-25 23:57:39,320 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW(line 48) no Hoare annotation was computed. [2022-11-25 23:57:39,320 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2022-11-25 23:57:39,320 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-11-25 23:57:39,327 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-25 23:57:39,327 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-11-25 23:57:39,327 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW(line 89) no Hoare annotation was computed. [2022-11-25 23:57:39,327 INFO L899 garLoopResultBuilder]: For program point L48-1(line 48) no Hoare annotation was computed. [2022-11-25 23:57:39,327 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-25 23:57:39,327 INFO L899 garLoopResultBuilder]: For program point L48-2(line 48) no Hoare annotation was computed. [2022-11-25 23:57:39,327 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2022-11-25 23:57:39,328 INFO L899 garLoopResultBuilder]: For program point L48-3(line 48) no Hoare annotation was computed. [2022-11-25 23:57:39,328 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-11-25 23:57:39,328 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-25 23:57:39,328 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW(line 67) no Hoare annotation was computed. [2022-11-25 23:57:39,328 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2022-11-25 23:57:39,328 INFO L899 garLoopResultBuilder]: For program point L82-1(line 82) no Hoare annotation was computed. [2022-11-25 23:57:39,328 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 93) no Hoare annotation was computed. [2022-11-25 23:57:39,328 INFO L899 garLoopResultBuilder]: For program point L82-2(line 82) no Hoare annotation was computed. [2022-11-25 23:57:39,328 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-11-25 23:57:39,328 INFO L899 garLoopResultBuilder]: For program point L82-3(line 82) no Hoare annotation was computed. [2022-11-25 23:57:39,328 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 16 93) no Hoare annotation was computed. [2022-11-25 23:57:39,328 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-11-25 23:57:39,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-11-25 23:57:39,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-25 23:57:39,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2022-11-25 23:57:39,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-11-25 23:57:39,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-25 23:57:39,329 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2022-11-25 23:57:39,329 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2022-11-25 23:57:39,329 INFO L899 garLoopResultBuilder]: For program point L84-2(line 84) no Hoare annotation was computed. [2022-11-25 23:57:39,329 INFO L899 garLoopResultBuilder]: For program point L84-3(line 84) no Hoare annotation was computed. [2022-11-25 23:57:39,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW(line 89) no Hoare annotation was computed. [2022-11-25 23:57:39,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-25 23:57:39,329 INFO L899 garLoopResultBuilder]: For program point L84-4(line 84) no Hoare annotation was computed. [2022-11-25 23:57:39,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-25 23:57:39,330 INFO L899 garLoopResultBuilder]: For program point L84-5(line 84) no Hoare annotation was computed. [2022-11-25 23:57:39,330 INFO L899 garLoopResultBuilder]: For program point L84-6(line 84) no Hoare annotation was computed. [2022-11-25 23:57:39,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-25 23:57:39,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW(line 48) no Hoare annotation was computed. [2022-11-25 23:57:39,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-11-25 23:57:39,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-25 23:57:39,330 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-11-25 23:57:39,330 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-11-25 23:57:39,330 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2022-11-25 23:57:39,330 INFO L899 garLoopResultBuilder]: For program point L52-1(line 52) no Hoare annotation was computed. [2022-11-25 23:57:39,330 INFO L899 garLoopResultBuilder]: For program point L85-2(line 85) no Hoare annotation was computed. [2022-11-25 23:57:39,330 INFO L899 garLoopResultBuilder]: For program point L52-2(line 52) no Hoare annotation was computed. [2022-11-25 23:57:39,330 INFO L899 garLoopResultBuilder]: For program point L85-3(line 85) no Hoare annotation was computed. [2022-11-25 23:57:39,331 INFO L899 garLoopResultBuilder]: For program point L52-3(line 52) no Hoare annotation was computed. [2022-11-25 23:57:39,331 INFO L899 garLoopResultBuilder]: For program point L85-4(line 85) no Hoare annotation was computed. [2022-11-25 23:57:39,331 INFO L899 garLoopResultBuilder]: For program point L85-5(line 85) no Hoare annotation was computed. [2022-11-25 23:57:39,331 INFO L899 garLoopResultBuilder]: For program point L85-6(line 85) no Hoare annotation was computed. [2022-11-25 23:57:39,331 INFO L899 garLoopResultBuilder]: For program point L85-7(line 85) no Hoare annotation was computed. [2022-11-25 23:57:39,331 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2022-11-25 23:57:39,331 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 23:57:39,331 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-11-25 23:57:39,331 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-11-25 23:57:39,331 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-11-25 23:57:39,331 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2022-11-25 23:57:39,331 INFO L899 garLoopResultBuilder]: For program point L86-2(line 86) no Hoare annotation was computed. [2022-11-25 23:57:39,331 INFO L899 garLoopResultBuilder]: For program point L86-3(line 86) no Hoare annotation was computed. [2022-11-25 23:57:39,332 INFO L899 garLoopResultBuilder]: For program point L86-4(line 86) no Hoare annotation was computed. [2022-11-25 23:57:39,332 INFO L899 garLoopResultBuilder]: For program point L86-5(line 86) no Hoare annotation was computed. [2022-11-25 23:57:39,332 INFO L899 garLoopResultBuilder]: For program point L86-6(line 86) no Hoare annotation was computed. [2022-11-25 23:57:39,332 INFO L899 garLoopResultBuilder]: For program point L86-7(line 86) no Hoare annotation was computed. [2022-11-25 23:57:39,332 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-25 23:57:39,332 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-25 23:57:39,332 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-11-25 23:57:39,332 INFO L899 garLoopResultBuilder]: For program point L54(line 54) no Hoare annotation was computed. [2022-11-25 23:57:39,332 INFO L899 garLoopResultBuilder]: For program point L54-1(line 54) no Hoare annotation was computed. [2022-11-25 23:57:39,332 INFO L899 garLoopResultBuilder]: For program point L54-2(line 54) no Hoare annotation was computed. [2022-11-25 23:57:39,332 INFO L899 garLoopResultBuilder]: For program point L54-3(line 54) no Hoare annotation was computed. [2022-11-25 23:57:39,332 INFO L899 garLoopResultBuilder]: For program point L54-4(line 54) no Hoare annotation was computed. [2022-11-25 23:57:39,332 INFO L899 garLoopResultBuilder]: For program point L54-5(line 54) no Hoare annotation was computed. [2022-11-25 23:57:39,332 INFO L899 garLoopResultBuilder]: For program point L54-6(line 54) no Hoare annotation was computed. [2022-11-25 23:57:39,333 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-25 23:57:39,333 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-11-25 23:57:39,333 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW(line 82) no Hoare annotation was computed. [2022-11-25 23:57:39,333 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2022-11-25 23:57:39,333 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-11-25 23:57:39,333 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-25 23:57:39,333 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-11-25 23:57:39,333 INFO L899 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2022-11-25 23:57:39,333 INFO L899 garLoopResultBuilder]: For program point L55-2(line 55) no Hoare annotation was computed. [2022-11-25 23:57:39,333 INFO L899 garLoopResultBuilder]: For program point L55-3(line 55) no Hoare annotation was computed. [2022-11-25 23:57:39,333 INFO L899 garLoopResultBuilder]: For program point L55-4(line 55) no Hoare annotation was computed. [2022-11-25 23:57:39,333 INFO L899 garLoopResultBuilder]: For program point L55-5(line 55) no Hoare annotation was computed. [2022-11-25 23:57:39,333 INFO L899 garLoopResultBuilder]: For program point L55-6(line 55) no Hoare annotation was computed. [2022-11-25 23:57:39,334 INFO L899 garLoopResultBuilder]: For program point L55-7(line 55) no Hoare annotation was computed. [2022-11-25 23:57:39,334 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-25 23:57:39,334 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-25 23:57:39,334 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-25 23:57:39,334 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-11-25 23:57:39,334 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2022-11-25 23:57:39,334 INFO L899 garLoopResultBuilder]: For program point L56-1(line 56) no Hoare annotation was computed. [2022-11-25 23:57:39,334 INFO L899 garLoopResultBuilder]: For program point L56-2(line 56) no Hoare annotation was computed. [2022-11-25 23:57:39,334 INFO L899 garLoopResultBuilder]: For program point L89-3(line 89) no Hoare annotation was computed. [2022-11-25 23:57:39,334 INFO L899 garLoopResultBuilder]: For program point L56-3(line 56) no Hoare annotation was computed. [2022-11-25 23:57:39,334 INFO L899 garLoopResultBuilder]: For program point L89-4(line 89) no Hoare annotation was computed. [2022-11-25 23:57:39,334 INFO L899 garLoopResultBuilder]: For program point L56-4(line 56) no Hoare annotation was computed. [2022-11-25 23:57:39,334 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-11-25 23:57:39,335 INFO L895 garLoopResultBuilder]: At program point L89-5(lines 89 92) the Hoare annotation is: (let ((.cse37 (select |#memory_int| 1)) (.cse36 (select |#memory_int| 2))) (let ((.cse0 (= 98 (select .cse36 1))) (.cse1 (= (select .cse36 7) 0)) (.cse2 (= (select .cse36 4) 52)) (.cse3 (= (select |#length| 3) 12)) (.cse4 (= |ULTIMATE.start_main_~CCCELVOL3~0#1| 7)) (.cse5 (= (* (mod ~CELLCOUNT~0 1073741824) 4) (select |#length| |ULTIMATE.start_main_~#volArray~0#1.base|))) (.cse6 (= (select |#valid| |ULTIMATE.start_main_~#volArray~0#1.base|) 1)) (.cse7 (<= 2 ~CELLCOUNT~0)) (.cse8 (= (select .cse36 6) 99)) (.cse9 (= |ULTIMATE.start_main_~CCCELVOL4~0#1| 5)) (.cse10 (= 2 (select |#length| 1))) (.cse11 (= (select |#valid| 3) 1)) (.cse12 (= 2 |ULTIMATE.start_main_~MINVAL~0#1|)) (.cse13 (<= ~CELLCOUNT~0 2147483647)) (.cse14 (= |ULTIMATE.start_main_~CCCELVOL1~0#1| 1)) (.cse15 (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0)) (.cse16 (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse17 (= 114 (select .cse36 3))) (.cse18 (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse19 (= (select |#valid| 1) 1)) (.cse20 (= |ULTIMATE.start_main_~CCCELVOL2~0#1| 3)) (.cse21 (= ~CELLCOUNT~0 (* (div ~CELLCOUNT~0 4) 4))) (.cse22 (= (select |#valid| 0) 0)) (.cse23 (= (select .cse36 5) 46)) (.cse24 (= (select |#valid| 2) 1)) (.cse25 (= |#NULL.offset| 0)) (.cse26 (= 8 (select |#length| 2))) (.cse27 (= (select .cse37 0) 48)) (.cse28 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse29 (= (select .cse36 0) 109)) (.cse30 (= (select .cse37 1) 0)) (.cse31 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse32 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse33 (< 0 |#StackHeapBarrier|)) (.cse34 (= 112 (select .cse36 2))) (.cse35 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_main_~i~0#1| 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35)))) [2022-11-25 23:57:39,335 INFO L899 garLoopResultBuilder]: For program point L56-5(line 56) no Hoare annotation was computed. [2022-11-25 23:57:39,335 INFO L899 garLoopResultBuilder]: For program point L56-6(line 56) no Hoare annotation was computed. [2022-11-25 23:57:39,335 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-11-25 23:57:39,336 INFO L899 garLoopResultBuilder]: For program point L56-7(line 56) no Hoare annotation was computed. [2022-11-25 23:57:39,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-25 23:57:39,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-25 23:57:39,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-25 23:57:39,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW(line 48) no Hoare annotation was computed. [2022-11-25 23:57:39,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW(line 82) no Hoare annotation was computed. [2022-11-25 23:57:39,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 23:57:39,337 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-11-25 23:57:39,337 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-25 23:57:39,337 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW(line 48) no Hoare annotation was computed. [2022-11-25 23:57:39,337 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-25 23:57:39,337 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-11-25 23:57:39,337 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2022-11-25 23:57:39,338 INFO L899 garLoopResultBuilder]: For program point L59-2(lines 59 72) no Hoare annotation was computed. [2022-11-25 23:57:39,338 INFO L899 garLoopResultBuilder]: For program point L59-5(line 59) no Hoare annotation was computed. [2022-11-25 23:57:39,338 INFO L899 garLoopResultBuilder]: For program point L59-6(line 59) no Hoare annotation was computed. [2022-11-25 23:57:39,338 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-11-25 23:57:39,338 INFO L895 garLoopResultBuilder]: At program point L59-7(lines 59 72) the Hoare annotation is: (let ((.cse37 (select |#memory_int| 1)) (.cse36 (select |#memory_int| 2))) (let ((.cse0 (= 98 (select .cse36 1))) (.cse1 (= (select .cse36 7) 0)) (.cse2 (= (select .cse36 4) 52)) (.cse3 (= (select |#length| 3) 12)) (.cse4 (= |ULTIMATE.start_main_~CCCELVOL3~0#1| 7)) (.cse5 (= (* (mod ~CELLCOUNT~0 1073741824) 4) (select |#length| |ULTIMATE.start_main_~#volArray~0#1.base|))) (.cse6 (= (select |#valid| |ULTIMATE.start_main_~#volArray~0#1.base|) 1)) (.cse7 (<= 2 ~CELLCOUNT~0)) (.cse8 (= (select .cse36 6) 99)) (.cse9 (= |ULTIMATE.start_main_~CCCELVOL4~0#1| 5)) (.cse10 (= 2 (select |#length| 1))) (.cse11 (= (select |#valid| 3) 1)) (.cse12 (= 2 |ULTIMATE.start_main_~MINVAL~0#1|)) (.cse13 (<= ~CELLCOUNT~0 2147483647)) (.cse14 (= |ULTIMATE.start_main_~CCCELVOL1~0#1| 1)) (.cse15 (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0)) (.cse16 (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse17 (= 114 (select .cse36 3))) (.cse18 (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse19 (= (select |#valid| 1) 1)) (.cse20 (= |ULTIMATE.start_main_~CCCELVOL2~0#1| 3)) (.cse21 (= ~CELLCOUNT~0 (* (div ~CELLCOUNT~0 4) 4))) (.cse22 (= (select |#valid| 0) 0)) (.cse23 (= (select .cse36 5) 46)) (.cse24 (= (select |#valid| 2) 1)) (.cse25 (= |#NULL.offset| 0)) (.cse26 (= 8 (select |#length| 2))) (.cse27 (= (select .cse37 0) 48)) (.cse28 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse29 (= (select .cse36 0) 109)) (.cse30 (= (select .cse37 1) 0)) (.cse31 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse32 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse33 (< 0 |#StackHeapBarrier|)) (.cse34 (= 112 (select .cse36 2))) (.cse35 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_main_~i~0#1| 536870912) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~i~0#1| 1) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35)))) [2022-11-25 23:57:39,339 INFO L899 garLoopResultBuilder]: For program point L59-8(lines 59 72) no Hoare annotation was computed. [2022-11-25 23:57:39,339 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-11-25 23:57:39,339 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-11-25 23:57:39,339 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-25 23:57:39,339 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-11-25 23:57:39,340 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-11-25 23:57:39,340 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-25 23:57:39,340 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr141ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-11-25 23:57:39,340 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-25 23:57:39,340 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-25 23:57:39,340 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-11-25 23:57:39,340 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW(line 52) no Hoare annotation was computed. [2022-11-25 23:57:39,341 INFO L902 garLoopResultBuilder]: At program point L94(lines 13 95) the Hoare annotation is: true [2022-11-25 23:57:39,341 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 68) no Hoare annotation was computed. [2022-11-25 23:57:39,341 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-25 23:57:39,341 INFO L899 garLoopResultBuilder]: For program point L61-2(lines 61 68) no Hoare annotation was computed. [2022-11-25 23:57:39,341 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW(line 63) no Hoare annotation was computed. [2022-11-25 23:57:39,341 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-11-25 23:57:39,342 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-11-25 23:57:39,342 INFO L899 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-11-25 23:57:39,342 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW(line 52) no Hoare annotation was computed. [2022-11-25 23:57:39,342 INFO L899 garLoopResultBuilder]: For program point L29-2(lines 29 42) no Hoare annotation was computed. [2022-11-25 23:57:39,342 INFO L899 garLoopResultBuilder]: For program point L29-5(line 29) no Hoare annotation was computed. [2022-11-25 23:57:39,342 INFO L899 garLoopResultBuilder]: For program point L29-6(line 29) no Hoare annotation was computed. [2022-11-25 23:57:39,343 INFO L895 garLoopResultBuilder]: At program point L29-7(lines 29 42) the Hoare annotation is: (let ((.cse37 (select |#memory_int| 1)) (.cse36 (select |#memory_int| 2))) (let ((.cse0 (= 98 (select .cse36 1))) (.cse1 (= (select .cse36 7) 0)) (.cse2 (= (select .cse36 4) 52)) (.cse3 (= (select |#length| 3) 12)) (.cse4 (= |ULTIMATE.start_main_~CCCELVOL3~0#1| 7)) (.cse5 (= (* (mod ~CELLCOUNT~0 1073741824) 4) (select |#length| |ULTIMATE.start_main_~#volArray~0#1.base|))) (.cse6 (= (select |#valid| |ULTIMATE.start_main_~#volArray~0#1.base|) 1)) (.cse7 (<= 2 ~CELLCOUNT~0)) (.cse8 (= (select .cse36 6) 99)) (.cse9 (= |ULTIMATE.start_main_~CCCELVOL4~0#1| 5)) (.cse10 (= 2 (select |#length| 1))) (.cse11 (= (select |#valid| 3) 1)) (.cse12 (= 2 |ULTIMATE.start_main_~MINVAL~0#1|)) (.cse13 (<= ~CELLCOUNT~0 2147483647)) (.cse14 (= |ULTIMATE.start_main_~CCCELVOL1~0#1| 1)) (.cse15 (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0)) (.cse16 (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse17 (= 114 (select .cse36 3))) (.cse18 (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse19 (= (select |#valid| 1) 1)) (.cse20 (= |ULTIMATE.start_main_~CCCELVOL2~0#1| 3)) (.cse21 (= ~CELLCOUNT~0 (* (div ~CELLCOUNT~0 4) 4))) (.cse22 (= (select |#valid| 0) 0)) (.cse23 (= (select .cse36 5) 46)) (.cse24 (= (select |#valid| 2) 1)) (.cse25 (= |#NULL.offset| 0)) (.cse26 (= 8 (select |#length| 2))) (.cse27 (= (select .cse37 0) 48)) (.cse28 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse29 (= (select .cse36 0) 109)) (.cse30 (= (select .cse37 1) 0)) (.cse31 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse32 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse33 (< 0 |#StackHeapBarrier|)) (.cse34 (= 112 (select .cse36 2))) (.cse35 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_main_~i~0#1| 536870912) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~i~0#1| 1) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35)))) [2022-11-25 23:57:39,343 INFO L899 garLoopResultBuilder]: For program point L29-8(lines 29 42) no Hoare annotation was computed. [2022-11-25 23:57:39,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW(line 74) no Hoare annotation was computed. [2022-11-25 23:57:39,343 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2022-11-25 23:57:39,343 INFO L899 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2022-11-25 23:57:39,344 INFO L899 garLoopResultBuilder]: For program point L63-2(line 63) no Hoare annotation was computed. [2022-11-25 23:57:39,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-25 23:57:39,344 INFO L899 garLoopResultBuilder]: For program point L63-3(line 63) no Hoare annotation was computed. [2022-11-25 23:57:39,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-11-25 23:57:39,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-11-25 23:57:39,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-25 23:57:39,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-11-25 23:57:39,345 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-25 23:57:39,345 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 38) no Hoare annotation was computed. [2022-11-25 23:57:39,345 INFO L899 garLoopResultBuilder]: For program point L31-2(lines 31 38) no Hoare annotation was computed. [2022-11-25 23:57:39,345 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-25 23:57:39,345 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-25 23:57:39,345 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-25 23:57:39,345 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-11-25 23:57:39,346 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-11-25 23:57:39,346 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW(line 63) no Hoare annotation was computed. [2022-11-25 23:57:39,346 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-25 23:57:39,346 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-25 23:57:39,346 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2022-11-25 23:57:39,346 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-11-25 23:57:39,347 INFO L899 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2022-11-25 23:57:39,347 INFO L899 garLoopResultBuilder]: For program point L33-2(line 33) no Hoare annotation was computed. [2022-11-25 23:57:39,347 INFO L899 garLoopResultBuilder]: For program point L33-3(line 33) no Hoare annotation was computed. [2022-11-25 23:57:39,347 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-11-25 23:57:39,347 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW(line 63) no Hoare annotation was computed. [2022-11-25 23:57:39,347 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-25 23:57:39,347 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-11-25 23:57:39,348 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-11-25 23:57:39,348 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-25 23:57:39,348 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2022-11-25 23:57:39,348 INFO L899 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2022-11-25 23:57:39,348 INFO L899 garLoopResultBuilder]: For program point L67-2(line 67) no Hoare annotation was computed. [2022-11-25 23:57:39,348 INFO L899 garLoopResultBuilder]: For program point L67-3(line 67) no Hoare annotation was computed. [2022-11-25 23:57:39,348 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW(line 52) no Hoare annotation was computed. [2022-11-25 23:57:39,349 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-11-25 23:57:39,349 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-25 23:57:39,349 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW(line 82) no Hoare annotation was computed. [2022-11-25 23:57:39,352 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:57:39,355 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:57:39,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:57:39 BoogieIcfgContainer [2022-11-25 23:57:39,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:57:39,412 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:57:39,412 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:57:39,413 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:57:39,413 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:56:10" (3/4) ... [2022-11-25 23:57:39,416 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 23:57:39,430 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-11-25 23:57:39,431 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-25 23:57:39,432 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-25 23:57:39,432 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:57:39,433 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:57:39,459 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && i <= 536870912) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && 2 <= i) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) [2022-11-25 23:57:39,459 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 1 <= i) && i * 4 <= 2147483651) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 1 < CELLCOUNT) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && CCCELVOL3 == unknown-#memory_int-unknown[volArray][volArray + -28 + 16 * i]) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) [2022-11-25 23:57:39,460 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && i <= 536870912) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && 2 <= i) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) [2022-11-25 23:57:39,460 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && i <= 536870912) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && 2 <= i) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) [2022-11-25 23:57:39,461 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && i == 0) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 1 <= i) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) [2022-11-25 23:57:39,496 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:57:39,496 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:57:39,497 INFO L158 Benchmark]: Toolchain (without parser) took 90946.69ms. Allocated memory was 130.0MB in the beginning and 597.7MB in the end (delta: 467.7MB). Free memory was 57.7MB in the beginning and 382.9MB in the end (delta: -325.2MB). Peak memory consumption was 143.7MB. Max. memory is 16.1GB. [2022-11-25 23:57:39,497 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 130.0MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:57:39,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.55ms. Allocated memory was 130.0MB in the beginning and 163.6MB in the end (delta: 33.6MB). Free memory was 57.5MB in the beginning and 130.5MB in the end (delta: -73.0MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2022-11-25 23:57:39,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.38ms. Allocated memory is still 163.6MB. Free memory was 130.5MB in the beginning and 128.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:57:39,498 INFO L158 Benchmark]: Boogie Preprocessor took 53.25ms. Allocated memory is still 163.6MB. Free memory was 127.4MB in the beginning and 126.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:57:39,499 INFO L158 Benchmark]: RCFGBuilder took 1082.12ms. Allocated memory is still 163.6MB. Free memory was 126.1MB in the beginning and 87.5MB in the end (delta: 38.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-25 23:57:39,499 INFO L158 Benchmark]: TraceAbstraction took 89302.09ms. Allocated memory was 163.6MB in the beginning and 597.7MB in the end (delta: 434.1MB). Free memory was 86.8MB in the beginning and 390.3MB in the end (delta: -303.5MB). Peak memory consumption was 319.8MB. Max. memory is 16.1GB. [2022-11-25 23:57:39,499 INFO L158 Benchmark]: Witness Printer took 84.33ms. Allocated memory is still 597.7MB. Free memory was 390.3MB in the beginning and 382.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-25 23:57:39,501 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 130.0MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.55ms. Allocated memory was 130.0MB in the beginning and 163.6MB in the end (delta: 33.6MB). Free memory was 57.5MB in the beginning and 130.5MB in the end (delta: -73.0MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.38ms. Allocated memory is still 163.6MB. Free memory was 130.5MB in the beginning and 128.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.25ms. Allocated memory is still 163.6MB. Free memory was 127.4MB in the beginning and 126.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1082.12ms. Allocated memory is still 163.6MB. Free memory was 126.1MB in the beginning and 87.5MB in the end (delta: 38.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 89302.09ms. Allocated memory was 163.6MB in the beginning and 597.7MB in the end (delta: 434.1MB). Free memory was 86.8MB in the beginning and 390.3MB in the end (delta: -303.5MB). Peak memory consumption was 319.8MB. Max. memory is 16.1GB. * Witness Printer took 84.33ms. Allocated memory is still 597.7MB. Free memory was 390.3MB in the beginning and 382.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 311 locations, 146 error locations. Started 1 CEGAR loops. OverallTime: 89.2s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 25.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5040 SdHoareTripleChecker+Valid, 11.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5040 mSDsluCounter, 4009 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1797 mSDsCounter, 725 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10528 IncrementalHoareTripleChecker+Invalid, 11253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 725 mSolverCounterUnsat, 2212 mSDtfsCounter, 10528 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2353 GetRequests, 1807 SyntacticMatches, 331 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7182 ImplicationChecksByTransitivity, 35.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=449occurred in iteration=6, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 800 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 21 NumberOfFragments, 1812 HoareAnnotationTreeSize, 6 FomulaSimplifications, 190 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1582 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2668 NumberOfCodeBlocks, 2668 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3195 ConstructedInterpolants, 0 QuantifiedInterpolants, 5361 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2457 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 34 InterpolantComputations, 14 PerfectInterpolantSequences, 192/295 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 16.7s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 297, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 1146, TOOLS_POST_TIME: 15.1s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 1146, TOOLS_QUANTIFIERELIM_TIME: 14.7s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.3s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 1501, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 28, DOMAIN_JOIN_TIME: 0.3s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 16, DOMAIN_WIDEN_TIME: 0.3s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 25, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 297, DOMAIN_ISBOTTOM_TIME: 0.4s, LOOP_SUMMARIZER_APPLICATIONS: 9, LOOP_SUMMARIZER_CACHE_MISSES: 9, LOOP_SUMMARIZER_OVERALL_TIME: 12.8s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 12.8s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 25, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.5s, DAG_COMPRESSION_PROCESSED_NODES: 31652, DAG_COMPRESSION_RETAINED_NODES: 956, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 146 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 1 <= i) && i * 4 <= 2147483651) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 1 < CELLCOUNT) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && CCCELVOL3 == unknown-#memory_int-unknown[volArray][volArray + -28 + 16 * i]) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && i <= 536870912) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && 2 <= i) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && i == 0) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 1 <= i) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && i <= 536870912) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && 2 <= i) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && i <= 536870912) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && 2 <= i) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((98 == unknown-#memory_int-unknown[2][1] && unknown-#memory_int-unknown[2][7] == 0) && unknown-#memory_int-unknown[2][4] == 52) && unknown-#length-unknown[3] == 12) && CCCELVOL3 == 7) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 2 <= CELLCOUNT) && unknown-#memory_int-unknown[2][6] == 99) && CCCELVOL4 == 5) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && CCCELVOL1 == 1) && volArray == 0) && 0 <= \old(cond)) && 114 == unknown-#memory_int-unknown[2][3]) && 0 <= cond) && \valid[1] == 1) && CCCELVOL2 == 3) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && unknown-#memory_int-unknown[2][5] == 46) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[2][0] == 109) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && 112 == unknown-#memory_int-unknown[2][2]) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-25 23:57:39,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769fc3a5-52d2-4afe-9eba-34ea11ef6b58/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE