./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-tiling/mbpr4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh --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-2329fc7 [2022-12-14 05:29:27,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 05:29:27,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 05:29:27,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 05:29:27,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 05:29:27,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 05:29:27,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 05:29:27,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 05:29:27,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 05:29:27,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 05:29:27,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 05:29:27,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 05:29:27,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 05:29:27,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 05:29:27,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 05:29:27,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 05:29:27,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 05:29:27,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 05:29:27,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 05:29:27,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 05:29:27,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 05:29:27,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 05:29:27,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 05:29:27,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 05:29:27,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 05:29:27,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 05:29:27,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 05:29:27,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 05:29:27,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 05:29:27,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 05:29:27,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 05:29:27,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 05:29:27,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 05:29:27,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 05:29:27,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 05:29:27,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 05:29:27,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 05:29:27,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 05:29:27,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 05:29:27,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 05:29:27,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 05:29:27,303 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 05:29:27,317 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 05:29:27,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 05:29:27,317 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 05:29:27,317 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 05:29:27,318 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 05:29:27,318 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 05:29:27,318 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 05:29:27,318 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 05:29:27,318 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 05:29:27,318 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 05:29:27,318 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 05:29:27,318 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 05:29:27,319 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 05:29:27,319 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 05:29:27,319 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 05:29:27,319 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 05:29:27,319 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 05:29:27,319 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 05:29:27,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 05:29:27,320 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 05:29:27,320 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 05:29:27,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 05:29:27,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 05:29:27,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 05:29:27,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 05:29:27,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 05:29:27,320 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 05:29:27,320 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 05:29:27,320 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 05:29:27,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 05:29:27,321 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 05:29:27,321 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 05:29:27,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 05:29:27,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 05:29:27,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:29:27,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 05:29:27,321 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 05:29:27,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 05:29:27,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 05:29:27,321 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 05:29:27,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 05:29:27,322 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 05:29:27,322 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 05:29:27,322 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_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/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_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh 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-12-14 05:29:27,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 05:29:27,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 05:29:27,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 05:29:27,503 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 05:29:27,504 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 05:29:27,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/array-tiling/mbpr4.c [2022-12-14 05:29:30,083 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 05:29:30,206 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 05:29:30,207 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/sv-benchmarks/c/array-tiling/mbpr4.c [2022-12-14 05:29:30,211 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/data/c139a7bbd/da7e659ef93e4f6c82beac2977aa242b/FLAG5869a4bd1 [2022-12-14 05:29:30,222 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/data/c139a7bbd/da7e659ef93e4f6c82beac2977aa242b [2022-12-14 05:29:30,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 05:29:30,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 05:29:30,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 05:29:30,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 05:29:30,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 05:29:30,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:29:30" (1/1) ... [2022-12-14 05:29:30,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23dfa7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:29:30, skipping insertion in model container [2022-12-14 05:29:30,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:29:30" (1/1) ... [2022-12-14 05:29:30,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 05:29:30,247 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 05:29:30,349 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_25adf223-e462-4114-97bc-574b660cce56/sv-benchmarks/c/array-tiling/mbpr4.c[396,409] [2022-12-14 05:29:30,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:29:30,396 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 05:29:30,404 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_25adf223-e462-4114-97bc-574b660cce56/sv-benchmarks/c/array-tiling/mbpr4.c[396,409] [2022-12-14 05:29:30,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:29:30,430 INFO L208 MainTranslator]: Completed translation [2022-12-14 05:29:30,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:29:30 WrapperNode [2022-12-14 05:29:30,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 05:29:30,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 05:29:30,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 05:29:30,431 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 05:29:30,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:29:30" (1/1) ... [2022-12-14 05:29:30,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:29:30" (1/1) ... [2022-12-14 05:29:30,468 INFO L138 Inliner]: procedures = 15, calls = 54, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 291 [2022-12-14 05:29:30,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 05:29:30,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 05:29:30,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 05:29:30,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 05:29:30,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:29:30" (1/1) ... [2022-12-14 05:29:30,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:29:30" (1/1) ... [2022-12-14 05:29:30,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:29:30" (1/1) ... [2022-12-14 05:29:30,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:29:30" (1/1) ... [2022-12-14 05:29:30,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:29:30" (1/1) ... [2022-12-14 05:29:30,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:29:30" (1/1) ... [2022-12-14 05:29:30,492 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:29:30" (1/1) ... [2022-12-14 05:29:30,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:29:30" (1/1) ... [2022-12-14 05:29:30,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 05:29:30,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 05:29:30,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 05:29:30,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 05:29:30,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:29:30" (1/1) ... [2022-12-14 05:29:30,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:29:30,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:29:30,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 05:29:30,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 05:29:30,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 05:29:30,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 05:29:30,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 05:29:30,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 05:29:30,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 05:29:30,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 05:29:30,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 05:29:30,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 05:29:30,615 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 05:29:30,617 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 05:29:31,083 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 05:29:31,117 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 05:29:31,117 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-14 05:29:31,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:29:31 BoogieIcfgContainer [2022-12-14 05:29:31,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 05:29:31,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 05:29:31,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 05:29:31,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 05:29:31,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 05:29:30" (1/3) ... [2022-12-14 05:29:31,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3956f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:29:31, skipping insertion in model container [2022-12-14 05:29:31,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:29:30" (2/3) ... [2022-12-14 05:29:31,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3956f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:29:31, skipping insertion in model container [2022-12-14 05:29:31,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:29:31" (3/3) ... [2022-12-14 05:29:31,126 INFO L112 eAbstractionObserver]: Analyzing ICFG mbpr4.c [2022-12-14 05:29:31,140 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 05:29:31,141 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 146 error locations. [2022-12-14 05:29:31,182 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 05:29:31,188 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;@684a81fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 05:29:31,188 INFO L358 AbstractCegarLoop]: Starting to check reachability of 146 error locations. [2022-12-14 05:29:31,192 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-12-14 05:29:31,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 05:29:31,197 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:29:31,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 05:29:31,198 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-12-14 05:29:31,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:29:31,202 INFO L85 PathProgramCache]: Analyzing trace with hash 13781815, now seen corresponding path program 1 times [2022-12-14 05:29:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:29:31,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070111196] [2022-12-14 05:29:31,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:31,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:29:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:29:31,540 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:29:31,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070111196] [2022-12-14 05:29:31,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070111196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:29:31,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:29:31,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:29:31,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501144675] [2022-12-14 05:29:31,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:29:31,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:29:31,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:29:31,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:29:31,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:29:31,569 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-12-14 05:29:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:29:31,675 INFO L93 Difference]: Finished difference Result 547 states and 571 transitions. [2022-12-14 05:29:31,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:29:31,677 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-12-14 05:29:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:29:31,684 INFO L225 Difference]: With dead ends: 547 [2022-12-14 05:29:31,684 INFO L226 Difference]: Without dead ends: 304 [2022-12-14 05:29:31,687 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-12-14 05:29:31,689 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 314 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-14 05:29:31,690 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-12-14 05:29:31,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-12-14 05:29:31,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2022-12-14 05:29:31,725 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-12-14 05:29:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 312 transitions. [2022-12-14 05:29:31,729 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 312 transitions. Word has length 4 [2022-12-14 05:29:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:29:31,729 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 312 transitions. [2022-12-14 05:29:31,730 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-12-14 05:29:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 312 transitions. [2022-12-14 05:29:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 05:29:31,730 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:29:31,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 05:29:31,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 05:29:31,731 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-12-14 05:29:31,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:29:31,732 INFO L85 PathProgramCache]: Analyzing trace with hash 427236319, now seen corresponding path program 1 times [2022-12-14 05:29:31,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:29:31,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248228778] [2022-12-14 05:29:31,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:31,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:29:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:29:31,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:29:31,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248228778] [2022-12-14 05:29:31,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248228778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:29:31,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:29:31,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 05:29:31,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928156925] [2022-12-14 05:29:31,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:29:31,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 05:29:31,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:29:31,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 05:29:31,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:29:31,916 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-12-14 05:29:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:29:31,978 INFO L93 Difference]: Finished difference Result 304 states and 312 transitions. [2022-12-14 05:29:31,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:29:31,978 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-12-14 05:29:31,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:29:31,980 INFO L225 Difference]: With dead ends: 304 [2022-12-14 05:29:31,980 INFO L226 Difference]: Without dead ends: 300 [2022-12-14 05:29:31,981 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-12-14 05:29:31,982 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-12-14 05:29:31,982 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-12-14 05:29:31,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-12-14 05:29:31,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2022-12-14 05:29:31,994 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-12-14 05:29:31,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 308 transitions. [2022-12-14 05:29:31,995 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 308 transitions. Word has length 5 [2022-12-14 05:29:31,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:29:31,996 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 308 transitions. [2022-12-14 05:29:31,996 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-12-14 05:29:31,996 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 308 transitions. [2022-12-14 05:29:31,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 05:29:31,996 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:29:31,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:29:31,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 05:29:31,997 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-12-14 05:29:31,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:29:31,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1809139966, now seen corresponding path program 1 times [2022-12-14 05:29:31,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:29:31,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312992944] [2022-12-14 05:29:31,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:31,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:29:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:29:32,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:29:32,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312992944] [2022-12-14 05:29:32,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312992944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:29:32,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:29:32,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:29:32,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936004584] [2022-12-14 05:29:32,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:29:32,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:29:32,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:29:32,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:29:32,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:29:32,042 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-12-14 05:29:32,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:29:32,448 INFO L93 Difference]: Finished difference Result 592 states and 608 transitions. [2022-12-14 05:29:32,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:29:32,449 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-12-14 05:29:32,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:29:32,452 INFO L225 Difference]: With dead ends: 592 [2022-12-14 05:29:32,452 INFO L226 Difference]: Without dead ends: 464 [2022-12-14 05:29:32,452 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-12-14 05:29:32,453 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 160 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:29:32,453 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.4s Time] [2022-12-14 05:29:32,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-12-14 05:29:32,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 444. [2022-12-14 05:29:32,464 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-12-14 05:29:32,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 460 transitions. [2022-12-14 05:29:32,465 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 460 transitions. Word has length 8 [2022-12-14 05:29:32,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:29:32,465 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 460 transitions. [2022-12-14 05:29:32,466 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-12-14 05:29:32,466 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 460 transitions. [2022-12-14 05:29:32,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 05:29:32,466 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:29:32,466 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-12-14 05:29:32,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 05:29:32,467 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-12-14 05:29:32,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:29:32,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1023231597, now seen corresponding path program 1 times [2022-12-14 05:29:32,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:29:32,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625843529] [2022-12-14 05:29:32,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:32,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:29:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:32,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:29:32,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:29:32,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625843529] [2022-12-14 05:29:32,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625843529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:29:32,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:29:32,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:29:32,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16218260] [2022-12-14 05:29:32,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:29:32,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:29:32,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:29:32,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:29:32,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:29:32,531 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-12-14 05:29:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:29:32,736 INFO L93 Difference]: Finished difference Result 449 states and 465 transitions. [2022-12-14 05:29:32,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:29:32,736 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-12-14 05:29:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:29:32,738 INFO L225 Difference]: With dead ends: 449 [2022-12-14 05:29:32,738 INFO L226 Difference]: Without dead ends: 447 [2022-12-14 05:29:32,738 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-12-14 05:29:32,740 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 3 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:29:32,740 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.2s Time] [2022-12-14 05:29:32,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-12-14 05:29:32,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2022-12-14 05:29:32,753 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-12-14 05:29:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 463 transitions. [2022-12-14 05:29:32,754 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 463 transitions. Word has length 21 [2022-12-14 05:29:32,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:29:32,755 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 463 transitions. [2022-12-14 05:29:32,755 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-12-14 05:29:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 463 transitions. [2022-12-14 05:29:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 05:29:32,756 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:29:32,756 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-12-14 05:29:32,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 05:29:32,757 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-12-14 05:29:32,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:29:32,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1710049328, now seen corresponding path program 1 times [2022-12-14 05:29:32,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:29:32,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195891288] [2022-12-14 05:29:32,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:32,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:29:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:32,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 05:29:32,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:29:32,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195891288] [2022-12-14 05:29:32,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195891288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:29:32,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:29:32,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 05:29:32,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390918970] [2022-12-14 05:29:32,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:29:32,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 05:29:32,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:29:32,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 05:29:32,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:29:32,982 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-12-14 05:29:33,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:29:33,400 INFO L93 Difference]: Finished difference Result 799 states and 827 transitions. [2022-12-14 05:29:33,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:29:33,401 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-12-14 05:29:33,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:29:33,402 INFO L225 Difference]: With dead ends: 799 [2022-12-14 05:29:33,402 INFO L226 Difference]: Without dead ends: 463 [2022-12-14 05:29:33,403 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-12-14 05:29:33,404 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 613 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:29:33,405 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.4s Time] [2022-12-14 05:29:33,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-12-14 05:29:33,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 447. [2022-12-14 05:29:33,416 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-12-14 05:29:33,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 459 transitions. [2022-12-14 05:29:33,417 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 459 transitions. Word has length 24 [2022-12-14 05:29:33,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:29:33,418 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 459 transitions. [2022-12-14 05:29:33,418 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-12-14 05:29:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 459 transitions. [2022-12-14 05:29:33,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 05:29:33,418 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:29:33,419 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-12-14 05:29:33,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 05:29:33,419 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-12-14 05:29:33,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:29:33,419 INFO L85 PathProgramCache]: Analyzing trace with hash 428372734, now seen corresponding path program 1 times [2022-12-14 05:29:33,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:29:33,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7457806] [2022-12-14 05:29:33,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:33,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:29:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:29:33,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:29:33,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7457806] [2022-12-14 05:29:33,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7457806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:29:33,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:29:33,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:29:33,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379346743] [2022-12-14 05:29:33,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:29:33,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:29:33,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:29:33,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:29:33,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:29:33,493 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-12-14 05:29:33,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:29:33,830 INFO L93 Difference]: Finished difference Result 463 states and 475 transitions. [2022-12-14 05:29:33,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:29:33,831 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-12-14 05:29:33,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:29:33,832 INFO L225 Difference]: With dead ends: 463 [2022-12-14 05:29:33,832 INFO L226 Difference]: Without dead ends: 461 [2022-12-14 05:29:33,833 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-12-14 05:29:33,834 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 128 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:29:33,834 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.3s Time] [2022-12-14 05:29:33,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-12-14 05:29:33,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 449. [2022-12-14 05:29:33,844 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-12-14 05:29:33,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 461 transitions. [2022-12-14 05:29:33,845 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 461 transitions. Word has length 36 [2022-12-14 05:29:33,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:29:33,845 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 461 transitions. [2022-12-14 05:29:33,845 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-12-14 05:29:33,845 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 461 transitions. [2022-12-14 05:29:33,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 05:29:33,846 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:29:33,846 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-12-14 05:29:33,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 05:29:33,846 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-12-14 05:29:33,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:29:33,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1079103534, now seen corresponding path program 1 times [2022-12-14 05:29:33,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:29:33,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846446214] [2022-12-14 05:29:33,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:33,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:29:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:29:33,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:29:33,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846446214] [2022-12-14 05:29:33,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846446214] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:29:33,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380605513] [2022-12-14 05:29:33,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:33,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:29:33,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:29:33,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:29:33,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 05:29:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:33,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:29:33,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:29:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:29:34,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:29:34,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380605513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:29:34,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:29:34,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 05:29:34,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518046800] [2022-12-14 05:29:34,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:29:34,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 05:29:34,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:29:34,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 05:29:34,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:29:34,054 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-12-14 05:29:34,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:29:34,451 INFO L93 Difference]: Finished difference Result 461 states and 473 transitions. [2022-12-14 05:29:34,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:29:34,452 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-12-14 05:29:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:29:34,453 INFO L225 Difference]: With dead ends: 461 [2022-12-14 05:29:34,453 INFO L226 Difference]: Without dead ends: 444 [2022-12-14 05:29:34,453 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-12-14 05:29:34,454 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 198 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:29:34,454 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.4s Time] [2022-12-14 05:29:34,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-12-14 05:29:34,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 432. [2022-12-14 05:29:34,461 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-12-14 05:29:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 444 transitions. [2022-12-14 05:29:34,461 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 444 transitions. Word has length 42 [2022-12-14 05:29:34,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:29:34,462 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 444 transitions. [2022-12-14 05:29:34,462 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-12-14 05:29:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 444 transitions. [2022-12-14 05:29:34,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 05:29:34,463 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:29:34,464 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-12-14 05:29:34,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 05:29:34,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:29:34,666 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-12-14 05:29:34,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:29:34,667 INFO L85 PathProgramCache]: Analyzing trace with hash 907528880, now seen corresponding path program 1 times [2022-12-14 05:29:34,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:29:34,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066405168] [2022-12-14 05:29:34,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:34,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:29:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:34,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:29:34,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:29:34,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066405168] [2022-12-14 05:29:34,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066405168] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:29:34,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432438124] [2022-12-14 05:29:34,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:34,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:29:34,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:29:34,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:29:34,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 05:29:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:34,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:29:34,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:29:34,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:29:34,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:29:35,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:29:35,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432438124] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:29:35,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [697462421] [2022-12-14 05:29:35,038 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-12-14 05:29:35,038 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:29:35,042 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:29:35,047 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:29:35,047 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:29:35,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,172 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 05:29:35,173 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-12-14 05:29:35,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,190 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-12-14 05:29:35,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,275 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-12-14 05:29:35,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,359 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-12-14 05:29:35,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,454 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-12-14 05:29:35,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,540 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-12-14 05:29:35,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:35,893 INFO L321 Elim1Store]: treesize reduction 96, result has 13.5 percent of original size [2022-12-14 05:29:35,893 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-12-14 05:29:36,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,252 INFO L321 Elim1Store]: treesize reduction 113, result has 5.8 percent of original size [2022-12-14 05:29:36,252 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-12-14 05:29:36,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,669 INFO L321 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2022-12-14 05:29:36,670 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-12-14 05:29:36,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:36,968 INFO L321 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2022-12-14 05:29:36,969 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-12-14 05:29:37,207 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-12-14 05:29:37,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-12-14 05:29:37,328 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-12-14 05:29:37,388 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-12-14 05:29:37,463 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-12-14 05:29:37,556 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-12-14 05:29:37,633 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-12-14 05:29:37,704 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-12-14 05:29:37,757 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:29:38,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [697462421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:29:38,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:29:38,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 4, 4] total 16 [2022-12-14 05:29:38,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639825305] [2022-12-14 05:29:38,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:29:38,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 05:29:38,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:29:38,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 05:29:38,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-12-14 05:29:38,849 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-12-14 05:29:40,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:29:40,950 INFO L93 Difference]: Finished difference Result 796 states and 834 transitions. [2022-12-14 05:29:40,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 05:29:40,951 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-12-14 05:29:40,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:29:40,952 INFO L225 Difference]: With dead ends: 796 [2022-12-14 05:29:40,952 INFO L226 Difference]: Without dead ends: 375 [2022-12-14 05:29:40,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 106 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-12-14 05:29:40,953 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 592 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 05:29:40,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 170 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 05:29:40,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-12-14 05:29:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 340. [2022-12-14 05:29:40,960 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-12-14 05:29:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 344 transitions. [2022-12-14 05:29:40,961 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 344 transitions. Word has length 43 [2022-12-14 05:29:40,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:29:40,961 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 344 transitions. [2022-12-14 05:29:40,961 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-12-14 05:29:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 344 transitions. [2022-12-14 05:29:40,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-14 05:29:40,962 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:29:40,962 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-12-14 05:29:40,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 05:29:41,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:29:41,163 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-12-14 05:29:41,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:29:41,164 INFO L85 PathProgramCache]: Analyzing trace with hash 947001044, now seen corresponding path program 1 times [2022-12-14 05:29:41,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:29:41,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459730118] [2022-12-14 05:29:41,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:41,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:29:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:29:41,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:29:41,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459730118] [2022-12-14 05:29:41,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459730118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:29:41,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:29:41,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:29:41,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102444135] [2022-12-14 05:29:41,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:29:41,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:29:41,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:29:41,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:29:41,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:29:41,239 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-12-14 05:29:41,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:29:41,507 INFO L93 Difference]: Finished difference Result 383 states and 387 transitions. [2022-12-14 05:29:41,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:29:41,508 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-12-14 05:29:41,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:29:41,509 INFO L225 Difference]: With dead ends: 383 [2022-12-14 05:29:41,509 INFO L226 Difference]: Without dead ends: 381 [2022-12-14 05:29:41,510 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-12-14 05:29:41,510 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 106 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:29:41,510 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.2s Time] [2022-12-14 05:29:41,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-12-14 05:29:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 342. [2022-12-14 05:29:41,523 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-12-14 05:29:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 346 transitions. [2022-12-14 05:29:41,524 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 346 transitions. Word has length 74 [2022-12-14 05:29:41,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:29:41,525 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 346 transitions. [2022-12-14 05:29:41,525 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-12-14 05:29:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 346 transitions. [2022-12-14 05:29:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-14 05:29:41,526 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:29:41,526 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-12-14 05:29:41,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 05:29:41,527 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-12-14 05:29:41,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:29:41,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1103061592, now seen corresponding path program 1 times [2022-12-14 05:29:41,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:29:41,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334521712] [2022-12-14 05:29:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:41,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:29:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:41,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:29:41,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:29:41,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334521712] [2022-12-14 05:29:41,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334521712] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:29:41,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948377411] [2022-12-14 05:29:41,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:41,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:29:41,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:29:41,628 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:29:41,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 05:29:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:41,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:29:41,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:29:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:29:41,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:29:41,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948377411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:29:41,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:29:41,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 05:29:41,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807310527] [2022-12-14 05:29:41,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:29:41,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 05:29:41,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:29:41,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 05:29:41,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:29:41,729 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-12-14 05:29:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:29:42,058 INFO L93 Difference]: Finished difference Result 381 states and 385 transitions. [2022-12-14 05:29:42,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:29:42,059 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-12-14 05:29:42,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:29:42,060 INFO L225 Difference]: With dead ends: 381 [2022-12-14 05:29:42,060 INFO L226 Difference]: Without dead ends: 366 [2022-12-14 05:29:42,060 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-12-14 05:29:42,061 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 167 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:29:42,061 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.3s Time] [2022-12-14 05:29:42,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-12-14 05:29:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 327. [2022-12-14 05:29:42,073 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-12-14 05:29:42,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 331 transitions. [2022-12-14 05:29:42,074 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 331 transitions. Word has length 80 [2022-12-14 05:29:42,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:29:42,074 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 331 transitions. [2022-12-14 05:29:42,075 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-12-14 05:29:42,075 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 331 transitions. [2022-12-14 05:29:42,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-14 05:29:42,076 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:29:42,076 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-12-14 05:29:42,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 05:29:42,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 05:29:42,277 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-12-14 05:29:42,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:29:42,279 INFO L85 PathProgramCache]: Analyzing trace with hash 164829174, now seen corresponding path program 1 times [2022-12-14 05:29:42,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:29:42,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237947664] [2022-12-14 05:29:42,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:42,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:29:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:29:42,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:29:42,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237947664] [2022-12-14 05:29:42,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237947664] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:29:42,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827932239] [2022-12-14 05:29:42,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:42,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:29:42,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:29:42,422 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:29:42,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 05:29:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:42,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:29:42,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:29:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:29:42,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:29:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:29:42,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827932239] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:29:42,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [950904260] [2022-12-14 05:29:42,580 INFO L159 IcfgInterpreter]: Started Sifa with 73 locations of interest [2022-12-14 05:29:42,581 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:29:42,581 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:29:42,581 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:29:42,581 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:29:42,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:42,637 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 05:29:42,638 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-12-14 05:29:42,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:42,648 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-12-14 05:29:42,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:42,712 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-12-14 05:29:42,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:42,783 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-12-14 05:29:42,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:42,846 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-12-14 05:29:42,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:42,917 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-12-14 05:29:43,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:29:43,173 INFO L321 Elim1Store]: treesize reduction 94, result has 23.0 percent of original size [2022-12-14 05:29:43,173 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-12-14 05:29:43,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:43,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:29:43,723 INFO L321 Elim1Store]: treesize reduction 107, result has 6.1 percent of original size [2022-12-14 05:29:43,724 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-12-14 05:29:44,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:29:44,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,255 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-12-14 05:29:44,256 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-12-14 05:29:44,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:29:44,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:44,765 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-12-14 05:29:44,766 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-12-14 05:29:44,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-12-14 05:29:45,025 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-12-14 05:29:45,051 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-12-14 05:29:45,071 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-12-14 05:29:45,103 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-12-14 05:29:45,131 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-12-14 05:29:45,162 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-12-14 05:29:45,192 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-12-14 05:29:45,219 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-12-14 05:29:45,238 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-12-14 05:29:45,258 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-12-14 05:29:45,286 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-12-14 05:29:45,342 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 05:29:45,342 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-12-14 05:29:45,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:45,461 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 05:29:45,461 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-12-14 05:29:45,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:45,563 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 05:29:45,563 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-12-14 05:29:45,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:45,646 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 05:29:45,646 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-12-14 05:29:45,733 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-12-14 05:29:45,748 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-12-14 05:29:45,765 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-12-14 05:29:45,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-12-14 05:29:45,808 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-12-14 05:29:45,839 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-12-14 05:29:45,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-12-14 05:29:45,892 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-12-14 05:29:45,979 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:29:48,239 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-12-14 05:29:48,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 05:29:48,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:29:48,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-14 05:29:48,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600947502] [2022-12-14 05:29:48,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:29:48,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 05:29:48,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:29:48,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 05:29:48,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-12-14 05:29:48,240 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-12-14 05:29:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:29:48,581 INFO L93 Difference]: Finished difference Result 410 states and 430 transitions. [2022-12-14 05:29:48,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 05:29:48,581 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-12-14 05:29:48,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:29:48,582 INFO L225 Difference]: With dead ends: 410 [2022-12-14 05:29:48,582 INFO L226 Difference]: Without dead ends: 369 [2022-12-14 05:29:48,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 186 SyntacticMatches, 38 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2022-12-14 05:29:48,583 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 363 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:29:48,583 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.3s Time] [2022-12-14 05:29:48,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-12-14 05:29:48,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 326. [2022-12-14 05:29:48,593 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-12-14 05:29:48,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 332 transitions. [2022-12-14 05:29:48,594 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 332 transitions. Word has length 81 [2022-12-14 05:29:48,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:29:48,594 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 332 transitions. [2022-12-14 05:29:48,595 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-12-14 05:29:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 332 transitions. [2022-12-14 05:29:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-14 05:29:48,596 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:29:48,596 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-12-14 05:29:48,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 05:29:48,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 05:29:48,798 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-12-14 05:29:48,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:29:48,799 INFO L85 PathProgramCache]: Analyzing trace with hash -887138007, now seen corresponding path program 1 times [2022-12-14 05:29:48,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:29:48,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783909841] [2022-12-14 05:29:48,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:48,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:29:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:29:48,898 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:29:48,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783909841] [2022-12-14 05:29:48,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783909841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:29:48,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:29:48,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:29:48,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798654561] [2022-12-14 05:29:48,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:29:48,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:29:48,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:29:48,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:29:48,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:29:48,900 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-12-14 05:29:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:29:49,122 INFO L93 Difference]: Finished difference Result 367 states and 373 transitions. [2022-12-14 05:29:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:29:49,122 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-12-14 05:29:49,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:29:49,123 INFO L225 Difference]: With dead ends: 367 [2022-12-14 05:29:49,123 INFO L226 Difference]: Without dead ends: 365 [2022-12-14 05:29:49,124 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-12-14 05:29:49,124 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 104 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:29:49,124 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.2s Time] [2022-12-14 05:29:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-12-14 05:29:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 329. [2022-12-14 05:29:49,132 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-12-14 05:29:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 335 transitions. [2022-12-14 05:29:49,133 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 335 transitions. Word has length 112 [2022-12-14 05:29:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:29:49,133 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 335 transitions. [2022-12-14 05:29:49,133 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-12-14 05:29:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 335 transitions. [2022-12-14 05:29:49,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-14 05:29:49,134 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:29:49,134 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-12-14 05:29:49,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 05:29:49,134 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-12-14 05:29:49,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:29:49,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1763675837, now seen corresponding path program 1 times [2022-12-14 05:29:49,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:29:49,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289501256] [2022-12-14 05:29:49,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:49,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:29:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:29:49,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:29:49,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289501256] [2022-12-14 05:29:49,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289501256] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:29:49,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629681786] [2022-12-14 05:29:49,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:49,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:29:49,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:29:49,216 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:29:49,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 05:29:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:49,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:29:49,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:29:49,334 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:29:49,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:29:49,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629681786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:29:49,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:29:49,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 05:29:49,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250201036] [2022-12-14 05:29:49,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:29:49,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 05:29:49,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:29:49,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 05:29:49,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:29:49,336 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-12-14 05:29:49,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:29:49,642 INFO L93 Difference]: Finished difference Result 365 states and 371 transitions. [2022-12-14 05:29:49,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:29:49,643 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-12-14 05:29:49,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:29:49,644 INFO L225 Difference]: With dead ends: 365 [2022-12-14 05:29:49,644 INFO L226 Difference]: Without dead ends: 350 [2022-12-14 05:29:49,644 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-12-14 05:29:49,644 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 136 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:29:49,644 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.3s Time] [2022-12-14 05:29:49,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-12-14 05:29:49,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 314. [2022-12-14 05:29:49,652 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-12-14 05:29:49,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 320 transitions. [2022-12-14 05:29:49,653 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 320 transitions. Word has length 118 [2022-12-14 05:29:49,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:29:49,653 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 320 transitions. [2022-12-14 05:29:49,653 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-12-14 05:29:49,653 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 320 transitions. [2022-12-14 05:29:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-14 05:29:49,654 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:29:49,654 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-12-14 05:29:49,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 05:29:49,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 05:29:49,855 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-12-14 05:29:49,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:29:49,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1160623651, now seen corresponding path program 1 times [2022-12-14 05:29:49,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:29:49,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766210846] [2022-12-14 05:29:49,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:49,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:29:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:29:49,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:29:49,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766210846] [2022-12-14 05:29:49,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766210846] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:29:49,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269542006] [2022-12-14 05:29:49,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:29:49,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:29:49,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:29:49,940 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:29:49,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 05:29:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:29:50,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:29:50,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:29:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:29:50,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:29:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:29:50,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269542006] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:29:50,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1851551068] [2022-12-14 05:29:50,125 INFO L159 IcfgInterpreter]: Started Sifa with 108 locations of interest [2022-12-14 05:29:50,125 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:29:50,126 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:29:50,126 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:29:50,126 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:29:50,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:50,228 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 05:29:50,229 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-12-14 05:29:50,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:50,240 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-12-14 05:29:50,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:50,299 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-12-14 05:29:50,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:50,371 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-12-14 05:29:50,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:50,439 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-12-14 05:29:50,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:50,501 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-12-14 05:29:50,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:50,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:50,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:50,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:50,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:50,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:50,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:50,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:29:50,756 INFO L321 Elim1Store]: treesize reduction 94, result has 23.0 percent of original size [2022-12-14 05:29:50,756 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-12-14 05:29:51,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:29:51,291 INFO L321 Elim1Store]: treesize reduction 107, result has 6.1 percent of original size [2022-12-14 05:29:51,292 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-12-14 05:29:51,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:29:51,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:51,813 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-12-14 05:29:51,813 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-12-14 05:29:52,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:52,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:52,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:52,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:52,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:52,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:52,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:52,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:52,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:52,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:52,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:52,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:52,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:52,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:52,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:52,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:52,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:29:52,359 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-12-14 05:29:52,359 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-12-14 05:29:52,590 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-12-14 05:29:52,613 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-12-14 05:29:52,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-12-14 05:29:52,664 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-12-14 05:29:52,699 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-12-14 05:29:52,731 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-12-14 05:29:52,767 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-12-14 05:29:52,803 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-12-14 05:29:52,834 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-12-14 05:29:52,855 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-12-14 05:29:52,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-12-14 05:29:52,907 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-12-14 05:29:52,963 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 05:29:52,964 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-12-14 05:29:53,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:53,088 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 05:29:53,088 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-12-14 05:29:53,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:53,215 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 05:29:53,216 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-12-14 05:29:53,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:53,347 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 05:29:53,348 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-12-14 05:29:53,471 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-12-14 05:29:53,486 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-12-14 05:29:53,502 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-12-14 05:29:53,526 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-12-14 05:29:53,554 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-12-14 05:29:53,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-12-14 05:29:53,610 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-12-14 05:29:53,631 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-12-14 05:29:53,761 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-12-14 05:29:53,815 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-12-14 05:29:53,877 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-12-14 05:29:53,952 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-12-14 05:29:53,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:29:54,000 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-12-14 05:29:54,034 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-12-14 05:29:54,076 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-12-14 05:29:54,146 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-12-14 05:29:54,226 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-12-14 05:29:54,285 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-12-14 05:29:54,307 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-12-14 05:29:54,331 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-12-14 05:29:54,358 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-12-14 05:29:54,379 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-12-14 05:29:54,401 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-12-14 05:29:54,423 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-12-14 05:29:54,509 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-12-14 05:29:54,592 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:29:57,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1851551068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:29:57,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:29:57,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [4, 4, 4] total 25 [2022-12-14 05:29:57,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8072846] [2022-12-14 05:29:57,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:29:57,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 05:29:57,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:29:57,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 05:29:57,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2022-12-14 05:29:57,733 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-12-14 05:30:02,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:30:02,831 INFO L93 Difference]: Finished difference Result 350 states and 356 transitions. [2022-12-14 05:30:02,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 05:30:02,831 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-12-14 05:30:02,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:30:02,832 INFO L225 Difference]: With dead ends: 350 [2022-12-14 05:30:02,832 INFO L226 Difference]: Without dead ends: 346 [2022-12-14 05:30:02,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 265 SyntacticMatches, 70 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=349, Invalid=1457, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 05:30:02,833 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 522 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:30:02,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 72 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 05:30:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-12-14 05:30:02,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 208. [2022-12-14 05:30:02,840 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-12-14 05:30:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 212 transitions. [2022-12-14 05:30:02,840 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 212 transitions. Word has length 119 [2022-12-14 05:30:02,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:30:02,841 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 212 transitions. [2022-12-14 05:30:02,841 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-12-14 05:30:02,841 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 212 transitions. [2022-12-14 05:30:02,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-12-14 05:30:02,842 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:30:02,842 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-12-14 05:30:02,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 05:30:03,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:30:03,044 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-12-14 05:30:03,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:30:03,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1827392149, now seen corresponding path program 1 times [2022-12-14 05:30:03,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:30:03,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029473548] [2022-12-14 05:30:03,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:30:03,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:30:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:30:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 05:30:03,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:30:03,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029473548] [2022-12-14 05:30:03,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029473548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:30:03,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:30:03,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:30:03,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457725169] [2022-12-14 05:30:03,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:30:03,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:30:03,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:30:03,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:30:03,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:30:03,170 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-12-14 05:30:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:30:03,376 INFO L93 Difference]: Finished difference Result 306 states and 310 transitions. [2022-12-14 05:30:03,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:30:03,376 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-12-14 05:30:03,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:30:03,377 INFO L225 Difference]: With dead ends: 306 [2022-12-14 05:30:03,377 INFO L226 Difference]: Without dead ends: 304 [2022-12-14 05:30:03,378 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-12-14 05:30:03,378 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.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:30:03,379 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.2s Time] [2022-12-14 05:30:03,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-12-14 05:30:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 211. [2022-12-14 05:30:03,389 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-12-14 05:30:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 215 transitions. [2022-12-14 05:30:03,390 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 215 transitions. Word has length 150 [2022-12-14 05:30:03,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:30:03,390 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 215 transitions. [2022-12-14 05:30:03,391 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-12-14 05:30:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 215 transitions. [2022-12-14 05:30:03,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-12-14 05:30:03,392 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:30:03,392 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-12-14 05:30:03,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 05:30:03,392 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-12-14 05:30:03,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:30:03,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1969998529, now seen corresponding path program 1 times [2022-12-14 05:30:03,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:30:03,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727632910] [2022-12-14 05:30:03,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:30:03,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:30:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:30:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 05:30:03,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:30:03,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727632910] [2022-12-14 05:30:03,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727632910] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:30:03,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857286391] [2022-12-14 05:30:03,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:30:03,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:30:03,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:30:03,516 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:30:03,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 05:30:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:30:03,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:30:03,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:30:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 05:30:03,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:30:03,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857286391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:30:03,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:30:03,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 05:30:03,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958642115] [2022-12-14 05:30:03,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:30:03,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 05:30:03,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:30:03,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 05:30:03,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:30:03,643 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-12-14 05:30:03,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:30:03,887 INFO L93 Difference]: Finished difference Result 304 states and 308 transitions. [2022-12-14 05:30:03,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:30:03,888 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-12-14 05:30:03,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:30:03,889 INFO L225 Difference]: With dead ends: 304 [2022-12-14 05:30:03,889 INFO L226 Difference]: Without dead ends: 289 [2022-12-14 05:30:03,890 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-12-14 05:30:03,890 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 134 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:30:03,891 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.2s Time] [2022-12-14 05:30:03,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-12-14 05:30:03,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 196. [2022-12-14 05:30:03,898 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-12-14 05:30:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 200 transitions. [2022-12-14 05:30:03,898 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 200 transitions. Word has length 156 [2022-12-14 05:30:03,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:30:03,898 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 200 transitions. [2022-12-14 05:30:03,898 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-12-14 05:30:03,898 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 200 transitions. [2022-12-14 05:30:03,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-12-14 05:30:03,899 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:30:03,899 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-12-14 05:30:03,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 05:30:04,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 05:30:04,100 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-12-14 05:30:04,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:30:04,101 INFO L85 PathProgramCache]: Analyzing trace with hash -940411903, now seen corresponding path program 1 times [2022-12-14 05:30:04,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:30:04,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274545507] [2022-12-14 05:30:04,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:30:04,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:30:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:30:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 05:30:04,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:30:04,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274545507] [2022-12-14 05:30:04,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274545507] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:30:04,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254014683] [2022-12-14 05:30:04,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:30:04,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:30:04,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:30:04,228 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:30:04,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 05:30:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:30:04,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:30:04,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:30:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 05:30:04,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:30:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 05:30:04,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254014683] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:30:04,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [75768317] [2022-12-14 05:30:04,411 INFO L159 IcfgInterpreter]: Started Sifa with 143 locations of interest [2022-12-14 05:30:04,412 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:30:04,412 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:30:04,412 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:30:04,412 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:30:04,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:04,737 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 05:30:04,738 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-12-14 05:30:04,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:04,747 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-12-14 05:30:04,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:04,826 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-12-14 05:30:04,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:04,891 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-12-14 05:30:04,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:04,954 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-12-14 05:30:05,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,019 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-12-14 05:30:05,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:30:05,264 INFO L321 Elim1Store]: treesize reduction 94, result has 23.0 percent of original size [2022-12-14 05:30:05,264 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-12-14 05:30:05,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:05,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:30:05,786 INFO L321 Elim1Store]: treesize reduction 107, result has 6.1 percent of original size [2022-12-14 05:30:05,787 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-12-14 05:30:06,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:30:06,304 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-12-14 05:30:06,304 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-12-14 05:30:06,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:30:06,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:06,809 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-12-14 05:30:06,809 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-12-14 05:30:07,030 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-12-14 05:30:07,060 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-12-14 05:30:07,088 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-12-14 05:30:07,108 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-12-14 05:30:07,146 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-12-14 05:30:07,179 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-12-14 05:30:07,215 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-12-14 05:30:07,247 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-12-14 05:30:07,281 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-12-14 05:30:07,301 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-12-14 05:30:07,325 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-12-14 05:30:07,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-12-14 05:30:07,399 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-12-14 05:30:07,471 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-12-14 05:30:07,544 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-12-14 05:30:07,617 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-12-14 05:30:07,699 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-12-14 05:30:07,750 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-12-14 05:30:07,801 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-12-14 05:30:07,847 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-12-14 05:30:07,921 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-12-14 05:30:07,985 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-12-14 05:30:08,047 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-12-14 05:30:08,110 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-12-14 05:30:08,251 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-12-14 05:30:08,312 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-12-14 05:30:08,380 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-12-14 05:30:08,454 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-12-14 05:30:08,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:08,484 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-12-14 05:30:08,521 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-12-14 05:30:08,564 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-12-14 05:30:08,622 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-12-14 05:30:08,695 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-12-14 05:30:08,750 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-12-14 05:30:08,772 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-12-14 05:30:08,789 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-12-14 05:30:08,816 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-12-14 05:30:08,843 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-12-14 05:30:08,869 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-12-14 05:30:08,895 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-12-14 05:30:09,018 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-12-14 05:30:09,081 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-12-14 05:30:09,145 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-12-14 05:30:09,207 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-12-14 05:30:09,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:09,252 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-12-14 05:30:09,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:09,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:09,280 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-12-14 05:30:09,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:09,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:09,309 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-12-14 05:30:09,365 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-12-14 05:30:09,425 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-12-14 05:30:09,494 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-12-14 05:30:09,557 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-12-14 05:30:09,621 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-12-14 05:30:09,725 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-12-14 05:30:09,794 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-12-14 05:30:09,861 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-12-14 05:30:09,910 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-12-14 05:30:09,971 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:30:15,299 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-12-14 05:30:15,299 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 05:30:15,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:30:15,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-14 05:30:15,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053531584] [2022-12-14 05:30:15,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:30:15,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 05:30:15,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:30:15,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 05:30:15,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2022-12-14 05:30:15,300 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-12-14 05:30:15,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:30:15,733 INFO L93 Difference]: Finished difference Result 333 states and 340 transitions. [2022-12-14 05:30:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 05:30:15,733 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-12-14 05:30:15,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:30:15,735 INFO L225 Difference]: With dead ends: 333 [2022-12-14 05:30:15,735 INFO L226 Difference]: Without dead ends: 331 [2022-12-14 05:30:15,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 342 SyntacticMatches, 106 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2168 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2022-12-14 05:30:15,736 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 245 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:30:15,737 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.4s Time] [2022-12-14 05:30:15,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-12-14 05:30:15,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 236. [2022-12-14 05:30:15,745 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-12-14 05:30:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 242 transitions. [2022-12-14 05:30:15,746 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 242 transitions. Word has length 157 [2022-12-14 05:30:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:30:15,746 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 242 transitions. [2022-12-14 05:30:15,746 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-12-14 05:30:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 242 transitions. [2022-12-14 05:30:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-14 05:30:15,747 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:30:15,747 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-12-14 05:30:15,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 05:30:15,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 05:30:15,948 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-12-14 05:30:15,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:30:15,948 INFO L85 PathProgramCache]: Analyzing trace with hash 522409209, now seen corresponding path program 1 times [2022-12-14 05:30:15,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:30:15,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671747026] [2022-12-14 05:30:15,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:30:15,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:30:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:30:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 05:30:16,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:30:16,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671747026] [2022-12-14 05:30:16,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671747026] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:30:16,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621244581] [2022-12-14 05:30:16,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:30:16,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:30:16,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:30:16,051 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:30:16,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 05:30:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:30:16,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 05:30:16,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:30:16,167 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 05:30:16,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:30:16,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621244581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:30:16,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:30:16,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-14 05:30:16,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731781905] [2022-12-14 05:30:16,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:30:16,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 05:30:16,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:30:16,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 05:30:16,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 05:30:16,169 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-12-14 05:30:16,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:30:16,387 INFO L93 Difference]: Finished difference Result 329 states and 335 transitions. [2022-12-14 05:30:16,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:30:16,387 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-12-14 05:30:16,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:30:16,388 INFO L225 Difference]: With dead ends: 329 [2022-12-14 05:30:16,388 INFO L226 Difference]: Without dead ends: 328 [2022-12-14 05:30:16,388 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-12-14 05:30:16,389 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 272 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:30:16,389 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.2s Time] [2022-12-14 05:30:16,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-12-14 05:30:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 235. [2022-12-14 05:30:16,396 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-12-14 05:30:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 241 transitions. [2022-12-14 05:30:16,397 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 241 transitions. Word has length 160 [2022-12-14 05:30:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:30:16,397 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 241 transitions. [2022-12-14 05:30:16,397 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-12-14 05:30:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 241 transitions. [2022-12-14 05:30:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-14 05:30:16,397 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:30:16,398 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-12-14 05:30:16,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 05:30:16,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 05:30:16,599 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-12-14 05:30:16,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:30:16,599 INFO L85 PathProgramCache]: Analyzing trace with hash -985183260, now seen corresponding path program 1 times [2022-12-14 05:30:16,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:30:16,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059262376] [2022-12-14 05:30:16,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:30:16,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:30:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:30:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 05:30:16,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:30:16,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059262376] [2022-12-14 05:30:16,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059262376] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:30:16,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329765809] [2022-12-14 05:30:16,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:30:16,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:30:16,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:30:16,721 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:30:16,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 05:30:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:30:16,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 05:30:16,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:30:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 05:30:16,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:30:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 05:30:16,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329765809] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:30:16,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [82328413] [2022-12-14 05:30:16,869 INFO L159 IcfgInterpreter]: Started Sifa with 147 locations of interest [2022-12-14 05:30:16,869 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:30:16,870 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:30:16,870 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:30:16,870 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:30:17,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,127 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 05:30:17,127 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-12-14 05:30:17,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,137 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-12-14 05:30:17,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,199 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-12-14 05:30:17,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,260 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-12-14 05:30:17,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,327 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-12-14 05:30:17,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,386 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-12-14 05:30:17,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:30:17,638 INFO L321 Elim1Store]: treesize reduction 94, result has 23.0 percent of original size [2022-12-14 05:30:17,639 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-12-14 05:30:17,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:17,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:30:17,925 INFO L321 Elim1Store]: treesize reduction 107, result has 6.1 percent of original size [2022-12-14 05:30:17,926 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-12-14 05:30:18,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:30:18,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,193 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-12-14 05:30:18,193 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-12-14 05:30:18,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,435 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:30:18,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:18,449 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-12-14 05:30:18,449 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-12-14 05:30:18,568 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-12-14 05:30:18,593 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-12-14 05:30:18,611 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-12-14 05:30:18,632 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-12-14 05:30:18,664 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-12-14 05:30:18,695 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-12-14 05:30:18,726 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-12-14 05:30:18,759 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-12-14 05:30:18,787 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-12-14 05:30:18,805 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-12-14 05:30:18,825 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-12-14 05:30:18,845 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-12-14 05:30:18,891 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-12-14 05:30:18,967 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-12-14 05:30:19,040 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-12-14 05:30:19,112 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-12-14 05:30:19,200 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-12-14 05:30:19,252 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-12-14 05:30:19,306 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-12-14 05:30:19,370 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-12-14 05:30:19,440 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-12-14 05:30:19,501 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-12-14 05:30:19,561 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-12-14 05:30:19,619 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-12-14 05:30:19,761 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-12-14 05:30:19,814 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-12-14 05:30:19,867 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-12-14 05:30:19,925 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-12-14 05:30:19,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:19,963 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-12-14 05:30:20,002 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-12-14 05:30:20,054 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-12-14 05:30:20,102 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-12-14 05:30:20,164 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-12-14 05:30:20,226 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-12-14 05:30:20,242 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-12-14 05:30:20,261 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-12-14 05:30:20,287 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-12-14 05:30:20,314 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-12-14 05:30:20,337 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-12-14 05:30:20,361 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-12-14 05:30:20,486 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-12-14 05:30:20,536 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-12-14 05:30:20,601 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-12-14 05:30:20,659 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-12-14 05:30:20,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:20,696 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-12-14 05:30:20,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:20,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:20,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-12-14 05:30:20,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:20,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:30:20,746 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-12-14 05:30:20,789 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-12-14 05:30:20,851 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-12-14 05:30:20,902 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-12-14 05:30:20,962 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-12-14 05:30:21,012 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-12-14 05:30:21,111 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-12-14 05:30:21,173 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-12-14 05:30:21,235 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-12-14 05:30:21,465 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-12-14 05:30:21,518 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:30:26,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [82328413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:30:26,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:30:26,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [5, 5, 5] total 29 [2022-12-14 05:30:26,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442356814] [2022-12-14 05:30:26,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:30:26,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 05:30:26,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:30:26,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 05:30:26,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2022-12-14 05:30:26,186 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-12-14 05:30:30,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:30:30,429 INFO L93 Difference]: Finished difference Result 235 states and 241 transitions. [2022-12-14 05:30:30,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 05:30:30,429 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-12-14 05:30:30,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:30:30,430 INFO L225 Difference]: With dead ends: 235 [2022-12-14 05:30:30,430 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 05:30:30,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 351 SyntacticMatches, 107 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2650 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=388, Invalid=1682, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 05:30:30,430 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 272 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:30:30,431 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.1s Time] [2022-12-14 05:30:30,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 05:30:30,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 05:30:30,431 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-12-14 05:30:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 05:30:30,431 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2022-12-14 05:30:30,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:30:30,431 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 05:30:30,431 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-12-14 05:30:30,431 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 05:30:30,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 05:30:30,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 146 remaining) [2022-12-14 05:30:30,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 146 remaining) [2022-12-14 05:30:30,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 146 remaining) [2022-12-14 05:30:30,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 146 remaining) [2022-12-14 05:30:30,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 146 remaining) [2022-12-14 05:30:30,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 146 remaining) [2022-12-14 05:30:30,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 146 remaining) [2022-12-14 05:30:30,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 146 remaining) [2022-12-14 05:30:30,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 146 remaining) [2022-12-14 05:30:30,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 146 remaining) [2022-12-14 05:30:30,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 146 remaining) [2022-12-14 05:30:30,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 146 remaining) [2022-12-14 05:30:30,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 146 remaining) [2022-12-14 05:30:30,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 146 remaining) [2022-12-14 05:30:30,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 146 remaining) [2022-12-14 05:30:30,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 146 remaining) [2022-12-14 05:30:30,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 146 remaining) [2022-12-14 05:30:30,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 146 remaining) [2022-12-14 05:30:30,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 146 remaining) [2022-12-14 05:30:30,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 146 remaining) [2022-12-14 05:30:30,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 146 remaining) [2022-12-14 05:30:30,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 146 remaining) [2022-12-14 05:30:30,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 146 remaining) [2022-12-14 05:30:30,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 146 remaining) [2022-12-14 05:30:30,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 146 remaining) [2022-12-14 05:30:30,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 146 remaining) [2022-12-14 05:30:30,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 146 remaining) [2022-12-14 05:30:30,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 146 remaining) [2022-12-14 05:30:30,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 146 remaining) [2022-12-14 05:30:30,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 146 remaining) [2022-12-14 05:30:30,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 146 remaining) [2022-12-14 05:30:30,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 146 remaining) [2022-12-14 05:30:30,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 146 remaining) [2022-12-14 05:30:30,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 146 remaining) [2022-12-14 05:30:30,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 146 remaining) [2022-12-14 05:30:30,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 146 remaining) [2022-12-14 05:30:30,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 146 remaining) [2022-12-14 05:30:30,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 146 remaining) [2022-12-14 05:30:30,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 146 remaining) [2022-12-14 05:30:30,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 146 remaining) [2022-12-14 05:30:30,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 146 remaining) [2022-12-14 05:30:30,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 146 remaining) [2022-12-14 05:30:30,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 146 remaining) [2022-12-14 05:30:30,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 146 remaining) [2022-12-14 05:30:30,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 146 remaining) [2022-12-14 05:30:30,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 146 remaining) [2022-12-14 05:30:30,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 146 remaining) [2022-12-14 05:30:30,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 146 remaining) [2022-12-14 05:30:30,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 146 remaining) [2022-12-14 05:30:30,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 146 remaining) [2022-12-14 05:30:30,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 146 remaining) [2022-12-14 05:30:30,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 146 remaining) [2022-12-14 05:30:30,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 146 remaining) [2022-12-14 05:30:30,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 146 remaining) [2022-12-14 05:30:30,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 146 remaining) [2022-12-14 05:30:30,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 146 remaining) [2022-12-14 05:30:30,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 146 remaining) [2022-12-14 05:30:30,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 146 remaining) [2022-12-14 05:30:30,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 146 remaining) [2022-12-14 05:30:30,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 146 remaining) [2022-12-14 05:30:30,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 146 remaining) [2022-12-14 05:30:30,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 146 remaining) [2022-12-14 05:30:30,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 146 remaining) [2022-12-14 05:30:30,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 146 remaining) [2022-12-14 05:30:30,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 146 remaining) [2022-12-14 05:30:30,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 146 remaining) [2022-12-14 05:30:30,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 146 remaining) [2022-12-14 05:30:30,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 146 remaining) [2022-12-14 05:30:30,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 146 remaining) [2022-12-14 05:30:30,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 146 remaining) [2022-12-14 05:30:30,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 146 remaining) [2022-12-14 05:30:30,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 146 remaining) [2022-12-14 05:30:30,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 146 remaining) [2022-12-14 05:30:30,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 146 remaining) [2022-12-14 05:30:30,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 146 remaining) [2022-12-14 05:30:30,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 146 remaining) [2022-12-14 05:30:30,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 146 remaining) [2022-12-14 05:30:30,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 146 remaining) [2022-12-14 05:30:30,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 146 remaining) [2022-12-14 05:30:30,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 146 remaining) [2022-12-14 05:30:30,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 146 remaining) [2022-12-14 05:30:30,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 146 remaining) [2022-12-14 05:30:30,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 146 remaining) [2022-12-14 05:30:30,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 146 remaining) [2022-12-14 05:30:30,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 146 remaining) [2022-12-14 05:30:30,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 146 remaining) [2022-12-14 05:30:30,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 146 remaining) [2022-12-14 05:30:30,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 146 remaining) [2022-12-14 05:30:30,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 146 remaining) [2022-12-14 05:30:30,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 146 remaining) [2022-12-14 05:30:30,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 146 remaining) [2022-12-14 05:30:30,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 146 remaining) [2022-12-14 05:30:30,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 146 remaining) [2022-12-14 05:30:30,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 146 remaining) [2022-12-14 05:30:30,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 146 remaining) [2022-12-14 05:30:30,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 146 remaining) [2022-12-14 05:30:30,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 146 remaining) [2022-12-14 05:30:30,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 146 remaining) [2022-12-14 05:30:30,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 146 remaining) [2022-12-14 05:30:30,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 146 remaining) [2022-12-14 05:30:30,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 146 remaining) [2022-12-14 05:30:30,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 146 remaining) [2022-12-14 05:30:30,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 146 remaining) [2022-12-14 05:30:30,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 146 remaining) [2022-12-14 05:30:30,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 146 remaining) [2022-12-14 05:30:30,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 146 remaining) [2022-12-14 05:30:30,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 146 remaining) [2022-12-14 05:30:30,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 146 remaining) [2022-12-14 05:30:30,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 146 remaining) [2022-12-14 05:30:30,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 146 remaining) [2022-12-14 05:30:30,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 146 remaining) [2022-12-14 05:30:30,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 146 remaining) [2022-12-14 05:30:30,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 146 remaining) [2022-12-14 05:30:30,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 146 remaining) [2022-12-14 05:30:30,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 146 remaining) [2022-12-14 05:30:30,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 146 remaining) [2022-12-14 05:30:30,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 146 remaining) [2022-12-14 05:30:30,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 146 remaining) [2022-12-14 05:30:30,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 146 remaining) [2022-12-14 05:30:30,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 146 remaining) [2022-12-14 05:30:30,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 146 remaining) [2022-12-14 05:30:30,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 146 remaining) [2022-12-14 05:30:30,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 146 remaining) [2022-12-14 05:30:30,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 146 remaining) [2022-12-14 05:30:30,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 146 remaining) [2022-12-14 05:30:30,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 146 remaining) [2022-12-14 05:30:30,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 146 remaining) [2022-12-14 05:30:30,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 146 remaining) [2022-12-14 05:30:30,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 146 remaining) [2022-12-14 05:30:30,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 146 remaining) [2022-12-14 05:30:30,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 146 remaining) [2022-12-14 05:30:30,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 146 remaining) [2022-12-14 05:30:30,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 146 remaining) [2022-12-14 05:30:30,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 146 remaining) [2022-12-14 05:30:30,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 146 remaining) [2022-12-14 05:30:30,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 146 remaining) [2022-12-14 05:30:30,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 146 remaining) [2022-12-14 05:30:30,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 146 remaining) [2022-12-14 05:30:30,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 146 remaining) [2022-12-14 05:30:30,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 146 remaining) [2022-12-14 05:30:30,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 146 remaining) [2022-12-14 05:30:30,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr141ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 146 remaining) [2022-12-14 05:30:30,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 146 remaining) [2022-12-14 05:30:30,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 146 remaining) [2022-12-14 05:30:30,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 146 remaining) [2022-12-14 05:30:30,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 146 remaining) [2022-12-14 05:30:30,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 05:30:30,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:30:30,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 05:30:32,636 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-12-14 05:30:32,636 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-12-14 05:30:32,636 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-12-14 05:30:32,636 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW(line 67) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point L69-2(line 69) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point L69-3(line 69) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point L69-4(line 69) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point L69-5(line 69) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point L69-6(line 69) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point L37-1(line 37) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point L70-2(line 70) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point L37-2(line 37) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point L70-3(line 70) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point L37-3(line 37) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point L70-4(line 70) no Hoare annotation was computed. [2022-12-14 05:30:32,637 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point L70-5(line 70) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point L70-6(line 70) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point L70-7(line 70) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW(line 74) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point L71-2(line 71) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point L71-3(line 71) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point L71-4(line 71) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point L71-5(line 71) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point L71-6(line 71) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point L71-7(line 71) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW(line 67) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point L39-1(line 39) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point L39-2(line 39) no Hoare annotation was computed. [2022-12-14 05:30:32,638 INFO L899 garLoopResultBuilder]: For program point L39-3(line 39) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point L39-4(line 39) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point L39-5(line 39) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point L39-6(line 39) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW(line 52) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point L40-1(line 40) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point L40-2(line 40) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point L40-3(line 40) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point L40-4(line 40) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point L40-5(line 40) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point L40-6(line 40) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point L40-7(line 40) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW(line 74) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point L74-1(line 74) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 74 87) no Hoare annotation was computed. [2022-12-14 05:30:32,639 INFO L899 garLoopResultBuilder]: For program point L41-2(line 41) no Hoare annotation was computed. [2022-12-14 05:30:32,640 INFO L899 garLoopResultBuilder]: For program point L41-3(line 41) no Hoare annotation was computed. [2022-12-14 05:30:32,640 INFO L899 garLoopResultBuilder]: For program point L41-4(line 41) no Hoare annotation was computed. [2022-12-14 05:30:32,640 INFO L899 garLoopResultBuilder]: For program point L74-5(line 74) no Hoare annotation was computed. [2022-12-14 05:30:32,640 INFO L899 garLoopResultBuilder]: For program point L41-5(line 41) no Hoare annotation was computed. [2022-12-14 05:30:32,640 INFO L899 garLoopResultBuilder]: For program point L74-6(line 74) no Hoare annotation was computed. [2022-12-14 05:30:32,640 INFO L899 garLoopResultBuilder]: For program point L41-6(line 41) no Hoare annotation was computed. [2022-12-14 05:30:32,640 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-12-14 05:30:32,640 INFO L899 garLoopResultBuilder]: For program point L41-7(line 41) no Hoare annotation was computed. [2022-12-14 05:30:32,640 INFO L899 garLoopResultBuilder]: For program point L74-8(lines 74 87) no Hoare annotation was computed. [2022-12-14 05:30:32,640 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-12-14 05:30:32,640 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-12-14 05:30:32,640 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-12-14 05:30:32,641 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW(line 63) no Hoare annotation was computed. [2022-12-14 05:30:32,641 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-12-14 05:30:32,641 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-12-14 05:30:32,641 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-12-14 05:30:32,641 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-12-14 05:30:32,641 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-12-14 05:30:32,641 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 83) no Hoare annotation was computed. [2022-12-14 05:30:32,641 INFO L899 garLoopResultBuilder]: For program point L76-2(lines 76 83) no Hoare annotation was computed. [2022-12-14 05:30:32,641 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW(line 74) no Hoare annotation was computed. [2022-12-14 05:30:32,641 INFO L899 garLoopResultBuilder]: For program point L44-1(line 44) no Hoare annotation was computed. [2022-12-14 05:30:32,641 INFO L899 garLoopResultBuilder]: For program point L44-2(lines 44 57) no Hoare annotation was computed. [2022-12-14 05:30:32,641 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 13 95) the Hoare annotation is: true [2022-12-14 05:30:32,641 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-12-14 05:30:32,641 INFO L899 garLoopResultBuilder]: For program point L44-5(line 44) no Hoare annotation was computed. [2022-12-14 05:30:32,641 INFO L899 garLoopResultBuilder]: For program point L44-6(line 44) no Hoare annotation was computed. [2022-12-14 05:30:32,642 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-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW(line 82) no Hoare annotation was computed. [2022-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point L44-8(lines 44 57) no Hoare annotation was computed. [2022-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2022-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2022-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2022-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point L78-2(line 78) no Hoare annotation was computed. [2022-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point L78-3(line 78) no Hoare annotation was computed. [2022-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2022-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW(line 67) no Hoare annotation was computed. [2022-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 53) no Hoare annotation was computed. [2022-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point L46-2(lines 46 53) no Hoare annotation was computed. [2022-12-14 05:30:32,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW(line 48) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW(line 89) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point L48-1(line 48) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point L48-2(line 48) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point L48-3(line 48) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW(line 67) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point L82-1(line 82) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 93) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point L82-2(line 82) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point L82-3(line 82) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 16 93) no Hoare annotation was computed. [2022-12-14 05:30:32,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point L84-2(line 84) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point L84-3(line 84) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW(line 89) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point L84-4(line 84) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point L84-5(line 84) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point L84-6(line 84) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW(line 48) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point L52-1(line 52) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point L85-2(line 85) no Hoare annotation was computed. [2022-12-14 05:30:32,644 INFO L899 garLoopResultBuilder]: For program point L52-2(line 52) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L85-3(line 85) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L52-3(line 52) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L85-4(line 85) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L85-5(line 85) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L85-6(line 85) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L85-7(line 85) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L86-2(line 86) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L86-3(line 86) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L86-4(line 86) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L86-5(line 86) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L86-6(line 86) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L86-7(line 86) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L54(line 54) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L54-1(line 54) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L54-2(line 54) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L54-3(line 54) no Hoare annotation was computed. [2022-12-14 05:30:32,645 INFO L899 garLoopResultBuilder]: For program point L54-4(line 54) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point L54-5(line 54) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point L54-6(line 54) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW(line 82) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point L55-2(line 55) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point L55-3(line 55) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point L55-4(line 55) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point L55-5(line 55) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point L55-6(line 55) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point L55-7(line 55) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point L56-1(line 56) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point L56-2(line 56) no Hoare annotation was computed. [2022-12-14 05:30:32,646 INFO L899 garLoopResultBuilder]: For program point L89-3(line 89) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point L56-3(line 56) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point L89-4(line 89) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point L56-4(line 56) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-12-14 05:30:32,647 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-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point L56-5(line 56) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point L56-6(line 56) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point L56-7(line 56) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW(line 48) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW(line 82) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW(line 48) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-12-14 05:30:32,647 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2022-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point L59-2(lines 59 72) no Hoare annotation was computed. [2022-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point L59-5(line 59) no Hoare annotation was computed. [2022-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point L59-6(line 59) no Hoare annotation was computed. [2022-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-12-14 05:30:32,648 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-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point L59-8(lines 59 72) no Hoare annotation was computed. [2022-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr141ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW(line 52) no Hoare annotation was computed. [2022-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 68) no Hoare annotation was computed. [2022-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-12-14 05:30:32,648 INFO L899 garLoopResultBuilder]: For program point L61-2(lines 61 68) no Hoare annotation was computed. [2022-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW(line 63) no Hoare annotation was computed. [2022-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW(line 52) no Hoare annotation was computed. [2022-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point L29-2(lines 29 42) no Hoare annotation was computed. [2022-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point L29-5(line 29) no Hoare annotation was computed. [2022-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point L29-6(line 29) no Hoare annotation was computed. [2022-12-14 05:30:32,649 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-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point L29-8(lines 29 42) no Hoare annotation was computed. [2022-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW(line 74) no Hoare annotation was computed. [2022-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2022-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2022-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point L63-2(line 63) no Hoare annotation was computed. [2022-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point L63-3(line 63) no Hoare annotation was computed. [2022-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-12-14 05:30:32,649 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 38) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point L31-2(lines 31 38) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW(line 84) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW(line 54) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW(line 63) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point L33-2(line 33) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point L33-3(line 33) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW(line 86) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW(line 63) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-12-14 05:30:32,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-12-14 05:30:32,651 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2022-12-14 05:30:32,651 INFO L899 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2022-12-14 05:30:32,651 INFO L899 garLoopResultBuilder]: For program point L67-2(line 67) no Hoare annotation was computed. [2022-12-14 05:30:32,651 INFO L899 garLoopResultBuilder]: For program point L67-3(line 67) no Hoare annotation was computed. [2022-12-14 05:30:32,651 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW(line 52) no Hoare annotation was computed. [2022-12-14 05:30:32,651 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW(line 85) no Hoare annotation was computed. [2022-12-14 05:30:32,651 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-12-14 05:30:32,651 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW(line 82) no Hoare annotation was computed. [2022-12-14 05:30:32,653 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-12-14 05:30:32,655 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 05:30:32,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 05:30:32 BoogieIcfgContainer [2022-12-14 05:30:32,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 05:30:32,679 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 05:30:32,679 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 05:30:32,680 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 05:30:32,680 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:29:31" (3/4) ... [2022-12-14 05:30:32,682 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 05:30:32,692 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-12-14 05:30:32,692 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-12-14 05:30:32,693 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-14 05:30:32,693 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 05:30:32,693 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 05:30:32,710 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-12-14 05:30:32,711 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-12-14 05:30:32,711 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-12-14 05:30:32,711 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-12-14 05:30:32,711 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-12-14 05:30:32,730 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 05:30:32,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 05:30:32,731 INFO L158 Benchmark]: Toolchain (without parser) took 62506.14ms. Allocated memory was 165.7MB in the beginning and 415.2MB in the end (delta: 249.6MB). Free memory was 105.3MB in the beginning and 300.2MB in the end (delta: -194.9MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2022-12-14 05:30:32,731 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 102.8MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 05:30:32,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.74ms. Allocated memory is still 165.7MB. Free memory was 105.2MB in the beginning and 136.4MB in the end (delta: -31.2MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2022-12-14 05:30:32,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.69ms. Allocated memory is still 165.7MB. Free memory was 136.4MB in the beginning and 133.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 05:30:32,731 INFO L158 Benchmark]: Boogie Preprocessor took 26.27ms. Allocated memory is still 165.7MB. Free memory was 133.4MB in the beginning and 131.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 05:30:32,731 INFO L158 Benchmark]: RCFGBuilder took 623.49ms. Allocated memory is still 165.7MB. Free memory was 131.3MB in the beginning and 94.0MB in the end (delta: 37.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-12-14 05:30:32,731 INFO L158 Benchmark]: TraceAbstraction took 61557.94ms. Allocated memory was 165.7MB in the beginning and 415.2MB in the end (delta: 249.6MB). Free memory was 93.6MB in the beginning and 307.5MB in the end (delta: -214.0MB). Peak memory consumption was 217.0MB. Max. memory is 16.1GB. [2022-12-14 05:30:32,732 INFO L158 Benchmark]: Witness Printer took 50.93ms. Allocated memory is still 415.2MB. Free memory was 307.5MB in the beginning and 300.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-14 05:30:32,732 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.12ms. Allocated memory is still 102.8MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.74ms. Allocated memory is still 165.7MB. Free memory was 105.2MB in the beginning and 136.4MB in the end (delta: -31.2MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.69ms. Allocated memory is still 165.7MB. Free memory was 136.4MB in the beginning and 133.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.27ms. Allocated memory is still 165.7MB. Free memory was 133.4MB in the beginning and 131.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 623.49ms. Allocated memory is still 165.7MB. Free memory was 131.3MB in the beginning and 94.0MB in the end (delta: 37.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 61557.94ms. Allocated memory was 165.7MB in the beginning and 415.2MB in the end (delta: 249.6MB). Free memory was 93.6MB in the beginning and 307.5MB in the end (delta: -214.0MB). Peak memory consumption was 217.0MB. Max. memory is 16.1GB. * Witness Printer took 50.93ms. Allocated memory is still 415.2MB. Free memory was 307.5MB in the beginning and 300.2MB 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: 61.5s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5040 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5040 mSDsluCounter, 4009 SdHoareTripleChecker+Invalid, 6.4s 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, 24.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.2s 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, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s 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: 11.8s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 297, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 1146, TOOLS_POST_TIME: 10.7s, 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: 10.4s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 1501, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 28, DOMAIN_JOIN_TIME: 0.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 16, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 25, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 297, DOMAIN_ISBOTTOM_TIME: 0.4s, LOOP_SUMMARIZER_APPLICATIONS: 9, LOOP_SUMMARIZER_CACHE_MISSES: 9, LOOP_SUMMARIZER_OVERALL_TIME: 9.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 9.0s, 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.3s, 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-12-14 05:30:32,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25adf223-e462-4114-97bc-574b660cce56/bin/utaipan-gh47qXpMRh/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