./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_17_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS --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 64bit --witnessprinter.graph.data.programhash 45da0ec55e80675b886f8e641f164866abb91ea1313f371255aeb32277275561 --- 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-8393723 [2022-11-19 07:26:10,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:26:10,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:26:10,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:26:10,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:26:10,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:26:10,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:26:10,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:26:10,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:26:10,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:26:10,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:26:10,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:26:10,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:26:10,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:26:10,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:26:10,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:26:10,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:26:10,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:26:10,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:26:10,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:26:10,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:26:10,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:26:10,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:26:10,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:26:10,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:26:10,161 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:26:10,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:26:10,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:26:10,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:26:10,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:26:10,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:26:10,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:26:10,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:26:10,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:26:10,175 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:26:10,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:26:10,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:26:10,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:26:10,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:26:10,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:26:10,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:26:10,180 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-19 07:26:10,229 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:26:10,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:26:10,230 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:26:10,231 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:26:10,232 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:26:10,232 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:26:10,232 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:26:10,233 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:26:10,233 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:26:10,233 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:26:10,234 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:26:10,234 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:26:10,235 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:26:10,235 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:26:10,235 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:26:10,236 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:26:10,236 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:26:10,236 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:26:10,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:26:10,238 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:26:10,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:26:10,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:26:10,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:26:10,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:26:10,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:26:10,239 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-19 07:26:10,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:26:10,240 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:26:10,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:26:10,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:26:10,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:26:10,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:26:10,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:26:10,241 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:26:10,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:26:10,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:26:10,242 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:26:10,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:26:10,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:26:10,243 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:26:10,243 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_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/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_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45da0ec55e80675b886f8e641f164866abb91ea1313f371255aeb32277275561 [2022-11-19 07:26:10,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:26:10,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:26:10,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:26:10,559 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:26:10,560 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:26:10,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_17_good.i [2022-11-19 07:26:10,658 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/data/f7ea3f597/9c3b731c4197432493e2d7bbf36581f7/FLAG3e1c3f27a [2022-11-19 07:26:11,330 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:26:11,331 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_17_good.i [2022-11-19 07:26:11,354 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/data/f7ea3f597/9c3b731c4197432493e2d7bbf36581f7/FLAG3e1c3f27a [2022-11-19 07:26:11,534 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/data/f7ea3f597/9c3b731c4197432493e2d7bbf36581f7 [2022-11-19 07:26:11,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:26:11,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:26:11,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:26:11,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:26:11,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:26:11,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:26:11" (1/1) ... [2022-11-19 07:26:11,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b04301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:26:11, skipping insertion in model container [2022-11-19 07:26:11,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:26:11" (1/1) ... [2022-11-19 07:26:11,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:26:11,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:26:12,219 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-19 07:26:12,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:26:12,980 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:26:13,000 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-19 07:26:13,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:26:13,198 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:26:13,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:26:13 WrapperNode [2022-11-19 07:26:13,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:26:13,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:26:13,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:26:13,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:26:13,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:26:13" (1/1) ... [2022-11-19 07:26:13,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:26:13" (1/1) ... [2022-11-19 07:26:13,268 INFO L138 Inliner]: procedures = 501, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 107 [2022-11-19 07:26:13,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:26:13,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:26:13,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:26:13,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:26:13,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:26:13" (1/1) ... [2022-11-19 07:26:13,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:26:13" (1/1) ... [2022-11-19 07:26:13,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:26:13" (1/1) ... [2022-11-19 07:26:13,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:26:13" (1/1) ... [2022-11-19 07:26:13,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:26:13" (1/1) ... [2022-11-19 07:26:13,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:26:13" (1/1) ... [2022-11-19 07:26:13,349 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:26:13" (1/1) ... [2022-11-19 07:26:13,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:26:13" (1/1) ... [2022-11-19 07:26:13,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:26:13,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:26:13,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:26:13,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:26:13,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:26:13" (1/1) ... [2022-11-19 07:26:13,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:26:13,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:26:13,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:26:13,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:26:13,458 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-19 07:26:13,459 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-19 07:26:13,459 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-19 07:26:13,459 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-19 07:26:13,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:26:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 07:26:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:26:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:26:13,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:26:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:26:13,461 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-19 07:26:13,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:26:13,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:26:13,635 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:26:13,638 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:26:13,939 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:26:14,026 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:26:14,026 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-19 07:26:14,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:26:14 BoogieIcfgContainer [2022-11-19 07:26:14,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:26:14,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:26:14,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:26:14,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:26:14,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:26:11" (1/3) ... [2022-11-19 07:26:14,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a0aac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:26:14, skipping insertion in model container [2022-11-19 07:26:14,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:26:13" (2/3) ... [2022-11-19 07:26:14,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a0aac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:26:14, skipping insertion in model container [2022-11-19 07:26:14,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:26:14" (3/3) ... [2022-11-19 07:26:14,040 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_predec_17_good.i [2022-11-19 07:26:14,061 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:26:14,061 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-19 07:26:14,132 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:26:14,143 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;@34fe524b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:26:14,144 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-11-19 07:26:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 37 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 07:26:14,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 07:26:14,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:26:14,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:26:14,161 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-19 07:26:14,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:26:14,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1827108304, now seen corresponding path program 1 times [2022-11-19 07:26:14,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:26:14,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412217805] [2022-11-19 07:26:14,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:14,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:26:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:26:14,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:26:14,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412217805] [2022-11-19 07:26:14,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412217805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:26:14,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:26:14,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:26:14,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873121069] [2022-11-19 07:26:14,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:26:14,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:26:14,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:26:14,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:26:14,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:26:14,736 INFO L87 Difference]: Start difference. First operand has 44 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 37 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:26:14,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:26:14,868 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2022-11-19 07:26:14,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:26:14,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2022-11-19 07:26:14,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:26:14,881 INFO L225 Difference]: With dead ends: 85 [2022-11-19 07:26:14,881 INFO L226 Difference]: Without dead ends: 44 [2022-11-19 07:26:14,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:26:14,896 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:26:14,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 114 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:26:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-19 07:26:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-19 07:26:14,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 38 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:26:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-11-19 07:26:14,962 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 7 [2022-11-19 07:26:14,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:26:14,965 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-11-19 07:26:14,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:26:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-11-19 07:26:14,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 07:26:14,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:26:14,969 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:26:14,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:26:14,970 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-19 07:26:14,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:26:14,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1263002824, now seen corresponding path program 1 times [2022-11-19 07:26:14,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:26:14,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859848958] [2022-11-19 07:26:14,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:14,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:26:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:26:15,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:26:15,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859848958] [2022-11-19 07:26:15,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859848958] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:26:15,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61957386] [2022-11-19 07:26:15,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:15,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:26:15,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:26:15,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:26:15,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:26:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:15,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 07:26:15,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:26:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:26:15,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:26:15,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61957386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:26:15,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:26:15,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-19 07:26:15,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415665495] [2022-11-19 07:26:15,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:26:15,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:26:15,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:26:15,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:26:15,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:26:15,421 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:26:15,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:26:15,476 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2022-11-19 07:26:15,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:26:15,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-19 07:26:15,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:26:15,478 INFO L225 Difference]: With dead ends: 78 [2022-11-19 07:26:15,479 INFO L226 Difference]: Without dead ends: 40 [2022-11-19 07:26:15,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:26:15,481 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 32 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:26:15,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 79 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:26:15,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-19 07:26:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-19 07:26:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 34 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:26:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-11-19 07:26:15,489 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 10 [2022-11-19 07:26:15,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:26:15,490 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-11-19 07:26:15,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:26:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-11-19 07:26:15,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:26:15,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:26:15,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:26:15,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 07:26:15,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:26:15,720 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-19 07:26:15,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:26:15,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1729598038, now seen corresponding path program 1 times [2022-11-19 07:26:15,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:26:15,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850625158] [2022-11-19 07:26:15,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:15,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:26:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:15,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:26:15,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:26:15,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850625158] [2022-11-19 07:26:15,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850625158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:26:15,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:26:15,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:26:15,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154343789] [2022-11-19 07:26:15,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:26:15,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:26:15,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:26:15,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:26:15,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:26:15,954 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:26:16,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:26:16,062 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-11-19 07:26:16,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:26:16,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-19 07:26:16,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:26:16,065 INFO L225 Difference]: With dead ends: 40 [2022-11-19 07:26:16,065 INFO L226 Difference]: Without dead ends: 39 [2022-11-19 07:26:16,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:26:16,067 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:26:16,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 102 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:26:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-19 07:26:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-19 07:26:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.5) internal successors, (36), 33 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:26:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-11-19 07:26:16,086 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 12 [2022-11-19 07:26:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:26:16,087 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-11-19 07:26:16,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:26:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-11-19 07:26:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:26:16,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:26:16,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:26:16,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:26:16,095 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-19 07:26:16,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:26:16,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1729499335, now seen corresponding path program 1 times [2022-11-19 07:26:16,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:26:16,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387280310] [2022-11-19 07:26:16,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:16,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:26:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:26:16,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:26:16,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387280310] [2022-11-19 07:26:16,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387280310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:26:16,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:26:16,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:26:16,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031529050] [2022-11-19 07:26:16,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:26:16,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:26:16,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:26:16,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:26:16,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:26:16,225 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:26:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:26:16,286 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-11-19 07:26:16,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:26:16,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-19 07:26:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:26:16,288 INFO L225 Difference]: With dead ends: 69 [2022-11-19 07:26:16,288 INFO L226 Difference]: Without dead ends: 51 [2022-11-19 07:26:16,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:26:16,290 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:26:16,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 68 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:26:16,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-19 07:26:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-11-19 07:26:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 34 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:26:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-11-19 07:26:16,298 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 12 [2022-11-19 07:26:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:26:16,299 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-11-19 07:26:16,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:26:16,299 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-11-19 07:26:16,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:26:16,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:26:16,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:26:16,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:26:16,301 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-19 07:26:16,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:26:16,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2077931549, now seen corresponding path program 1 times [2022-11-19 07:26:16,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:26:16,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413110466] [2022-11-19 07:26:16,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:16,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:26:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:16,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:26:16,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:26:16,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413110466] [2022-11-19 07:26:16,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413110466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:26:16,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:26:16,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:26:16,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420361554] [2022-11-19 07:26:16,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:26:16,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:26:16,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:26:16,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:26:16,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:26:16,473 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:26:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:26:16,548 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-11-19 07:26:16,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:26:16,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-19 07:26:16,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:26:16,551 INFO L225 Difference]: With dead ends: 40 [2022-11-19 07:26:16,553 INFO L226 Difference]: Without dead ends: 39 [2022-11-19 07:26:16,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:26:16,556 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:26:16,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:26:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-19 07:26:16,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-19 07:26:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.44) internal successors, (36), 33 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:26:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-11-19 07:26:16,573 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 13 [2022-11-19 07:26:16,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:26:16,573 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-11-19 07:26:16,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:26:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-11-19 07:26:16,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:26:16,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:26:16,575 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:26:16,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:26:16,576 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-19 07:26:16,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:26:16,577 INFO L85 PathProgramCache]: Analyzing trace with hash -26369639, now seen corresponding path program 1 times [2022-11-19 07:26:16,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:26:16,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916473519] [2022-11-19 07:26:16,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:16,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:26:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 07:26:16,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:26:16,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916473519] [2022-11-19 07:26:16,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916473519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:26:16,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:26:16,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:26:16,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834166566] [2022-11-19 07:26:16,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:26:16,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:26:16,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:26:16,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:26:16,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:26:16,702 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:26:16,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:26:16,780 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-11-19 07:26:16,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:26:16,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-11-19 07:26:16,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:26:16,782 INFO L225 Difference]: With dead ends: 49 [2022-11-19 07:26:16,782 INFO L226 Difference]: Without dead ends: 47 [2022-11-19 07:26:16,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:26:16,784 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:26:16,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 94 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:26:16,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-19 07:26:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-19 07:26:16,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 40 states have internal predecessors, (43), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-19 07:26:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-11-19 07:26:16,794 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 16 [2022-11-19 07:26:16,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:26:16,794 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-11-19 07:26:16,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:26:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-11-19 07:26:16,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 07:26:16,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:26:16,796 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:26:16,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:26:16,796 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-19 07:26:16,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:26:16,797 INFO L85 PathProgramCache]: Analyzing trace with hash -448050471, now seen corresponding path program 1 times [2022-11-19 07:26:16,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:26:16,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939253008] [2022-11-19 07:26:16,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:16,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:26:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:26:16,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:26:16,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939253008] [2022-11-19 07:26:16,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939253008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:26:16,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:26:16,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:26:16,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691529847] [2022-11-19 07:26:16,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:26:16,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:26:16,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:26:16,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:26:16,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:26:16,882 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:26:16,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:26:16,939 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-11-19 07:26:16,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:26:16,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-11-19 07:26:16,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:26:16,944 INFO L225 Difference]: With dead ends: 65 [2022-11-19 07:26:16,944 INFO L226 Difference]: Without dead ends: 50 [2022-11-19 07:26:16,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:26:16,947 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:26:16,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 98 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:26:16,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-19 07:26:16,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-19 07:26:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 43 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-19 07:26:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-11-19 07:26:16,958 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 20 [2022-11-19 07:26:16,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:26:16,959 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-11-19 07:26:16,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:26:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-11-19 07:26:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 07:26:16,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:26:16,961 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:26:16,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:26:16,962 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-19 07:26:16,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:26:16,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1031286073, now seen corresponding path program 1 times [2022-11-19 07:26:16,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:26:16,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245544521] [2022-11-19 07:26:16,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:16,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:26:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-19 07:26:17,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:26:17,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245544521] [2022-11-19 07:26:17,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245544521] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:26:17,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823293790] [2022-11-19 07:26:17,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:17,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:26:17,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:26:17,054 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:26:17,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 07:26:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:17,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 07:26:17,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:26:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 07:26:17,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:26:17,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823293790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:26:17,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:26:17,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-19 07:26:17,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555934035] [2022-11-19 07:26:17,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:26:17,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:26:17,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:26:17,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:26:17,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:26:17,291 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 07:26:17,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:26:17,358 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-11-19 07:26:17,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:26:17,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2022-11-19 07:26:17,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:26:17,361 INFO L225 Difference]: With dead ends: 74 [2022-11-19 07:26:17,362 INFO L226 Difference]: Without dead ends: 40 [2022-11-19 07:26:17,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:26:17,366 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 39 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:26:17,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 68 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:26:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-19 07:26:17,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-19 07:26:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 34 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:26:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-11-19 07:26:17,383 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 24 [2022-11-19 07:26:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:26:17,383 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-11-19 07:26:17,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 07:26:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-11-19 07:26:17,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:26:17,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:26:17,385 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] [2022-11-19 07:26:17,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 07:26:17,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-19 07:26:17,592 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-19 07:26:17,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:26:17,593 INFO L85 PathProgramCache]: Analyzing trace with hash 886882175, now seen corresponding path program 1 times [2022-11-19 07:26:17,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:26:17,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123629746] [2022-11-19 07:26:17,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:17,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:26:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:26:17,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:26:17,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123629746] [2022-11-19 07:26:17,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123629746] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:26:17,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450574971] [2022-11-19 07:26:17,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:17,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:26:17,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:26:17,704 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:26:17,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 07:26:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:17,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 07:26:17,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:26:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:26:17,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:26:17,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450574971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:26:17,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:26:17,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-19 07:26:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459397538] [2022-11-19 07:26:17,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:26:17,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:26:17,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:26:17,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:26:17,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:26:17,891 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:26:17,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:26:17,948 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-11-19 07:26:17,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:26:17,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-11-19 07:26:17,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:26:17,950 INFO L225 Difference]: With dead ends: 54 [2022-11-19 07:26:17,950 INFO L226 Difference]: Without dead ends: 36 [2022-11-19 07:26:17,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:26:17,951 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:26:17,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 76 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:26:17,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-19 07:26:17,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-11-19 07:26:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 30 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:26:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-11-19 07:26:17,957 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 23 [2022-11-19 07:26:17,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:26:17,958 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-11-19 07:26:17,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:26:17,958 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-11-19 07:26:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 07:26:17,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:26:17,959 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:26:17,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 07:26:18,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-19 07:26:18,173 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-19 07:26:18,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:26:18,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1723549009, now seen corresponding path program 1 times [2022-11-19 07:26:18,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:26:18,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507685768] [2022-11-19 07:26:18,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:18,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:26:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:26:18,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:26:18,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507685768] [2022-11-19 07:26:18,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507685768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:26:18,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:26:18,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:26:18,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070334932] [2022-11-19 07:26:18,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:26:18,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:26:18,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:26:18,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:26:18,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:26:18,227 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:26:18,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:26:18,257 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-11-19 07:26:18,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:26:18,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-19 07:26:18,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:26:18,258 INFO L225 Difference]: With dead ends: 36 [2022-11-19 07:26:18,258 INFO L226 Difference]: Without dead ends: 35 [2022-11-19 07:26:18,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:26:18,259 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:26:18,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:26:18,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-19 07:26:18,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-19 07:26:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:26:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-11-19 07:26:18,266 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 24 [2022-11-19 07:26:18,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:26:18,266 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-11-19 07:26:18,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:26:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-11-19 07:26:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 07:26:18,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:26:18,268 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, 1] [2022-11-19 07:26:18,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:26:18,268 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-19 07:26:18,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:26:18,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1890411850, now seen corresponding path program 1 times [2022-11-19 07:26:18,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:26:18,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282631621] [2022-11-19 07:26:18,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:18,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:26:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:26:18,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:26:18,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282631621] [2022-11-19 07:26:18,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282631621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:26:18,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:26:18,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:26:18,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346611714] [2022-11-19 07:26:18,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:26:18,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:26:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:26:18,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:26:18,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:26:18,320 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:26:18,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:26:18,347 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-11-19 07:26:18,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:26:18,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-11-19 07:26:18,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:26:18,360 INFO L225 Difference]: With dead ends: 39 [2022-11-19 07:26:18,360 INFO L226 Difference]: Without dead ends: 38 [2022-11-19 07:26:18,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:26:18,361 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:26:18,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:26:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-19 07:26:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-19 07:26:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:26:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-11-19 07:26:18,368 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 25 [2022-11-19 07:26:18,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:26:18,369 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-11-19 07:26:18,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:26:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-11-19 07:26:18,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-19 07:26:18,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:26:18,370 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, 1, 1, 1, 1, 1, 1] [2022-11-19 07:26:18,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:26:18,371 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-19 07:26:18,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:26:18,371 INFO L85 PathProgramCache]: Analyzing trace with hash -744667383, now seen corresponding path program 1 times [2022-11-19 07:26:18,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:26:18,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308604147] [2022-11-19 07:26:18,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:18,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:26:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-19 07:26:18,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:26:18,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308604147] [2022-11-19 07:26:18,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308604147] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:26:18,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:26:18,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:26:18,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231260883] [2022-11-19 07:26:18,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:26:18,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:26:18,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:26:18,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:26:18,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:26:18,447 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 07:26:18,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:26:18,497 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-11-19 07:26:18,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:26:18,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-11-19 07:26:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:26:18,501 INFO L225 Difference]: With dead ends: 44 [2022-11-19 07:26:18,501 INFO L226 Difference]: Without dead ends: 42 [2022-11-19 07:26:18,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:26:18,502 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:26:18,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 79 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:26:18,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-19 07:26:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-19 07:26:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 07:26:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-11-19 07:26:18,515 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 30 [2022-11-19 07:26:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:26:18,516 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-11-19 07:26:18,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 07:26:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-11-19 07:26:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-19 07:26:18,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:26:18,519 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:26:18,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:26:18,519 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-19 07:26:18,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:26:18,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1503821664, now seen corresponding path program 1 times [2022-11-19 07:26:18,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:26:18,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647441084] [2022-11-19 07:26:18,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:18,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:26:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-19 07:26:18,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:26:18,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647441084] [2022-11-19 07:26:18,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647441084] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:26:18,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741495645] [2022-11-19 07:26:18,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:18,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:26:18,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:26:18,633 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:26:18,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 07:26:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:18,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 07:26:18,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:26:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:26:18,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:26:18,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:26:18,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741495645] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:26:18,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1242553778] [2022-11-19 07:26:18,934 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-19 07:26:18,935 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:26:18,939 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:26:18,945 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:26:18,946 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:26:19,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:19,338 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2022-11-19 07:26:19,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 50 [2022-11-19 07:26:19,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:26:19,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:19,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-19 07:26:19,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:19,495 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 07:26:19,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-11-19 07:26:19,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:26:19,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:26:19,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:19,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-19 07:26:19,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:26:20,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:20,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 49 [2022-11-19 07:26:22,267 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 84 for LOIs [2022-11-19 07:26:22,292 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 121 for LOIs [2022-11-19 07:26:22,402 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:26:31,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1242553778] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:26:31,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:26:31,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [5, 3, 3] total 26 [2022-11-19 07:26:31,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390368436] [2022-11-19 07:26:31,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:26:31,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-19 07:26:31,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:26:31,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-19 07:26:31,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-11-19 07:26:31,036 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 19 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 07:26:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:26:31,344 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-11-19 07:26:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-19 07:26:31,345 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2022-11-19 07:26:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:26:31,346 INFO L225 Difference]: With dead ends: 67 [2022-11-19 07:26:31,346 INFO L226 Difference]: Without dead ends: 66 [2022-11-19 07:26:31,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-11-19 07:26:31,347 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:26:31,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 88 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 173 Unchecked, 0.2s Time] [2022-11-19 07:26:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-19 07:26:31,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-19 07:26:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 55 states have internal predecessors, (59), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-19 07:26:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-11-19 07:26:31,371 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 34 [2022-11-19 07:26:31,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:26:31,371 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-11-19 07:26:31,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 07:26:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-11-19 07:26:31,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-19 07:26:31,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:26:31,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:26:31,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-19 07:26:31,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-19 07:26:31,579 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-19 07:26:31,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:26:31,580 INFO L85 PathProgramCache]: Analyzing trace with hash 504972015, now seen corresponding path program 1 times [2022-11-19 07:26:31,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:26:31,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418630585] [2022-11-19 07:26:31,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:31,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:26:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-19 07:26:31,736 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:26:31,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418630585] [2022-11-19 07:26:31,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418630585] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:26:31,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334416341] [2022-11-19 07:26:31,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:31,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:26:31,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:26:31,739 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:26:31,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 07:26:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:31,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 07:26:31,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:26:31,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:26:31,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:26:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:26:31,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334416341] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:26:31,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [328680839] [2022-11-19 07:26:31,995 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-19 07:26:31,995 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:26:31,996 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:26:31,996 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:26:31,996 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:26:32,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:26:32,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:26:32,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:32,189 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2022-11-19 07:26:32,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 50 [2022-11-19 07:26:32,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:32,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-19 07:26:32,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:32,305 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 07:26:32,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-11-19 07:26:32,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:32,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-19 07:26:32,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:26:32,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:26:32,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:32,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-11-19 07:26:32,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:26:32,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:26:32,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:32,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-11-19 07:26:32,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:26:33,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:26:33,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:33,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 49 [2022-11-19 07:26:34,289 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 139 for LOIs [2022-11-19 07:26:34,376 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 62 for LOIs [2022-11-19 07:26:34,387 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:26:43,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [328680839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:26:43,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:26:43,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [5, 3, 3] total 27 [2022-11-19 07:26:43,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260253344] [2022-11-19 07:26:43,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:26:43,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-19 07:26:43,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:26:43,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-19 07:26:43,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2022-11-19 07:26:43,166 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 07:26:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:26:43,610 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2022-11-19 07:26:43,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-19 07:26:43,611 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-11-19 07:26:43,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:26:43,612 INFO L225 Difference]: With dead ends: 68 [2022-11-19 07:26:43,612 INFO L226 Difference]: Without dead ends: 67 [2022-11-19 07:26:43,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2022-11-19 07:26:43,613 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:26:43,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 113 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 191 Unchecked, 0.4s Time] [2022-11-19 07:26:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-19 07:26:43,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-19 07:26:43,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 55 states have internal predecessors, (59), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-19 07:26:43,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2022-11-19 07:26:43,645 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 36 [2022-11-19 07:26:43,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:26:43,646 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2022-11-19 07:26:43,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 07:26:43,646 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2022-11-19 07:26:43,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-19 07:26:43,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:26:43,647 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] [2022-11-19 07:26:43,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 07:26:43,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:26:43,854 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-19 07:26:43,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:26:43,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1367789939, now seen corresponding path program 1 times [2022-11-19 07:26:43,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:26:43,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475901952] [2022-11-19 07:26:43,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:43,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:26:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-19 07:26:43,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:26:43,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475901952] [2022-11-19 07:26:43,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475901952] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:26:43,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328964568] [2022-11-19 07:26:43,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:43,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:26:43,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:26:43,958 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:26:43,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 07:26:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:44,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 07:26:44,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:26:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-19 07:26:44,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:26:44,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328964568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:26:44,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:26:44,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-19 07:26:44,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661526237] [2022-11-19 07:26:44,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:26:44,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:26:44,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:26:44,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:26:44,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:26:44,124 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-19 07:26:44,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:26:44,185 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-11-19 07:26:44,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:26:44,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 39 [2022-11-19 07:26:44,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:26:44,188 INFO L225 Difference]: With dead ends: 73 [2022-11-19 07:26:44,189 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 07:26:44,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:26:44,197 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:26:44,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:26:44,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 07:26:44,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 07:26:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:26:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 07:26:44,200 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-11-19 07:26:44,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:26:44,200 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 07:26:44,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-19 07:26:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 07:26:44,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 07:26:44,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2022-11-19 07:26:44,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2022-11-19 07:26:44,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2022-11-19 07:26:44,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2022-11-19 07:26:44,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2022-11-19 07:26:44,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2022-11-19 07:26:44,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2022-11-19 07:26:44,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2022-11-19 07:26:44,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2022-11-19 07:26:44,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2022-11-19 07:26:44,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2022-11-19 07:26:44,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2022-11-19 07:26:44,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 07:26:44,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:26:44,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 07:26:52,526 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-19 07:26:52,527 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-19 07:26:52,527 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-19 07:26:52,527 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-19 07:26:52,527 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1561) no Hoare annotation was computed. [2022-11-19 07:26:52,527 INFO L895 garLoopResultBuilder]: At program point L1567(line 1567) the Hoare annotation is: (let ((.cse0 (+ (select (select |#memory_int| |ULTIMATE.start_goodB2G_~#data~0#1.base|) |ULTIMATE.start_goodB2G_~#data~0#1.offset|) 2147483648))) (and (<= 0 ~GLOBAL_CONST_FALSE~0) (<= 0 .cse0) (= |ULTIMATE.start_goodB2G_~k~0#1| 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (<= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#length| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 4) (<= ~GLOBAL_CONST_TRUE~0 1) (<= ~globalArgv~0.offset 0) (= (select (select |#memory_int| 1) 0) 0) (<= ~GLOBAL_CONST_FIVE~0 5) (= (select |#valid| 3) 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= 1 ~GLOBAL_CONST_TRUE~0) (= (select |#valid| 4) 1) (= (select |#length| 3) 18) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (<= ~GLOBAL_CONST_FALSE~0 0) (= 54 (select |#length| 2)) (= (select |#length| 1) 1) (<= 0 ~globalArgv~0.offset) (= (select |#valid| 2) 1) (= 16 (select |#length| 4)) (= |#NULL.offset| 0) (<= .cse0 0) (= ~globalFalse~0 0) (= |ULTIMATE.start_goodB2G_~i~1#1| 1) (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G_~#data~0#1.base|) (= ~globalArgc~0 0) (= (select |#valid| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 1) (= 5 ~globalFive~0) (= |ULTIMATE.start_goodB2G_~#data~0#1.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1))) [2022-11-19 07:26:52,528 INFO L899 garLoopResultBuilder]: For program point L1567-1(lines 1557 1569) no Hoare annotation was computed. [2022-11-19 07:26:52,528 INFO L895 garLoopResultBuilder]: At program point L1563(line 1563) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_goodB2G_~#data~0#1.base|) |ULTIMATE.start_goodB2G_~#data~0#1.offset|))) (and (<= 0 (+ .cse0 2147483648)) (= ~GLOBAL_CONST_FALSE~0 0) (= |ULTIMATE.start_goodB2G_~k~0#1| 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (<= .cse0 2147483646) (= (select |#length| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 4) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G_~result~0#1| .cse0) (= (select |#valid| 4) 1) (= (select |#length| 3) 18) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (= 54 (select |#length| 2)) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 16 (select |#length| 4)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= |ULTIMATE.start_goodB2G_~i~1#1| 1) (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G_~#data~0#1.base|) (= ~globalArgc~0 0) (= (select |#valid| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 1) (= 5 ~globalFive~0) (= |ULTIMATE.start_goodB2G_~#data~0#1.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1))) [2022-11-19 07:26:52,528 INFO L899 garLoopResultBuilder]: For program point L1559(lines 1559 1568) no Hoare annotation was computed. [2022-11-19 07:26:52,528 INFO L899 garLoopResultBuilder]: For program point L1580-2(line 1580) no Hoare annotation was computed. [2022-11-19 07:26:52,529 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1580) no Hoare annotation was computed. [2022-11-19 07:26:52,529 INFO L899 garLoopResultBuilder]: For program point L1580-3(line 1580) no Hoare annotation was computed. [2022-11-19 07:26:52,529 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1576) no Hoare annotation was computed. [2022-11-19 07:26:52,530 INFO L895 garLoopResultBuilder]: At program point L1580-4(lines 1580 1587) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_goodG2B_~j~0#1| 1)) (.cse12 (= (+ |ULTIMATE.start_goodG2B_~data~1#1| 3) 0)) (.cse20 (= |ULTIMATE.start_goodG2B_~result~1#1| |ULTIMATE.start_goodG2B_~data~1#1|)) (.cse35 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| Int)) (let ((.cse39 (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0))) (and (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 4) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0) (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (<= .cse39 2147483646) (= |ULTIMATE.start_goodB2G_~result~0#1| .cse39) (<= 0 (+ .cse39 2147483648)) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| 0)))))) (.cse0 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse1 (= |ULTIMATE.start_goodG2B_~h~0#1| 1)) (.cse36 (= |ULTIMATE.start_goodG2B_~j~0#1| 0)) (.cse2 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse3 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse37 (= (+ |ULTIMATE.start_goodG2B_~data~1#1| 2) 0)) (.cse4 (= (select (select |#memory_int| 1) 0) 0)) (.cse5 (= ~globalArgv~0.offset 0)) (.cse7 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse8 (= (select |#valid| 3) 1)) (.cse9 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse10 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse11 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse13 (= |ULTIMATE.start_goodB2G_~k~0#1| 1)) (.cse14 (= (select |#valid| 4) 1)) (.cse15 (= (select |#length| 3) 18)) (.cse16 (= (select |#valid| 1) 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse18 (= ~globalArgv~0.base 0)) (.cse19 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse21 (= (select |#valid| 0) 0)) (.cse22 (= 54 (select |#length| 2))) (.cse23 (= (select |#length| 1) 1)) (.cse24 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| Int)) (let ((.cse38 (+ (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0) 2147483648))) (and (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 4) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (<= 0 .cse38) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (<= .cse38 0) (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| 0)))))) (.cse25 (= (select |#valid| 2) 1)) (.cse26 (= 16 (select |#length| 4))) (.cse27 (= |#NULL.offset| 0)) (.cse28 (= ~globalFalse~0 0)) (.cse29 (= |ULTIMATE.start_goodB2G_~i~1#1| 1)) (.cse30 (= ~globalArgc~0 0)) (.cse31 (= 5 ~globalFive~0)) (.cse32 (< 0 |#StackHeapBarrier|)) (.cse33 (= |#NULL.base| 0)) (.cse34 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse35 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse0 .cse1 .cse36 .cse2 .cse3 .cse37 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse0 .cse1 .cse36 .cse2 .cse3 .cse37 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34))) [2022-11-19 07:26:52,530 INFO L899 garLoopResultBuilder]: For program point L1576-3(line 1576) no Hoare annotation was computed. [2022-11-19 07:26:52,531 INFO L899 garLoopResultBuilder]: For program point L1576-4(line 1576) no Hoare annotation was computed. [2022-11-19 07:26:52,532 INFO L895 garLoopResultBuilder]: At program point L1576-5(lines 1576 1579) the Hoare annotation is: (let ((.cse25 (= |ULTIMATE.start_goodG2B_~h~0#1| 1)) (.cse26 (= (+ |ULTIMATE.start_goodG2B_~data~1#1| 2) 0)) (.cse0 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse3 (= (select (select |#memory_int| 1) 0) 0)) (.cse5 (= |ULTIMATE.start_goodG2B_~data~1#1| 0)) (.cse7 (= (select |#valid| 3) 1)) (.cse9 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse10 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse12 (= (select |#valid| 4) 1)) (.cse13 (= (select |#length| 3) 18)) (.cse14 (= (select |#valid| 1) 1)) (.cse15 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse16 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse17 (= (select |#valid| 0) 0)) (.cse18 (= |ULTIMATE.start_goodG2B_~h~0#1| 0)) (.cse19 (= 54 (select |#length| 2))) (.cse20 (= (select |#length| 1) 1)) (.cse22 (= (select |#valid| 2) 1)) (.cse23 (= 16 (select |#length| 4))) (.cse24 (= |ULTIMATE.start_goodB2G_~i~1#1| 1)) (.cse28 (= ~globalArgc~0 0)) (.cse29 (= 5 ~globalFive~0)) (.cse30 (< 0 |#StackHeapBarrier|)) (.cse31 (= |#NULL.base| 0)) (.cse32 (= ~globalTrue~0 1))) (or (and (let ((.cse4 (= ~globalArgv~0.offset 0)) (.cse6 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse8 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse11 (= |ULTIMATE.start_goodB2G_~k~0#1| 1)) (.cse21 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| Int)) (let ((.cse27 (+ (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0) 2147483648))) (and (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 4) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (<= 0 .cse27) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (<= .cse27 0) (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| 0))))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse25 .cse1 .cse2 .cse26 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24))) (= ~globalArgv~0.base 0) (= |#NULL.offset| 0) (= ~globalFalse~0 0) .cse28 .cse29 .cse30 .cse31 .cse32) (and (<= 5 ~GLOBAL_CONST_FIVE~0) (<= ~GLOBAL_CONST_TRUE~0 1) (<= ~globalArgv~0.offset 0) (<= 1 |ULTIMATE.start_goodB2G_~k~0#1|) (<= ~globalFalse~0 0) (<= ~GLOBAL_CONST_FIVE~0 5) (<= |#NULL.offset| 0) (<= 1 ~GLOBAL_CONST_TRUE~0) (<= 0 ~globalFalse~0) (<= 0 ~globalArgv~0.base) (<= ~globalArgv~0.base 0) (let ((.cse33 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| Int)) (let ((.cse34 (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0))) (and (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 4) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0) (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (<= .cse34 2147483646) (= |ULTIMATE.start_goodB2G_~result~0#1| .cse34) (<= 0 (+ .cse34 2147483648)) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| 0))))))) (or (and .cse0 .cse25 .cse1 .cse2 .cse26 .cse3 .cse7 .cse9 .cse10 .cse33 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse22 .cse23 .cse24 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse9 .cse10 .cse33 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse28 .cse29 .cse30 .cse31 .cse32))) (<= 0 ~globalArgv~0.offset) (<= |ULTIMATE.start_goodB2G_~k~0#1| 1) (<= 0 |#NULL.offset|)))) [2022-11-19 07:26:52,532 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1553) no Hoare annotation was computed. [2022-11-19 07:26:52,532 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-19 07:26:52,533 INFO L895 garLoopResultBuilder]: At program point L1597(line 1597) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select |#valid| 4) 1) (= (select |#length| 3) 18) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (= 54 (select |#length| 2)) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 16 (select |#length| 4)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 07:26:52,533 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1557) no Hoare annotation was computed. [2022-11-19 07:26:52,533 INFO L899 garLoopResultBuilder]: For program point L1597-1(line 1597) no Hoare annotation was computed. [2022-11-19 07:26:52,534 INFO L895 garLoopResultBuilder]: At program point L1585(line 1585) the Hoare annotation is: (let ((.cse0 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse1 (= |ULTIMATE.start_goodG2B_~h~0#1| 1)) (.cse2 (= |ULTIMATE.start_goodG2B_~j~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse4 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse5 (= (select (select |#memory_int| 1) 0) 0)) (.cse6 (= ~globalArgv~0.offset 0)) (.cse7 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse8 (= (select |#valid| 3) 1)) (.cse9 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse10 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse11 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse13 (= (+ |ULTIMATE.start_goodG2B_~data~1#1| 3) 0)) (.cse14 (= |ULTIMATE.start_goodB2G_~k~0#1| 1)) (.cse15 (= (select |#valid| 4) 1)) (.cse16 (= (select |#length| 3) 18)) (.cse17 (= (select |#valid| 1) 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse19 (= ~globalArgv~0.base 0)) (.cse20 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse21 (= |ULTIMATE.start_goodG2B_~result~1#1| |ULTIMATE.start_goodG2B_~data~1#1|)) (.cse22 (= (select |#valid| 0) 0)) (.cse23 (= 54 (select |#length| 2))) (.cse24 (= (select |#length| 1) 1)) (.cse25 (= (select |#valid| 2) 1)) (.cse26 (= 16 (select |#length| 4))) (.cse27 (= |#NULL.offset| 0)) (.cse28 (= ~globalFalse~0 0)) (.cse29 (= |ULTIMATE.start_goodB2G_~i~1#1| 1)) (.cse30 (= ~globalArgc~0 0)) (.cse31 (= 5 ~globalFive~0)) (.cse32 (< 0 |#StackHeapBarrier|)) (.cse33 (= |#NULL.base| 0)) (.cse34 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| Int)) (let ((.cse12 (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0))) (and (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 4) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0) (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (<= .cse12 2147483646) (= |ULTIMATE.start_goodB2G_~result~0#1| .cse12) (<= 0 (+ .cse12 2147483648)) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| 0))))) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| Int)) (let ((.cse35 (+ (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0) 2147483648))) (and (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 4) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (<= 0 .cse35) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (<= .cse35 0) (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| 0))))) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34))) [2022-11-19 07:26:52,534 INFO L899 garLoopResultBuilder]: For program point L1585-1(lines 1580 1587) no Hoare annotation was computed. [2022-11-19 07:26:52,535 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1583) no Hoare annotation was computed. [2022-11-19 07:26:52,535 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1553) no Hoare annotation was computed. [2022-11-19 07:26:52,535 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 07:26:52,535 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1557) no Hoare annotation was computed. [2022-11-19 07:26:52,535 INFO L899 garLoopResultBuilder]: For program point L1561(line 1561) no Hoare annotation was computed. [2022-11-19 07:26:52,536 INFO L899 garLoopResultBuilder]: For program point L1561-1(line 1561) no Hoare annotation was computed. [2022-11-19 07:26:52,536 INFO L899 garLoopResultBuilder]: For program point L1557-2(line 1557) no Hoare annotation was computed. [2022-11-19 07:26:52,536 INFO L899 garLoopResultBuilder]: For program point L1557-3(line 1557) no Hoare annotation was computed. [2022-11-19 07:26:52,537 INFO L895 garLoopResultBuilder]: At program point L1557-4(lines 1557 1569) the Hoare annotation is: (let ((.cse22 (select (select |#memory_int| |ULTIMATE.start_goodB2G_~#data~0#1.base|) |ULTIMATE.start_goodB2G_~#data~0#1.offset|))) (let ((.cse18 (+ .cse22 2147483648))) (let ((.cse0 (<= 0 .cse18)) (.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse3 (= (select |#length| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 4)) (.cse4 (= (select (select |#memory_int| 1) 0) 0)) (.cse5 (= (select |#valid| 3) 1)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse8 (= (select |#valid| 4) 1)) (.cse9 (= (select |#length| 3) 18)) (.cse10 (= (select |#valid| 1) 1)) (.cse11 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse12 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse13 (= (select |#valid| 0) 0)) (.cse14 (= 54 (select |#length| 2))) (.cse15 (= (select |#length| 1) 1)) (.cse16 (= (select |#valid| 2) 1)) (.cse17 (= 16 (select |#length| 4))) (.cse19 (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G_~#data~0#1.base|)) (.cse20 (= (select |#valid| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 1)) (.cse21 (< 0 |#StackHeapBarrier|))) (or (and .cse0 (= ~GLOBAL_CONST_FALSE~0 0) .cse1 .cse2 .cse3 .cse4 (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) .cse5 (= ~GLOBAL_CONST_TRUE~0 1) .cse6 .cse7 (= |ULTIMATE.start_goodB2G_~k~0#1| 1) .cse8 .cse9 .cse10 .cse11 (= ~globalArgv~0.base 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |#NULL.offset| 0) (<= .cse18 0) (= ~globalFalse~0 0) (= |ULTIMATE.start_goodB2G_~i~1#1| 1) .cse19 (= ~globalArgc~0 0) .cse20 (= 5 ~globalFive~0) (= |ULTIMATE.start_goodB2G_~#data~0#1.offset| 0) .cse21 (= |#NULL.base| 0) (= ~globalTrue~0 1)) (and (or (and .cse0 .cse1 .cse2 (<= .cse22 2147483646) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_goodB2G_~result~0#1| .cse22) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse0 (= |ULTIMATE.start_goodB2G_~k~0#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21)) (let ((.cse23 (<= 0 ~GLOBAL_CONST_FALSE~0)) (.cse24 (<= ~globalTrue~0 1)) (.cse25 (<= 1 |ULTIMATE.start_goodB2G_~i~1#1|)) (.cse26 (<= ~globalArgc~0 0)) (.cse27 (<= 0 |#NULL.base|)) (.cse28 (<= 5 ~globalFive~0)) (.cse29 (<= 5 ~GLOBAL_CONST_FIVE~0)) (.cse30 (<= ~GLOBAL_CONST_TRUE~0 1)) (.cse31 (<= ~globalArgv~0.offset 0)) (.cse32 (<= ~globalFalse~0 0)) (.cse33 (<= ~GLOBAL_CONST_FIVE~0 5)) (.cse34 (<= |#NULL.offset| 0)) (.cse35 (<= 1 ~GLOBAL_CONST_TRUE~0)) (.cse36 (<= |ULTIMATE.start_goodB2G_~#data~0#1.offset| 0)) (.cse37 (<= 0 ~globalFalse~0)) (.cse38 (<= 0 ~globalArgc~0)) (.cse39 (<= 0 ~globalArgv~0.base)) (.cse40 (<= |#NULL.base| 0)) (.cse41 (<= ~globalArgv~0.base 0)) (.cse42 (<= ~GLOBAL_CONST_FALSE~0 0)) (.cse43 (<= 0 ~globalArgv~0.offset)) (.cse44 (<= 1 ~globalTrue~0)) (.cse45 (<= 0 |#NULL.offset|)) (.cse46 (<= ~globalFive~0 5)) (.cse47 (<= 0 |ULTIMATE.start_goodB2G_~#data~0#1.offset|)) (.cse48 (<= |ULTIMATE.start_goodB2G_~i~1#1| 1))) (or (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (<= |ULTIMATE.start_goodB2G_~k~0#1| 0) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (<= 0 |ULTIMATE.start_goodB2G_~k~0#1|) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (<= 1 |ULTIMATE.start_goodB2G_~k~0#1|) .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (<= |ULTIMATE.start_goodB2G_~k~0#1| 1) .cse45 .cse46 .cse47 .cse48))) (<= .cse22 2147483647)))))) [2022-11-19 07:26:52,537 INFO L899 garLoopResultBuilder]: For program point L1553-3(line 1553) no Hoare annotation was computed. [2022-11-19 07:26:52,537 INFO L899 garLoopResultBuilder]: For program point L1553-4(line 1553) no Hoare annotation was computed. [2022-11-19 07:26:52,538 INFO L895 garLoopResultBuilder]: At program point L1553-5(lines 1553 1556) the Hoare annotation is: (let ((.cse24 (select (select |#memory_int| |ULTIMATE.start_goodB2G_~#data~0#1.base|) |ULTIMATE.start_goodB2G_~#data~0#1.offset|))) (and (let ((.cse0 (<= 0 ~GLOBAL_CONST_FALSE~0)) (.cse1 (<= ~globalTrue~0 1)) (.cse2 (<= ~globalArgc~0 0)) (.cse3 (<= 0 |#NULL.base|)) (.cse4 (<= 5 ~globalFive~0)) (.cse5 (<= 5 ~GLOBAL_CONST_FIVE~0)) (.cse6 (<= ~GLOBAL_CONST_TRUE~0 1)) (.cse7 (<= ~globalArgv~0.offset 0)) (.cse8 (<= ~globalFalse~0 0)) (.cse9 (<= ~GLOBAL_CONST_FIVE~0 5)) (.cse10 (<= |#NULL.offset| 0)) (.cse11 (<= 1 ~GLOBAL_CONST_TRUE~0)) (.cse12 (<= |ULTIMATE.start_goodB2G_~#data~0#1.offset| 0)) (.cse13 (<= 0 ~globalFalse~0)) (.cse14 (<= 0 ~globalArgc~0)) (.cse15 (<= 0 ~globalArgv~0.base)) (.cse16 (<= |#NULL.base| 0)) (.cse17 (<= ~globalArgv~0.base 0)) (.cse18 (<= ~GLOBAL_CONST_FALSE~0 0)) (.cse19 (<= 0 ~globalArgv~0.offset)) (.cse20 (<= 1 ~globalTrue~0)) (.cse21 (<= 0 |#NULL.offset|)) (.cse22 (<= ~globalFive~0 5)) (.cse23 (<= 0 |ULTIMATE.start_goodB2G_~#data~0#1.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 0 |ULTIMATE.start_goodB2G_~i~1#1|) .cse13 .cse14 (<= |ULTIMATE.start_goodB2G_~i~1#1| 0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 (<= 1 |ULTIMATE.start_goodB2G_~i~1#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= |ULTIMATE.start_goodB2G_~i~1#1| 1)))) (let ((.cse25 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse26 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse27 (= (select |#length| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 4)) (.cse28 (= (select (select |#memory_int| 1) 0) 0)) (.cse29 (= (select |#valid| 3) 1)) (.cse30 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse32 (= (select |#valid| 4) 1)) (.cse33 (= (select |#length| 3) 18)) (.cse34 (= (select |#valid| 1) 1)) (.cse35 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse36 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse37 (= (select |#valid| 0) 0)) (.cse38 (= 54 (select |#length| 2))) (.cse39 (= (select |#length| 1) 1)) (.cse40 (= (select |#valid| 2) 1)) (.cse41 (= 16 (select |#length| 4))) (.cse42 (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G_~#data~0#1.base|)) (.cse43 (= (select |#valid| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 1)) (.cse44 (< 0 |#StackHeapBarrier|))) (or (and (<= 0 (+ .cse24 2147483648)) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (= |ULTIMATE.start_goodB2G_~i~1#1| 1) .cse42 .cse43 .cse44) (and .cse25 .cse26 .cse27 .cse28 (= .cse24 0) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44))) (<= .cse24 2147483647))) [2022-11-19 07:26:52,538 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1583) no Hoare annotation was computed. [2022-11-19 07:26:52,538 INFO L902 garLoopResultBuilder]: At program point L1599(line 1599) the Hoare annotation is: true [2022-11-19 07:26:52,539 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1561) no Hoare annotation was computed. [2022-11-19 07:26:52,539 INFO L902 garLoopResultBuilder]: At program point L1599-1(line 1599) the Hoare annotation is: true [2022-11-19 07:26:52,539 INFO L899 garLoopResultBuilder]: For program point L1583(line 1583) no Hoare annotation was computed. [2022-11-19 07:26:52,539 INFO L899 garLoopResultBuilder]: For program point L1583-1(line 1583) no Hoare annotation was computed. [2022-11-19 07:26:52,539 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1580) no Hoare annotation was computed. [2022-11-19 07:26:52,540 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1576) no Hoare annotation was computed. [2022-11-19 07:26:52,543 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:26:52,545 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:26:52,556 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,557 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,558 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,558 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,558 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,559 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,559 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,559 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,560 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,560 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,560 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,561 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,561 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,561 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,562 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,562 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,562 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,563 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,563 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,563 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,564 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,564 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,565 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,565 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,565 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,566 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,566 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,566 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,567 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,567 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,567 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,568 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,568 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,570 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,570 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,570 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,571 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,571 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,571 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,589 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,589 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,590 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,590 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,590 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,591 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,591 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,591 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,591 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,592 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,592 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,593 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,593 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,593 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,594 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,594 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,595 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,595 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,595 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,596 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,596 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,596 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,597 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,597 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,598 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,598 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,598 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,605 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,606 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,606 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,606 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,607 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,607 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,607 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,608 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,608 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,608 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,609 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,609 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,609 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,610 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,610 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,611 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,611 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,611 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,612 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,612 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,612 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,613 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,614 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,614 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,614 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,615 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,615 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,615 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,616 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,616 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,616 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,617 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,618 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,618 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,618 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,619 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,619 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,619 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,619 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,620 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,620 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,620 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,624 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,624 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,626 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,626 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,626 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,627 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,627 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,627 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,628 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,628 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,628 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,629 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,629 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,629 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,630 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,630 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,631 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,631 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,631 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,632 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,632 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,633 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,633 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,633 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,634 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,634 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,634 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,635 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,635 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,636 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,636 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,636 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,636 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,637 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,637 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,637 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,638 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,638 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,638 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:26:52 BoogieIcfgContainer [2022-11-19 07:26:52,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:26:52,653 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:26:52,653 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:26:52,653 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:26:52,654 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:26:14" (3/4) ... [2022-11-19 07:26:52,657 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 07:26:52,674 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-19 07:26:52,674 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-19 07:26:52,680 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-19 07:26:52,682 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-19 07:26:52,683 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-19 07:26:52,683 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 07:26:52,712 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= i) && 0 <= globalFalse) && 0 <= globalArgc) && i <= 0) && 0 <= globalArgv) && #NULL <= 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) || (((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= globalFalse) && 0 <= globalArgc) && 0 <= globalArgv) && #NULL <= 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) && i <= 1)) && ((((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((((((((((((((((argv == argv && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && unknown-#memory_int-unknown[data][data] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && 0 < unknown-#StackHeapBarrier-unknown))) && unknown-#memory_int-unknown[data][data] <= 2147483647 [2022-11-19 07:26:52,712 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && GLOBAL_CONST_FALSE == 0) && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && unknown-#memory_int-unknown[data][data] + 2147483648 <= 0) && globalFalse == 0) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && globalArgc == 0) && \valid[data] == 1) && 5 == globalFive) && data == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || (((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[data][data] <= 2147483646) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && result == unknown-#memory_int-unknown[data][data]) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && 0 < unknown-#StackHeapBarrier-unknown) || (((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && k == 0) && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && 0 < unknown-#StackHeapBarrier-unknown)) && ((((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && k <= 0) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= globalFalse) && 0 <= globalArgc) && 0 <= globalArgv) && #NULL <= 0) && 0 <= k) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) && i <= 1) || (((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && 1 <= k) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= globalFalse) && 0 <= globalArgc) && 0 <= globalArgv) && #NULL <= 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && k <= 1) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) && i <= 1))) && unknown-#memory_int-unknown[data][data] <= 2147483647) [2022-11-19 07:26:52,714 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && h == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648 <= 0) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) || ((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648 <= 0) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1)) && globalArgv == 0) && #NULL == 0) && globalFalse == 0) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || ((((((((((((((5 <= GLOBAL_CONST_FIVE && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && 1 <= k) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && 0 <= globalFalse) && 0 <= globalArgv) && globalArgv <= 0) && ((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483646) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] + 2147483648) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || (((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && data == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483646) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] + 2147483648) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && h == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1))) && 0 <= globalArgv) && k <= 1) && 0 <= #NULL) [2022-11-19 07:26:52,715 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && j == 1) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && data + 3 == 0) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && result == data) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648 <= 0) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || ((((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && j == 1) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483646) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] + 2147483648) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && data + 3 == 0) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && result == data) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1)) || (((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && j == 0) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483646) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] + 2147483648) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1)) || (((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && j == 0) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648 <= 0) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) [2022-11-19 07:26:52,739 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:26:52,740 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:26:52,740 INFO L158 Benchmark]: Toolchain (without parser) took 41200.24ms. Allocated memory was 102.8MB in the beginning and 339.7MB in the end (delta: 237.0MB). Free memory was 65.4MB in the beginning and 189.6MB in the end (delta: -124.2MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. [2022-11-19 07:26:52,740 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 102.8MB. Free memory was 58.2MB in the beginning and 58.2MB in the end (delta: 42.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:26:52,741 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1655.40ms. Allocated memory was 102.8MB in the beginning and 125.8MB in the end (delta: 23.1MB). Free memory was 65.4MB in the beginning and 89.7MB in the end (delta: -24.3MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2022-11-19 07:26:52,741 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.91ms. Allocated memory is still 125.8MB. Free memory was 89.7MB in the beginning and 86.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:26:52,741 INFO L158 Benchmark]: Boogie Preprocessor took 84.04ms. Allocated memory is still 125.8MB. Free memory was 86.9MB in the beginning and 85.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:26:52,742 INFO L158 Benchmark]: RCFGBuilder took 675.09ms. Allocated memory is still 125.8MB. Free memory was 84.8MB in the beginning and 67.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-19 07:26:52,742 INFO L158 Benchmark]: TraceAbstraction took 38620.09ms. Allocated memory was 125.8MB in the beginning and 339.7MB in the end (delta: 213.9MB). Free memory was 66.7MB in the beginning and 193.8MB in the end (delta: -127.2MB). Peak memory consumption was 178.0MB. Max. memory is 16.1GB. [2022-11-19 07:26:52,742 INFO L158 Benchmark]: Witness Printer took 86.87ms. Allocated memory is still 339.7MB. Free memory was 192.8MB in the beginning and 189.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:26:52,744 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.41ms. Allocated memory is still 102.8MB. Free memory was 58.2MB in the beginning and 58.2MB in the end (delta: 42.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1655.40ms. Allocated memory was 102.8MB in the beginning and 125.8MB in the end (delta: 23.1MB). Free memory was 65.4MB in the beginning and 89.7MB in the end (delta: -24.3MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.91ms. Allocated memory is still 125.8MB. Free memory was 89.7MB in the beginning and 86.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.04ms. Allocated memory is still 125.8MB. Free memory was 86.9MB in the beginning and 85.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 675.09ms. Allocated memory is still 125.8MB. Free memory was 84.8MB in the beginning and 67.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 38620.09ms. Allocated memory was 125.8MB in the beginning and 339.7MB in the end (delta: 213.9MB). Free memory was 66.7MB in the beginning and 193.8MB in the end (delta: -127.2MB). Peak memory consumption was 178.0MB. Max. memory is 16.1GB. * Witness Printer took 86.87ms. Allocated memory is still 339.7MB. Free memory was 192.8MB in the beginning and 189.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] * 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: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1580]: 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 3 procedures, 44 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 38.4s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 1235 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 364 IncrementalHoareTripleChecker+Unchecked, 799 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 663 IncrementalHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 436 mSDtfsCounter, 663 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 260 SyntacticMatches, 10 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=14, InterpolantAutomatonStates: 93, 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, 15 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 31 PreInvPairs, 50 NumberOfFragments, 3084 HoareAnnotationTreeSize, 31 FomulaSimplifications, 101 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 6454 FormulaSimplificationTreeSizeReductionInter, 7.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 491 NumberOfCodeBlocks, 491 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 538 ConstructedInterpolants, 0 QuantifiedInterpolants, 996 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1049 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 121/139 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: 5.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 6, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 64, DAG_INTERPRETER_EARLY_EXITS: 6, TOOLS_POST_APPLICATIONS: 104, TOOLS_POST_TIME: 3.6s, TOOLS_POST_CALL_APPLICATIONS: 26, TOOLS_POST_CALL_TIME: 0.6s, TOOLS_POST_RETURN_APPLICATIONS: 20, TOOLS_POST_RETURN_TIME: 0.4s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 142, TOOLS_QUANTIFIERELIM_TIME: 4.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.3s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 224, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 36, DOMAIN_JOIN_TIME: 0.9s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 10, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 64, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 8, LOOP_SUMMARIZER_CACHE_MISSES: 8, LOOP_SUMMARIZER_OVERALL_TIME: 0.8s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.8s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 10, CALL_SUMMARIZER_APPLICATIONS: 20, CALL_SUMMARIZER_CACHE_MISSES: 4, 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.1s, DAG_COMPRESSION_PROCESSED_NODES: 2873, DAG_COMPRESSION_RETAINED_NODES: 230, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 1576]: Loop Invariant [2022-11-19 07:26:52,756 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,756 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,756 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,757 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,757 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,757 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,757 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,757 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,758 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,758 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,761 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,761 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,762 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,762 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,762 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,763 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,763 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,763 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,763 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,764 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,764 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,764 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,765 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,766 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,766 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,766 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,766 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,767 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,767 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,767 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,768 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,769 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,769 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,771 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,771 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,772 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,772 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,772 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,773 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,773 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,773 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,773 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,781 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,781 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,781 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,782 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,782 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,782 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,782 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,783 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,783 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,783 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,783 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,784 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,784 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,784 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,784 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,785 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,785 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,785 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,785 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,786 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,786 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,787 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,787 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,787 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,788 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,788 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,789 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,789 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,789 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,790 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,790 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,790 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,791 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,791 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,791 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,792 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,792 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,792 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,793 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,793 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,793 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,794 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && h == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648 <= 0) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) || ((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648 <= 0) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1)) && globalArgv == 0) && #NULL == 0) && globalFalse == 0) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || ((((((((((((((5 <= GLOBAL_CONST_FIVE && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && 1 <= k) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && 0 <= globalFalse) && 0 <= globalArgv) && globalArgv <= 0) && ((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483646) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] + 2147483648) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || (((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && data == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483646) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] + 2147483648) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && h == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1))) && 0 <= globalArgv) && k <= 1) && 0 <= #NULL) - InvariantResult [Line: 1580]: Loop Invariant [2022-11-19 07:26:52,796 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,797 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,797 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,799 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,799 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,799 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,800 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,800 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,800 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,800 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,803 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,804 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,804 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,804 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,807 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,807 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,807 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,808 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,808 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,808 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,809 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,809 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,809 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,810 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,810 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,810 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,811 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,811 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,811 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,811 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,811 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,812 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,812 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,812 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,812 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,813 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,815 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,816 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,816 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,816 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,817 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,817 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,817 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,817 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,818 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,818 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,818 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,818 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,819 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,819 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,819 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,820 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,820 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,820 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,821 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,821 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,821 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,822 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,822 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,822 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,823 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,823 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,823 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,824 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,824 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,824 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,824 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,825 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-19 07:26:52,825 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,825 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,826 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,827 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,828 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,828 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,828 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,829 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,829 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-19 07:26:52,829 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && j == 1) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && data + 3 == 0) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && result == data) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648 <= 0) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || ((((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && j == 1) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483646) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] + 2147483648) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && data + 3 == 0) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && result == data) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1)) || (((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && j == 0) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483646) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] + 2147483648) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1)) || (((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && j == 0) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648 <= 0) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) - InvariantResult [Line: 1599]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1553]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= i) && 0 <= globalFalse) && 0 <= globalArgc) && i <= 0) && 0 <= globalArgv) && #NULL <= 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) || (((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= globalFalse) && 0 <= globalArgc) && 0 <= globalArgv) && #NULL <= 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) && i <= 1)) && ((((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((((((((((((((((argv == argv && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && unknown-#memory_int-unknown[data][data] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && 0 < unknown-#StackHeapBarrier-unknown))) && unknown-#memory_int-unknown[data][data] <= 2147483647 - InvariantResult [Line: 1557]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && GLOBAL_CONST_FALSE == 0) && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && unknown-#memory_int-unknown[data][data] + 2147483648 <= 0) && globalFalse == 0) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && globalArgc == 0) && \valid[data] == 1) && 5 == globalFive) && data == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || (((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[data][data] <= 2147483646) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && result == unknown-#memory_int-unknown[data][data]) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && 0 < unknown-#StackHeapBarrier-unknown) || (((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && k == 0) && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && 0 < unknown-#StackHeapBarrier-unknown)) && ((((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && k <= 0) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= globalFalse) && 0 <= globalArgc) && 0 <= globalArgv) && #NULL <= 0) && 0 <= k) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) && i <= 1) || (((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && 1 <= k) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= globalFalse) && 0 <= globalArgc) && 0 <= globalArgv) && #NULL <= 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && k <= 1) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) && i <= 1))) && unknown-#memory_int-unknown[data][data] <= 2147483647) RESULT: Ultimate proved your program to be correct! [2022-11-19 07:26:52,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928cc3ff-0e0b-4e6d-b38a-b44f7e701845/bin/utaipan-I9t0OCRTmS/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