./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 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_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_17_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba --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 0dfd86504ec51385fcf4065bb94bbc6e4d8b669d9b1bf39730438b67cc387928 --- 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-b5237d8 [2022-11-22 00:16:16,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:16:16,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:16:16,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:16:16,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:16:16,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:16:16,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:16:16,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:16:16,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:16:16,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:16:16,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:16:16,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:16:16,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:16:16,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:16:16,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:16:16,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:16:16,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:16:16,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:16:16,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:16:16,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:16:16,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:16:16,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:16:16,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:16:16,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:16:16,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:16:16,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:16:16,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:16:16,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:16:16,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:16:16,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:16:16,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:16:16,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:16:16,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:16:16,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:16:16,142 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:16:16,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:16:16,143 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:16:16,143 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:16:16,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:16:16,144 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:16:16,145 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:16:16,146 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-22 00:16:16,190 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:16:16,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:16:16,191 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:16:16,191 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:16:16,205 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:16:16,206 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:16:16,206 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:16:16,206 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:16:16,208 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:16:16,208 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:16:16,209 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:16:16,210 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:16:16,210 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:16:16,210 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:16:16,210 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:16:16,211 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:16:16,211 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:16:16,211 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:16:16,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:16:16,213 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 00:16:16,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:16:16,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:16:16,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 00:16:16,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:16:16,215 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 00:16:16,215 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 00:16:16,215 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 00:16:16,216 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:16:16,216 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 00:16:16,216 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:16:16,217 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:16:16,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:16:16,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:16:16,218 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:16:16,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:16:16,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 00:16:16,219 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:16:16,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:16:16,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 00:16:16,220 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:16:16,220 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_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/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_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba 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 -> 0dfd86504ec51385fcf4065bb94bbc6e4d8b669d9b1bf39730438b67cc387928 [2022-11-22 00:16:16,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:16:16,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:16:16,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:16:16,552 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:16:16,553 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:16:16,554 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_17_good.i [2022-11-22 00:16:19,594 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:16:19,976 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:16:19,977 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_17_good.i [2022-11-22 00:16:20,000 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/data/37e718dfe/0df88821f18a4970bc6718e5ae027ef5/FLAGf61c09f3d [2022-11-22 00:16:20,016 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/data/37e718dfe/0df88821f18a4970bc6718e5ae027ef5 [2022-11-22 00:16:20,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:16:20,021 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:16:20,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:16:20,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:16:20,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:16:20,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:16:20" (1/1) ... [2022-11-22 00:16:20,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@165c006d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:20, skipping insertion in model container [2022-11-22 00:16:20,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:16:20" (1/1) ... [2022-11-22 00:16:20,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:16:20,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:16:20,514 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-22 00:16:21,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:16:21,229 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:16:21,268 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-22 00:16:21,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:16:21,550 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:16:21,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21 WrapperNode [2022-11-22 00:16:21,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:16:21,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:16:21,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:16:21,553 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:16:21,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,651 INFO L138 Inliner]: procedures = 501, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 107 [2022-11-22 00:16:21,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:16:21,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:16:21,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:16:21,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:16:21,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,714 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:16:21,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:16:21,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:16:21,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:16:21,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:16:21,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:21,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:16:21,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:16:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-22 00:16:21,830 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-22 00:16:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-22 00:16:21,831 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-22 00:16:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:16:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 00:16:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:16:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:16:21,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:16:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:16:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-22 00:16:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 00:16:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 00:16:22,070 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:16:22,083 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:16:22,373 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:16:22,443 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:16:22,444 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-22 00:16:22,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:16:22 BoogieIcfgContainer [2022-11-22 00:16:22,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:16:22,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:16:22,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:16:22,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:16:22,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:16:20" (1/3) ... [2022-11-22 00:16:22,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5975bed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:16:22, skipping insertion in model container [2022-11-22 00:16:22,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (2/3) ... [2022-11-22 00:16:22,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5975bed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:16:22, skipping insertion in model container [2022-11-22 00:16:22,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:16:22" (3/3) ... [2022-11-22 00:16:22,462 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_preinc_17_good.i [2022-11-22 00:16:22,483 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:16:22,483 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-22 00:16:22,544 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:16:22,550 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;@7791acb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:16:22,551 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-11-22 00:16:22,555 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-22 00:16:22,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 00:16:22,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:22,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:22,564 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-22 00:16:22,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:22,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1827108304, now seen corresponding path program 1 times [2022-11-22 00:16:22,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:22,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374068924] [2022-11-22 00:16:22,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:22,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:23,129 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-22 00:16:23,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:23,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374068924] [2022-11-22 00:16:23,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374068924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:23,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:23,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:16:23,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683884574] [2022-11-22 00:16:23,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:23,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:16:23,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:23,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:16:23,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:16:23,197 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-22 00:16:23,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:23,346 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2022-11-22 00:16:23,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:16:23,349 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-22 00:16:23,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:23,364 INFO L225 Difference]: With dead ends: 85 [2022-11-22 00:16:23,364 INFO L226 Difference]: Without dead ends: 44 [2022-11-22 00:16:23,369 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-22 00:16:23,375 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-22 00:16:23,376 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-22 00:16:23,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-22 00:16:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-22 00:16:23,423 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-22 00:16:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-11-22 00:16:23,428 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 7 [2022-11-22 00:16:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:23,430 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-11-22 00:16:23,431 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-22 00:16:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-11-22 00:16:23,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 00:16:23,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:23,433 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:23,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:16:23,435 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-22 00:16:23,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:23,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1263002824, now seen corresponding path program 1 times [2022-11-22 00:16:23,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:23,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254736484] [2022-11-22 00:16:23,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:23,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:23,681 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-22 00:16:23,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:23,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254736484] [2022-11-22 00:16:23,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254736484] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:23,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231802964] [2022-11-22 00:16:23,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:23,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:23,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:23,688 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:23,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 00:16:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:23,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 00:16:23,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:23,947 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-22 00:16:23,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:16:23,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231802964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:23,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:16:23,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-22 00:16:23,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856068301] [2022-11-22 00:16:23,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:23,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:16:23,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:23,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:16:23,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:16:23,959 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-22 00:16:24,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:24,043 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2022-11-22 00:16:24,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:16:24,045 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-22 00:16:24,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:24,046 INFO L225 Difference]: With dead ends: 78 [2022-11-22 00:16:24,048 INFO L226 Difference]: Without dead ends: 40 [2022-11-22 00:16:24,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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-22 00:16:24,050 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.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:24,051 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.1s Time] [2022-11-22 00:16:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-22 00:16:24,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-22 00:16:24,062 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-22 00:16:24,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-11-22 00:16:24,066 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 10 [2022-11-22 00:16:24,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:24,066 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-11-22 00:16:24,067 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-22 00:16:24,067 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-11-22 00:16:24,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 00:16:24,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:24,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:24,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 00:16:24,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:24,275 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-22 00:16:24,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:24,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1729598038, now seen corresponding path program 1 times [2022-11-22 00:16:24,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:24,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176881492] [2022-11-22 00:16:24,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:24,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:24,377 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-22 00:16:24,377 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:24,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176881492] [2022-11-22 00:16:24,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176881492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:24,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:24,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:16:24,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641825470] [2022-11-22 00:16:24,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:24,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:16:24,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:24,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:16:24,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:16:24,382 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-22 00:16:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:24,448 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-11-22 00:16:24,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:16:24,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-22 00:16:24,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:24,450 INFO L225 Difference]: With dead ends: 40 [2022-11-22 00:16:24,451 INFO L226 Difference]: Without dead ends: 39 [2022-11-22 00:16:24,451 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-22 00:16:24,452 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:24,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 90 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:16:24,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-22 00:16:24,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-22 00:16:24,464 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-22 00:16:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-11-22 00:16:24,466 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 12 [2022-11-22 00:16:24,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:24,467 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-11-22 00:16:24,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-22 00:16:24,468 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-11-22 00:16:24,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 00:16:24,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:24,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:24,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 00:16:24,472 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-22 00:16:24,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:24,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1729499335, now seen corresponding path program 1 times [2022-11-22 00:16:24,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:24,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65429886] [2022-11-22 00:16:24,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:24,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:24,551 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-22 00:16:24,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:24,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65429886] [2022-11-22 00:16:24,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65429886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:24,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:24,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:16:24,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675512664] [2022-11-22 00:16:24,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:24,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:16:24,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:24,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:16:24,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:16:24,555 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-22 00:16:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:24,601 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-11-22 00:16:24,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:16:24,602 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-22 00:16:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:24,603 INFO L225 Difference]: With dead ends: 69 [2022-11-22 00:16:24,603 INFO L226 Difference]: Without dead ends: 51 [2022-11-22 00:16:24,604 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-22 00:16:24,605 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.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:24,605 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.0s Time] [2022-11-22 00:16:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-22 00:16:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-11-22 00:16:24,613 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-22 00:16:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-11-22 00:16:24,615 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 12 [2022-11-22 00:16:24,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:24,615 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-11-22 00:16:24,615 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-22 00:16:24,615 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-11-22 00:16:24,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 00:16:24,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:24,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:24,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 00:16:24,617 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-22 00:16:24,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:24,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2077931549, now seen corresponding path program 1 times [2022-11-22 00:16:24,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:24,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322095579] [2022-11-22 00:16:24,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:24,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:24,873 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-22 00:16:24,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:24,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322095579] [2022-11-22 00:16:24,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322095579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:24,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:24,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:16:24,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121935383] [2022-11-22 00:16:24,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:24,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:16:24,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:24,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:16:24,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:16:24,876 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-22 00:16:24,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:24,942 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-11-22 00:16:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:16:24,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-22 00:16:24,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:24,943 INFO L225 Difference]: With dead ends: 40 [2022-11-22 00:16:24,943 INFO L226 Difference]: Without dead ends: 39 [2022-11-22 00:16:24,944 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-22 00:16:24,945 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 9 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:24,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 84 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:16:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-22 00:16:24,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-22 00:16:24,951 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-22 00:16:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-11-22 00:16:24,952 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 13 [2022-11-22 00:16:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:24,952 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-11-22 00:16:24,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-22 00:16:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-11-22 00:16:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:16:24,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:24,953 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:24,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 00:16:24,954 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-22 00:16:24,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:24,954 INFO L85 PathProgramCache]: Analyzing trace with hash -26369639, now seen corresponding path program 1 times [2022-11-22 00:16:24,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:24,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107899111] [2022-11-22 00:16:24,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:24,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:25,019 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-22 00:16:25,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:25,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107899111] [2022-11-22 00:16:25,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107899111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:25,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:25,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:16:25,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491580706] [2022-11-22 00:16:25,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:25,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:16:25,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:25,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:16:25,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:16:25,021 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-22 00:16:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:25,071 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-11-22 00:16:25,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:16:25,072 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-22 00:16:25,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:25,073 INFO L225 Difference]: With dead ends: 49 [2022-11-22 00:16:25,073 INFO L226 Difference]: Without dead ends: 47 [2022-11-22 00:16:25,073 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-22 00:16:25,074 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.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:25,075 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.0s Time] [2022-11-22 00:16:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-22 00:16:25,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-22 00:16:25,082 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-22 00:16:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-11-22 00:16:25,083 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 16 [2022-11-22 00:16:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:25,084 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-11-22 00:16:25,084 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-22 00:16:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-11-22 00:16:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:16:25,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:25,085 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-22 00:16:25,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 00:16:25,086 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-22 00:16:25,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:25,086 INFO L85 PathProgramCache]: Analyzing trace with hash -448050471, now seen corresponding path program 1 times [2022-11-22 00:16:25,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:25,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630648408] [2022-11-22 00:16:25,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:25,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:25,150 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-22 00:16:25,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:25,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630648408] [2022-11-22 00:16:25,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630648408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:25,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:25,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:16:25,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176256654] [2022-11-22 00:16:25,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:25,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:16:25,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:25,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:16:25,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:16:25,152 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-22 00:16:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:25,195 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-11-22 00:16:25,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:16:25,196 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-22 00:16:25,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:25,197 INFO L225 Difference]: With dead ends: 65 [2022-11-22 00:16:25,197 INFO L226 Difference]: Without dead ends: 50 [2022-11-22 00:16:25,197 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-22 00:16:25,198 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-22 00:16:25,198 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-22 00:16:25,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-22 00:16:25,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-22 00:16:25,205 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-22 00:16:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-11-22 00:16:25,206 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 20 [2022-11-22 00:16:25,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:25,206 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-11-22 00:16:25,207 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-22 00:16:25,207 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-11-22 00:16:25,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 00:16:25,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:25,208 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:25,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 00:16:25,209 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-22 00:16:25,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:25,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1031286073, now seen corresponding path program 1 times [2022-11-22 00:16:25,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:25,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291901053] [2022-11-22 00:16:25,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:25,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:25,334 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-22 00:16:25,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:25,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291901053] [2022-11-22 00:16:25,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291901053] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:25,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829228259] [2022-11-22 00:16:25,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:25,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:25,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:25,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:25,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 00:16:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:25,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 00:16:25,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:25,508 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-22 00:16:25,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:16:25,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829228259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:25,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:16:25,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-22 00:16:25,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738121208] [2022-11-22 00:16:25,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:25,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:16:25,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:25,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:16:25,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:16:25,511 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-22 00:16:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:25,559 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-11-22 00:16:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:16:25,560 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-22 00:16:25,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:25,561 INFO L225 Difference]: With dead ends: 74 [2022-11-22 00:16:25,561 INFO L226 Difference]: Without dead ends: 40 [2022-11-22 00:16:25,562 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-22 00:16:25,562 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-22 00:16:25,563 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-22 00:16:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-22 00:16:25,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-22 00:16:25,569 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-22 00:16:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-11-22 00:16:25,570 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 24 [2022-11-22 00:16:25,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:25,571 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-11-22 00:16:25,571 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-22 00:16:25,571 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-11-22 00:16:25,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 00:16:25,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:25,573 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-22 00:16:25,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 00:16:25,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:25,779 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-22 00:16:25,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:25,779 INFO L85 PathProgramCache]: Analyzing trace with hash 886882175, now seen corresponding path program 1 times [2022-11-22 00:16:25,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:25,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452271778] [2022-11-22 00:16:25,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:25,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:25,869 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-22 00:16:25,870 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:25,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452271778] [2022-11-22 00:16:25,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452271778] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:25,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853244632] [2022-11-22 00:16:25,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:25,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:25,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:25,872 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:25,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 00:16:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:26,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 00:16:26,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:26,041 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-22 00:16:26,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:16:26,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853244632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:26,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:16:26,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-22 00:16:26,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33028242] [2022-11-22 00:16:26,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:26,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:16:26,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:26,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:16:26,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:16:26,044 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-22 00:16:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:26,088 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-11-22 00:16:26,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:16:26,089 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-22 00:16:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:26,091 INFO L225 Difference]: With dead ends: 54 [2022-11-22 00:16:26,092 INFO L226 Difference]: Without dead ends: 36 [2022-11-22 00:16:26,092 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-22 00:16:26,093 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-22 00:16:26,093 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-22 00:16:26,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-22 00:16:26,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-11-22 00:16:26,099 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-22 00:16:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-11-22 00:16:26,099 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 23 [2022-11-22 00:16:26,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:26,100 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-11-22 00:16:26,100 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-22 00:16:26,100 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-11-22 00:16:26,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 00:16:26,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:26,101 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-22 00:16:26,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 00:16:26,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:26,302 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-22 00:16:26,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:26,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1723549009, now seen corresponding path program 1 times [2022-11-22 00:16:26,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:26,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246798413] [2022-11-22 00:16:26,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:26,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:26,377 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-22 00:16:26,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:26,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246798413] [2022-11-22 00:16:26,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246798413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:26,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:26,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:16:26,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593996879] [2022-11-22 00:16:26,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:26,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:16:26,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:26,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:16:26,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:16:26,380 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-22 00:16:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:26,410 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-11-22 00:16:26,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:16:26,410 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-22 00:16:26,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:26,411 INFO L225 Difference]: With dead ends: 41 [2022-11-22 00:16:26,411 INFO L226 Difference]: Without dead ends: 39 [2022-11-22 00:16:26,412 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-22 00:16:26,412 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:26,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:16:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-22 00:16:26,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-22 00:16:26,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 33 states have internal predecessors, (34), 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-22 00:16:26,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-11-22 00:16:26,419 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2022-11-22 00:16:26,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:26,419 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-11-22 00:16:26,420 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-22 00:16:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-11-22 00:16:26,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 00:16:26,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:26,421 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-22 00:16:26,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 00:16:26,421 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-22 00:16:26,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:26,422 INFO L85 PathProgramCache]: Analyzing trace with hash -744667383, now seen corresponding path program 1 times [2022-11-22 00:16:26,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:26,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832726521] [2022-11-22 00:16:26,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:26,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:26,498 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-22 00:16:26,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:26,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832726521] [2022-11-22 00:16:26,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832726521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:26,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:26,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:16:26,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536560386] [2022-11-22 00:16:26,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:26,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:16:26,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:26,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:16:26,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:16:26,500 INFO L87 Difference]: Start difference. First operand 39 states and 42 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-22 00:16:26,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:26,560 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-11-22 00:16:26,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:16:26,560 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-22 00:16:26,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:26,561 INFO L225 Difference]: With dead ends: 45 [2022-11-22 00:16:26,561 INFO L226 Difference]: Without dead ends: 43 [2022-11-22 00:16:26,562 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-22 00:16:26,562 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 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-22 00:16:26,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:16:26,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-22 00:16:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-22 00:16:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.15625) internal successors, (37), 36 states have internal predecessors, (37), 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-22 00:16:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-11-22 00:16:26,569 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 30 [2022-11-22 00:16:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:26,569 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-22 00:16:26,570 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-22 00:16:26,570 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-11-22 00:16:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 00:16:26,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:26,571 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:26,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 00:16:26,571 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-22 00:16:26,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:26,572 INFO L85 PathProgramCache]: Analyzing trace with hash -879794373, now seen corresponding path program 1 times [2022-11-22 00:16:26,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:26,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446572244] [2022-11-22 00:16:26,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:26,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 00:16:26,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:26,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446572244] [2022-11-22 00:16:26,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446572244] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:26,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168666286] [2022-11-22 00:16:26,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:26,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:26,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:26,688 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:26,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 00:16:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:26,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 00:16:26,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:16:26,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:16:26,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:16:26,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168666286] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:16:26,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1909363162] [2022-11-22 00:16:26,976 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-22 00:16:26,976 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:16:26,980 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:16:26,986 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:16:26,987 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:16:27,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:27,326 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2022-11-22 00:16:27,327 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-22 00:16:27,355 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-22 00:16:27,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:27,373 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-22 00:16:27,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:27,459 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-22 00:16:27,459 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-22 00:16:27,491 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-22 00:16:27,549 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-22 00:16:27,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:27,577 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-22 00:16:27,602 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-22 00:16:28,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:28,300 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-22 00:16:29,986 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 82 for LOIs [2022-11-22 00:16:30,009 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 120 for LOIs [2022-11-22 00:16:30,111 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:16:37,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1909363162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:37,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:16:37,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [5, 3, 3] total 26 [2022-11-22 00:16:37,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587342484] [2022-11-22 00:16:37,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:37,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-22 00:16:37,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:37,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-22 00:16:37,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-11-22 00:16:37,895 INFO L87 Difference]: Start difference. First operand 43 states and 47 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-22 00:16:38,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:38,785 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-11-22 00:16:38,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-22 00:16:38,786 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 33 [2022-11-22 00:16:38,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:38,789 INFO L225 Difference]: With dead ends: 71 [2022-11-22 00:16:38,789 INFO L226 Difference]: Without dead ends: 42 [2022-11-22 00:16:38,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-11-22 00:16:38,792 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:38,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 108 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-22 00:16:38,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-22 00:16:38,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-22 00:16:38,810 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), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 00:16:38,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-11-22 00:16:38,811 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 33 [2022-11-22 00:16:38,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:38,811 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-11-22 00:16:38,811 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-22 00:16:38,812 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-11-22 00:16:38,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 00:16:38,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:38,813 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:38,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 00:16:39,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-22 00:16:39,024 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-22 00:16:39,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:39,025 INFO L85 PathProgramCache]: Analyzing trace with hash 154836748, now seen corresponding path program 1 times [2022-11-22 00:16:39,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:39,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65805649] [2022-11-22 00:16:39,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:39,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 00:16:39,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:39,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65805649] [2022-11-22 00:16:39,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65805649] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:39,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840931773] [2022-11-22 00:16:39,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:39,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:39,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:39,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:39,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 00:16:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:39,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 00:16:39,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:16:39,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:16:39,381 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:16:39,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840931773] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:16:39,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [725944861] [2022-11-22 00:16:39,386 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-22 00:16:39,386 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:16:39,387 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:16:39,387 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:16:39,387 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:16:39,523 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-22 00:16:39,532 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-22 00:16:39,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:39,587 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2022-11-22 00:16:39,588 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-22 00:16:39,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:39,608 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-22 00:16:39,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:39,680 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-22 00:16:39,681 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-22 00:16:39,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:39,726 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-22 00:16:39,746 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-22 00:16:39,766 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-22 00:16:39,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:39,924 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-22 00:16:39,939 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-22 00:16:39,950 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-22 00:16:40,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:40,269 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-22 00:16:40,284 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-22 00:16:40,300 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-22 00:16:40,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:40,474 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-22 00:16:41,562 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 137 for LOIs [2022-11-22 00:16:41,639 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 62 for LOIs [2022-11-22 00:16:41,649 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:16:49,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [725944861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:49,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:16:49,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [5, 3, 3] total 27 [2022-11-22 00:16:49,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134027949] [2022-11-22 00:16:49,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:49,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-22 00:16:49,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:49,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-22 00:16:49,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2022-11-22 00:16:49,564 INFO L87 Difference]: Start difference. First operand 42 states and 44 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-22 00:16:50,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:50,417 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-11-22 00:16:50,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-22 00:16:50,418 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 35 [2022-11-22 00:16:50,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:50,418 INFO L225 Difference]: With dead ends: 42 [2022-11-22 00:16:50,418 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 00:16:50,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2022-11-22 00:16:50,420 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:50,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-22 00:16:50,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 00:16:50,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 00:16:50,421 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-22 00:16:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 00:16:50,422 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-11-22 00:16:50,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:50,422 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 00:16:50,422 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-22 00:16:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 00:16:50,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 00:16:50,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2022-11-22 00:16:50,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2022-11-22 00:16:50,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2022-11-22 00:16:50,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2022-11-22 00:16:50,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2022-11-22 00:16:50,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2022-11-22 00:16:50,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2022-11-22 00:16:50,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2022-11-22 00:16:50,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2022-11-22 00:16:50,428 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2022-11-22 00:16:50,428 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2022-11-22 00:16:50,428 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2022-11-22 00:16:50,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-22 00:16:50,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 00:16:50,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 00:16:57,669 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-22 00:16:57,670 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-22 00:16:57,670 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-22 00:16:57,670 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-22 00:16:57,670 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1561) no Hoare annotation was computed. [2022-11-22 00:16:57,671 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|))) (and (= ~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|) (= (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|) (= (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) (<= 2147483647 .cse0) (= ~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) (<= .cse0 2147483647) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1))) [2022-11-22 00:16:57,671 INFO L899 garLoopResultBuilder]: For program point L1567-1(lines 1557 1569) no Hoare annotation was computed. [2022-11-22 00:16:57,671 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 (= ~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|) (= (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) (<= 0 (+ 2147483647 .cse0)) (= |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) (<= .cse0 2147483647) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1))) [2022-11-22 00:16:57,672 INFO L899 garLoopResultBuilder]: For program point L1559(lines 1559 1568) no Hoare annotation was computed. [2022-11-22 00:16:57,672 INFO L899 garLoopResultBuilder]: For program point L1580-2(line 1580) no Hoare annotation was computed. [2022-11-22 00:16:57,672 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1580) no Hoare annotation was computed. [2022-11-22 00:16:57,672 INFO L899 garLoopResultBuilder]: For program point L1580-3(line 1580) no Hoare annotation was computed. [2022-11-22 00:16:57,672 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1576) no Hoare annotation was computed. [2022-11-22 00:16:57,674 INFO L895 garLoopResultBuilder]: At program point L1580-4(lines 1580 1587) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_goodG2B_~j~0#1| 0)) (.cse7 (= |ULTIMATE.start_goodG2B_~data~1#1| 2)) (.cse34 (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))) (and (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (<= .cse38 2147483647) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0) (<= 2147483647 .cse38) (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|) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| 0)))))) (.cse0 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse1 (= |ULTIMATE.start_goodG2B_~h~0#1| 1)) (.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)) (.cse8 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse9 (= (select |#valid| 3) 1)) (.cse10 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse11 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse12 (= |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)) (.cse35 (<= 3 |ULTIMATE.start_goodG2B_~result~1#1|)) (.cse15 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| Int)) (let ((.cse37 (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|) (<= 0 (+ 2147483647 .cse37)) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 4) (<= .cse37 2147483647) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0) (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (= |ULTIMATE.start_goodB2G_~result~0#1| .cse37) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| 0)))))) (.cse16 (= (select |#length| 3) 18)) (.cse17 (= (select |#valid| 1) 1)) (.cse36 (<= |ULTIMATE.start_goodG2B_~result~1#1| 3)) (.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 (= (select |#valid| 0) 0)) (.cse22 (= 54 (select |#length| 2))) (.cse23 (= (select |#length| 1) 1)) (.cse24 (= (select |#valid| 2) 1)) (.cse25 (= 16 (select |#length| 4))) (.cse26 (= |#NULL.offset| 0)) (.cse27 (= ~globalFalse~0 0)) (.cse28 (= |ULTIMATE.start_goodB2G_~i~1#1| 1)) (.cse29 (= ~globalArgc~0 0)) (.cse30 (= 5 ~globalFive~0)) (.cse31 (< 0 |#StackHeapBarrier|)) (.cse32 (= |#NULL.base| 0)) (.cse33 (= ~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) (and (<= 0 ~GLOBAL_CONST_FALSE~0) (<= ~globalTrue~0 1) (<= 1 |ULTIMATE.start_goodB2G_~i~1#1|) (<= ~globalArgc~0 0) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_goodG2B_~h~0#1| 1) (<= 5 ~globalFive~0) .cse3 .cse4 (<= 5 ~GLOBAL_CONST_FIVE~0) (<= ~GLOBAL_CONST_TRUE~0 1) (<= ~globalArgv~0.offset 0) (<= 1 |ULTIMATE.start_goodG2B_~j~0#1|) (<= 1 |ULTIMATE.start_goodG2B_~h~0#1|) (<= 1 |ULTIMATE.start_goodB2G_~k~0#1|) .cse5 (<= ~globalFalse~0 0) .cse34 (<= 3 |ULTIMATE.start_goodG2B_~data~1#1|) (<= ~GLOBAL_CONST_FIVE~0 5) (<= |ULTIMATE.start_goodG2B_~data~1#1| 3) .cse9 .cse11 (<= |#NULL.offset| 0) .cse12 (<= 1 ~GLOBAL_CONST_TRUE~0) .cse14 .cse35 .cse16 .cse17 (<= 0 ~globalFalse~0) (<= 0 ~globalArgc~0) .cse36 (<= 0 ~globalArgv~0.base) .cse18 (<= |#NULL.base| 0) .cse20 .cse21 (<= ~globalArgv~0.base 0) (<= ~GLOBAL_CONST_FALSE~0 0) .cse22 .cse23 (<= 0 ~globalArgv~0.offset) .cse24 .cse25 (<= |ULTIMATE.start_goodG2B_~j~0#1| 1) (<= 1 ~globalTrue~0) (<= |ULTIMATE.start_goodB2G_~k~0#1| 1) (<= 0 |#NULL.offset|) (<= ~globalFive~0 5) .cse31 (<= |ULTIMATE.start_goodB2G_~i~1#1| 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_goodG2B_~j~0#1| 1) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse35 .cse15 .cse16 .cse17 .cse36 .cse18 .cse19 .cse20 (= |ULTIMATE.start_goodG2B_~result~1#1| |ULTIMATE.start_goodG2B_~data~1#1|) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33))) [2022-11-22 00:16:57,674 INFO L899 garLoopResultBuilder]: For program point L1576-3(line 1576) no Hoare annotation was computed. [2022-11-22 00:16:57,674 INFO L899 garLoopResultBuilder]: For program point L1576-4(line 1576) no Hoare annotation was computed. [2022-11-22 00:16:57,675 INFO L895 garLoopResultBuilder]: At program point L1576-5(lines 1576 1579) the Hoare annotation is: (let ((.cse37 (= |ULTIMATE.start_goodG2B_~data~1#1| 0)) (.cse38 (= |ULTIMATE.start_goodG2B_~h~0#1| 0)) (.cse8 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse9 (= |ULTIMATE.start_goodG2B_~h~0#1| 1)) (.cse10 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse11 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse12 (= (select (select |#memory_int| 1) 0) 0)) (.cse14 (= |ULTIMATE.start_goodG2B_~data~1#1| 2)) (.cse16 (= (select |#valid| 3) 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (= (select |#valid| 4) 1)) (.cse22 (= (select |#length| 3) 18)) (.cse23 (= (select |#valid| 1) 1)) (.cse24 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse25 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse26 (= (select |#valid| 0) 0)) (.cse27 (= 54 (select |#length| 2))) (.cse28 (= (select |#length| 1) 1)) (.cse29 (= (select |#valid| 2) 1)) (.cse30 (= 16 (select |#length| 4))) (.cse31 (= |ULTIMATE.start_goodB2G_~i~1#1| 1)) (.cse32 (= ~globalArgc~0 0)) (.cse34 (< 0 |#StackHeapBarrier|)) (.cse35 (= |#NULL.base| 0)) (.cse36 (= ~globalTrue~0 1)) (.cse0 (<= 1 |ULTIMATE.start_goodB2G_~k~0#1|)) (.cse1 (<= ~globalFalse~0 0)) (.cse2 (<= |#NULL.offset| 0)) (.cse3 (<= 0 ~globalFalse~0)) (.cse4 (<= 0 ~globalArgv~0.base)) (.cse5 (<= ~globalArgv~0.base 0)) (.cse6 (<= |ULTIMATE.start_goodB2G_~k~0#1| 1)) (.cse7 (<= 0 |#NULL.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse13 (= ~globalArgv~0.offset 0)) (.cse15 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse21 (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|) (<= 0 (+ 2147483647 .cse39)) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 4) (<= .cse39 2147483647) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0) (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (= |ULTIMATE.start_goodB2G_~result~0#1| .cse39) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| 0)))))) (.cse33 (= 5 ~globalFive~0))) (or (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse37 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse38 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36)))) (and (<= 5 ~globalFive~0) (let ((.cse40 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| Int)) (let ((.cse41 (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0))) (and (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (<= .cse41 2147483647) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0) (<= 2147483647 .cse41) (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|) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| 0))))))) (or (and .cse8 .cse10 .cse11 .cse12 .cse40 .cse37 .cse16 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse38 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse40 .cse16 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36))) (<= 5 ~GLOBAL_CONST_FIVE~0) (<= ~GLOBAL_CONST_TRUE~0 1) (<= ~globalArgv~0.offset 0) .cse0 .cse1 (<= ~GLOBAL_CONST_FIVE~0 5) .cse2 (<= 1 ~GLOBAL_CONST_TRUE~0) .cse3 .cse4 .cse5 (<= 0 ~globalArgv~0.offset) .cse6 .cse7 (<= ~globalFive~0 5)))) [2022-11-22 00:16:57,676 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1553) no Hoare annotation was computed. [2022-11-22 00:16:57,676 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-22 00:16:57,676 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-22 00:16:57,677 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1557) no Hoare annotation was computed. [2022-11-22 00:16:57,677 INFO L899 garLoopResultBuilder]: For program point L1597-1(line 1597) no Hoare annotation was computed. [2022-11-22 00:16:57,678 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)) (.cse8 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse9 (= (select |#valid| 3) 1)) (.cse10 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse11 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse12 (= |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 (<= 3 |ULTIMATE.start_goodG2B_~result~1#1|)) (.cse16 (= (select |#length| 3) 18)) (.cse17 (= (select |#valid| 1) 1)) (.cse18 (<= |ULTIMATE.start_goodG2B_~result~1#1| 3)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse20 (= ~globalArgv~0.base 0)) (.cse21 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse22 (= |ULTIMATE.start_goodG2B_~result~1#1| |ULTIMATE.start_goodG2B_~data~1#1|)) (.cse23 (= (select |#valid| 0) 0)) (.cse24 (= 54 (select |#length| 2))) (.cse25 (= (select |#length| 1) 1)) (.cse26 (= (select |#valid| 2) 1)) (.cse27 (= 16 (select |#length| 4))) (.cse28 (= |#NULL.offset| 0)) (.cse29 (= ~globalFalse~0 0)) (.cse30 (= |ULTIMATE.start_goodB2G_~i~1#1| 1)) (.cse31 (= ~globalArgc~0 0)) (.cse32 (= 5 ~globalFive~0)) (.cse33 (< 0 |#StackHeapBarrier|)) (.cse34 (= |#NULL.base| 0)) (.cse35 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| Int)) (let ((.cse7 (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0))) (and (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (<= .cse7 2147483647) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0) (<= 2147483647 .cse7) (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|) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| 0))))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| Int)) (let ((.cse36 (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|) (<= 0 (+ 2147483647 .cse36)) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 4) (<= .cse36 2147483647) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0) (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (= |ULTIMATE.start_goodB2G_~result~0#1| .cse36) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| 0))))) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35))) [2022-11-22 00:16:57,678 INFO L899 garLoopResultBuilder]: For program point L1585-1(lines 1580 1587) no Hoare annotation was computed. [2022-11-22 00:16:57,678 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1583) no Hoare annotation was computed. [2022-11-22 00:16:57,679 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1553) no Hoare annotation was computed. [2022-11-22 00:16:57,679 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 00:16:57,679 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1557) no Hoare annotation was computed. [2022-11-22 00:16:57,679 INFO L899 garLoopResultBuilder]: For program point L1561(line 1561) no Hoare annotation was computed. [2022-11-22 00:16:57,679 INFO L899 garLoopResultBuilder]: For program point L1561-1(line 1561) no Hoare annotation was computed. [2022-11-22 00:16:57,679 INFO L899 garLoopResultBuilder]: For program point L1557-2(line 1557) no Hoare annotation was computed. [2022-11-22 00:16:57,680 INFO L899 garLoopResultBuilder]: For program point L1557-3(line 1557) no Hoare annotation was computed. [2022-11-22 00:16:57,680 INFO L895 garLoopResultBuilder]: At program point L1557-4(lines 1557 1569) the Hoare annotation is: (let ((.cse12 (select (select |#memory_int| |ULTIMATE.start_goodB2G_~#data~0#1.base|) |ULTIMATE.start_goodB2G_~#data~0#1.offset|))) (let ((.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 |#length| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 4)) (.cse4 (= (select (select |#memory_int| 1) 0) 0)) (.cse5 (= ~globalArgv~0.offset 0)) (.cse6 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse7 (= (select |#valid| 3) 1)) (.cse8 (= ~GLOBAL_CONST_TRUE~0 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|)) (.cse11 (= |ULTIMATE.start_goodB2G_~k~0#1| 1)) (.cse13 (= (select |#valid| 4) 1)) (.cse14 (= (select |#length| 3) 18)) (.cse15 (= (select |#valid| 1) 1)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse17 (= ~globalArgv~0.base 0)) (.cse18 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse19 (= (select |#valid| 0) 0)) (.cse20 (= 54 (select |#length| 2))) (.cse21 (= (select |#length| 1) 1)) (.cse22 (= (select |#valid| 2) 1)) (.cse23 (= 16 (select |#length| 4))) (.cse24 (= |#NULL.offset| 0)) (.cse25 (= ~globalFalse~0 0)) (.cse26 (= |ULTIMATE.start_goodB2G_~i~1#1| 1)) (.cse27 (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G_~#data~0#1.base|)) (.cse28 (= ~globalArgc~0 0)) (.cse29 (= (select |#valid| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 1)) (.cse30 (= 5 ~globalFive~0)) (.cse31 (= |ULTIMATE.start_goodB2G_~#data~0#1.offset| 0)) (.cse32 (<= .cse12 2147483647)) (.cse33 (< 0 |#StackHeapBarrier|)) (.cse34 (= |#NULL.base| 0)) (.cse35 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_goodB2G_~result~0#1| .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= 0 (+ 2147483647 .cse12)) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and (<= 0 (+ .cse12 2147483648)) .cse0 (= |ULTIMATE.start_goodB2G_~k~0#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= 2147483647 .cse12) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35)))) [2022-11-22 00:16:57,680 INFO L899 garLoopResultBuilder]: For program point L1553-3(line 1553) no Hoare annotation was computed. [2022-11-22 00:16:57,681 INFO L899 garLoopResultBuilder]: For program point L1553-4(line 1553) no Hoare annotation was computed. [2022-11-22 00:16:57,681 INFO L895 garLoopResultBuilder]: At program point L1553-5(lines 1553 1556) the Hoare annotation is: (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)) (.cse24 (select (select |#memory_int| |ULTIMATE.start_goodB2G_~#data~0#1.base|) |ULTIMATE.start_goodB2G_~#data~0#1.offset|)) (.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 (<= .cse24 2147483647) .cse44) (and .cse25 .cse26 .cse27 .cse28 (= .cse24 0) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44)))) [2022-11-22 00:16:57,682 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1583) no Hoare annotation was computed. [2022-11-22 00:16:57,682 INFO L902 garLoopResultBuilder]: At program point L1599(line 1599) the Hoare annotation is: true [2022-11-22 00:16:57,682 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1561) no Hoare annotation was computed. [2022-11-22 00:16:57,682 INFO L902 garLoopResultBuilder]: At program point L1599-1(line 1599) the Hoare annotation is: true [2022-11-22 00:16:57,682 INFO L899 garLoopResultBuilder]: For program point L1583(line 1583) no Hoare annotation was computed. [2022-11-22 00:16:57,683 INFO L899 garLoopResultBuilder]: For program point L1583-1(line 1583) no Hoare annotation was computed. [2022-11-22 00:16:57,683 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1580) no Hoare annotation was computed. [2022-11-22 00:16:57,683 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1576) no Hoare annotation was computed. [2022-11-22 00:16:57,687 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:57,689 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:16:57,700 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-22 00:16:57,701 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-22 00:16:57,702 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-22 00:16:57,702 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-22 00:16:57,702 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-22 00:16:57,703 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-22 00:16:57,703 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-22 00:16:57,703 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-22 00:16:57,703 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-22 00:16:57,704 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-22 00:16:57,704 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-22 00:16:57,705 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-22 00:16:57,705 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-22 00:16:57,705 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-22 00:16:57,706 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-22 00:16:57,706 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-22 00:16:57,706 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-22 00:16:57,706 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-22 00:16:57,707 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-22 00:16:57,707 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-22 00:16:57,707 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-22 00:16:57,708 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-22 00:16:57,708 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-22 00:16:57,709 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-22 00:16:57,709 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-22 00:16:57,709 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-22 00:16:57,710 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-22 00:16:57,710 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-22 00:16:57,710 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-22 00:16:57,711 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-22 00:16:57,711 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-22 00:16:57,712 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-22 00:16:57,712 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-22 00:16:57,713 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-22 00:16:57,713 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-22 00:16:57,713 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-22 00:16:57,714 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-22 00:16:57,714 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-22 00:16:57,714 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-22 00:16:57,715 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-22 00:16:57,715 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-22 00:16:57,715 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-22 00:16:57,729 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-22 00:16:57,730 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-22 00:16:57,730 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-22 00:16:57,730 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-22 00:16:57,731 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-22 00:16:57,731 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-22 00:16:57,731 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-22 00:16:57,732 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-22 00:16:57,732 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-22 00:16:57,732 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-22 00:16:57,732 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-22 00:16:57,733 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-22 00:16:57,733 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-22 00:16:57,734 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-22 00:16:57,734 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-22 00:16:57,734 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-22 00:16:57,734 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-22 00:16:57,735 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-22 00:16:57,735 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-22 00:16:57,735 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-22 00:16:57,736 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-22 00:16:57,736 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-22 00:16:57,736 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-22 00:16:57,737 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-22 00:16:57,737 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-22 00:16:57,737 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-22 00:16:57,738 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-22 00:16:57,738 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-22 00:16:57,739 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-22 00:16:57,739 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-22 00:16:57,739 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-22 00:16:57,740 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-22 00:16:57,740 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-22 00:16:57,740 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-22 00:16:57,741 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-22 00:16:57,741 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-22 00:16:57,741 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-22 00:16:57,742 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-22 00:16:57,742 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-22 00:16:57,742 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-22 00:16:57,743 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-22 00:16:57,743 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-22 00:16:57,749 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-22 00:16:57,749 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-22 00:16:57,749 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-22 00:16:57,750 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-22 00:16:57,750 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-22 00:16:57,750 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-22 00:16:57,751 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-22 00:16:57,751 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-22 00:16:57,751 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-22 00:16:57,752 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-22 00:16:57,752 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-22 00:16:57,752 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-22 00:16:57,753 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-22 00:16:57,753 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-22 00:16:57,753 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-22 00:16:57,754 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-22 00:16:57,754 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-22 00:16:57,755 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-22 00:16:57,755 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-22 00:16:57,755 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-22 00:16:57,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-22 00:16:57,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-22 00:16:57,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-22 00:16:57,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-22 00:16:57,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-22 00:16:57,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-22 00:16:57,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-22 00:16:57,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-22 00:16:57,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-22 00:16:57,759 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-22 00:16:57,759 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-22 00:16:57,760 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-22 00:16:57,760 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-22 00:16:57,760 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-22 00:16:57,761 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-22 00:16:57,761 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-22 00:16:57,761 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-22 00:16:57,761 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-22 00:16:57,762 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-22 00:16:57,762 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-22 00:16:57,762 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-22 00:16:57,763 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-22 00:16:57,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-22 00:16:57,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-22 00:16:57,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-22 00:16:57,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-22 00:16:57,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-22 00:16:57,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-22 00:16:57,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-22 00:16:57,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-22 00:16:57,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-22 00:16:57,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-22 00:16:57,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-22 00:16:57,770 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-22 00:16:57,770 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-22 00:16:57,771 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-22 00:16:57,771 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-22 00:16:57,771 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-22 00:16:57,772 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-22 00:16:57,772 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-22 00:16:57,772 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-22 00:16:57,773 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-22 00:16:57,773 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-22 00:16:57,774 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-22 00:16:57,774 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-22 00:16:57,774 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-22 00:16:57,775 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-22 00:16:57,775 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-22 00:16:57,775 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-22 00:16:57,776 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-22 00:16:57,776 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-22 00:16:57,776 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-22 00:16:57,777 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-22 00:16:57,777 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-22 00:16:57,778 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-22 00:16:57,778 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-22 00:16:57,778 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-22 00:16:57,778 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-22 00:16:57,779 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-22 00:16:57,779 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-22 00:16:57,779 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-22 00:16:57,780 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-22 00:16:57,780 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-22 00:16:57,780 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-22 00:16:57,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:16:57 BoogieIcfgContainer [2022-11-22 00:16:57,792 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:16:57,793 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:16:57,793 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:16:57,793 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:16:57,794 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:16:22" (3/4) ... [2022-11-22 00:16:57,797 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 00:16:57,804 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-22 00:16:57,804 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-22 00:16:57,809 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-22 00:16:57,809 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-22 00:16:57,810 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-22 00:16:57,810 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 00:16:57,839 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) && unknown-#memory_int-unknown[data][data] <= 2147483647) && 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)) [2022-11-22 00:16:57,839 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((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) && result == unknown-#memory_int-unknown[data][data]) && \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) && 0 <= 2147483647 + unknown-#memory_int-unknown[data][data]) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && globalArgc == 0) && \valid[data] == 1) && 5 == globalFive) && data == 0) && unknown-#memory_int-unknown[data][data] <= 2147483647) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || (((((((((((((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && GLOBAL_CONST_FALSE == 0) && k == 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) && \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) && unknown-#StackHeapBarrier-unknown < data) && globalArgc == 0) && \valid[data] == 1) && 5 == globalFive) && data == 0) && unknown-#memory_int-unknown[data][data] <= 2147483647) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1)) || (((((((((((((((((((((((((((((((((((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) && 2147483647 <= unknown-#memory_int-unknown[data][data]) && globalFalse == 0) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && globalArgc == 0) && \valid[data] == 1) && 5 == globalFive) && data == 0) && unknown-#memory_int-unknown[data][data] <= 2147483647) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) [2022-11-22 00:16:57,840 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= k && globalFalse <= 0) && #NULL <= 0) && 0 <= globalFalse) && 0 <= globalArgv) && globalArgv <= 0) && k <= 1) && 0 <= #NULL) && (((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 2) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && \valid[4] == 1) && (\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) && 0 <= 2147483647 + unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && 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) && globalArgv == 0) && data == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && \valid[4] == 1) && (\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) && 0 <= 2147483647 + unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && 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))) || ((((((((((((((((5 <= globalFive && (((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && 2147483647 <= unknown-#memory_int-unknown[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) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && 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) && h == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && globalArgc == 0) && 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) && data == 2) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && 2147483647 <= unknown-#memory_int-unknown[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) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 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) && globalArgc == 0) && 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) && 0 <= globalArgv) && k <= 1) && 0 <= #NULL) && globalFive <= 5) [2022-11-22 00:16:57,840 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && j == 0) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 2) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && k == 1) && \valid[4] == 1) && (\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) && 0 <= 2147483647 + unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && 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) || (((((((((((((((((((((((((((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && h <= 1) && 5 <= globalFive) && argv == argv) && argc == \old(argc)) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && 1 <= j) && 1 <= h) && 1 <= k) && unknown-#memory_int-unknown[1][0] == 0) && globalFalse <= 0) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && 2147483647 <= unknown-#memory_int-unknown[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) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && 3 <= data) && GLOBAL_CONST_FIVE <= 5) && data <= 3) && \valid[3] == 1) && argv == argv) && #NULL <= 0) && argv == argv) && 1 <= GLOBAL_CONST_TRUE) && \valid[4] == 1) && 3 <= result) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && 0 <= globalFalse) && 0 <= globalArgc) && result <= 3) && 0 <= globalArgv) && argv == argv) && #NULL <= 0) && \old(argc) == \old(argc)) && \valid[0] == 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && 0 <= globalArgv) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && j <= 1) && 1 <= globalTrue) && k <= 1) && 0 <= #NULL) && globalFive <= 5) && 0 < unknown-#StackHeapBarrier-unknown) && i <= 1)) || (((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && j == 0) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 2) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && 2147483647 <= unknown-#memory_int-unknown[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) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 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) && 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) && k == 1) && \valid[4] == 1) && 3 <= result) && (\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) && 0 <= 2147483647 + unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && result <= 3) && 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) [2022-11-22 00:16:57,854 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 00:16:57,858 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:16:57,858 INFO L158 Benchmark]: Toolchain (without parser) took 37837.78ms. Allocated memory was 163.6MB in the beginning and 427.8MB in the end (delta: 264.2MB). Free memory was 119.9MB in the beginning and 180.5MB in the end (delta: -60.6MB). Peak memory consumption was 204.9MB. Max. memory is 16.1GB. [2022-11-22 00:16:57,860 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 163.6MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:16:57,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1529.71ms. Allocated memory is still 163.6MB. Free memory was 119.5MB in the beginning and 57.4MB in the end (delta: 62.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2022-11-22 00:16:57,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.27ms. Allocated memory is still 163.6MB. Free memory was 57.4MB in the beginning and 54.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:16:57,862 INFO L158 Benchmark]: Boogie Preprocessor took 66.68ms. Allocated memory is still 163.6MB. Free memory was 54.5MB in the beginning and 52.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:16:57,862 INFO L158 Benchmark]: RCFGBuilder took 726.71ms. Allocated memory is still 163.6MB. Free memory was 52.8MB in the beginning and 117.2MB in the end (delta: -64.4MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2022-11-22 00:16:57,862 INFO L158 Benchmark]: TraceAbstraction took 35343.52ms. Allocated memory was 163.6MB in the beginning and 427.8MB in the end (delta: 264.2MB). Free memory was 116.4MB in the beginning and 183.6MB in the end (delta: -67.2MB). Peak memory consumption was 243.1MB. Max. memory is 16.1GB. [2022-11-22 00:16:57,863 INFO L158 Benchmark]: Witness Printer took 64.78ms. Allocated memory is still 427.8MB. Free memory was 183.6MB in the beginning and 180.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:16:57,864 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.23ms. Allocated memory is still 163.6MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1529.71ms. Allocated memory is still 163.6MB. Free memory was 119.5MB in the beginning and 57.4MB in the end (delta: 62.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.27ms. Allocated memory is still 163.6MB. Free memory was 57.4MB in the beginning and 54.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.68ms. Allocated memory is still 163.6MB. Free memory was 54.5MB in the beginning and 52.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 726.71ms. Allocated memory is still 163.6MB. Free memory was 52.8MB in the beginning and 117.2MB in the end (delta: -64.4MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * TraceAbstraction took 35343.52ms. Allocated memory was 163.6MB in the beginning and 427.8MB in the end (delta: 264.2MB). Free memory was 116.4MB in the beginning and 183.6MB in the end (delta: -67.2MB). Peak memory consumption was 243.1MB. Max. memory is 16.1GB. * Witness Printer took 64.78ms. Allocated memory is still 427.8MB. Free memory was 183.6MB in the beginning and 180.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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_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_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_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] * 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: 35.2s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 1018 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 643 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1048 IncrementalHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 375 mSDtfsCounter, 1048 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 215 SyntacticMatches, 9 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 16.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=7, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 31 PreInvPairs, 50 NumberOfFragments, 3020 HoareAnnotationTreeSize, 31 FomulaSimplifications, 94 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 4495 FormulaSimplificationTreeSizeReductionInter, 6.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 432 ConstructedInterpolants, 0 QuantifiedInterpolants, 722 SizeOfPredicates, 3 NumberOfNonLiveVariables, 847 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 20 InterpolantComputations, 11 PerfectInterpolantSequences, 89/102 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.4s, 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.2s, 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.1s, 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.8s, 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: 2871, 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-22 00:16:57,896 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-22 00:16:57,896 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-22 00:16:57,897 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-22 00:16:57,897 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-22 00:16:57,897 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-22 00:16:57,897 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-22 00:16:57,898 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-22 00:16:57,898 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-22 00:16:57,898 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-22 00:16:57,898 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-22 00:16:57,898 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-22 00:16:57,899 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-22 00:16:57,899 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-22 00:16:57,899 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-22 00:16:57,900 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-22 00:16:57,900 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-22 00:16:57,900 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-22 00:16:57,900 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-22 00:16:57,901 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-22 00:16:57,901 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-22 00:16:57,901 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-22 00:16:57,901 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-22 00:16:57,902 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-22 00:16:57,902 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-22 00:16:57,902 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-22 00:16:57,903 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-22 00:16:57,903 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-22 00:16:57,903 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-22 00:16:57,904 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-22 00:16:57,904 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-22 00:16:57,904 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-22 00:16:57,905 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-22 00:16:57,905 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-22 00:16:57,905 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-22 00:16:57,906 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-22 00:16:57,906 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-22 00:16:57,906 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-22 00:16:57,907 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-22 00:16:57,907 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-22 00:16:57,907 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-22 00:16:57,908 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-22 00:16:57,908 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-22 00:16:57,910 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-22 00:16:57,910 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-22 00:16:57,910 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-22 00:16:57,910 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-22 00:16:57,911 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-22 00:16:57,911 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-22 00:16:57,911 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-22 00:16:57,912 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-22 00:16:57,912 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-22 00:16:57,912 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-22 00:16:57,912 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-22 00:16:57,913 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-22 00:16:57,913 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-22 00:16:57,913 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-22 00:16:57,913 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-22 00:16:57,914 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-22 00:16:57,914 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-22 00:16:57,914 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-22 00:16:57,914 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-22 00:16:57,915 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-22 00:16:57,915 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-22 00:16:57,915 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-22 00:16:57,916 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-22 00:16:57,916 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-22 00:16:57,916 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-22 00:16:57,917 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-22 00:16:57,917 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-22 00:16:57,917 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-22 00:16:57,917 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-22 00:16:57,918 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-22 00:16:57,918 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-22 00:16:57,918 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-22 00:16:57,919 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-22 00:16:57,919 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-22 00:16:57,919 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-22 00:16:57,920 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-22 00:16:57,920 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-22 00:16:57,920 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-22 00:16:57,921 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-22 00:16:57,921 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-22 00:16:57,921 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-22 00:16:57,922 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: ((((((((1 <= k && globalFalse <= 0) && #NULL <= 0) && 0 <= globalFalse) && 0 <= globalArgv) && globalArgv <= 0) && k <= 1) && 0 <= #NULL) && (((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 2) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && \valid[4] == 1) && (\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) && 0 <= 2147483647 + unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && 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) && globalArgv == 0) && data == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && \valid[4] == 1) && (\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) && 0 <= 2147483647 + unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && 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))) || ((((((((((((((((5 <= globalFive && (((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && 2147483647 <= unknown-#memory_int-unknown[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) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && 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) && h == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && globalArgc == 0) && 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) && data == 2) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && 2147483647 <= unknown-#memory_int-unknown[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) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 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) && globalArgc == 0) && 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) && 0 <= globalArgv) && k <= 1) && 0 <= #NULL) && globalFive <= 5) - InvariantResult [Line: 1580]: Loop Invariant [2022-11-22 00:16:57,924 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-22 00:16:57,924 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-22 00:16:57,924 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-22 00:16:57,925 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-22 00:16:57,925 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-22 00:16:57,925 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-22 00:16:57,926 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-22 00:16:57,926 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-22 00:16:57,926 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-22 00:16:57,926 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-22 00:16:57,927 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-22 00:16:57,927 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-22 00:16:57,927 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-22 00:16:57,927 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-22 00:16:57,928 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-22 00:16:57,928 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-22 00:16:57,928 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-22 00:16:57,929 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-22 00:16:57,929 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-22 00:16:57,929 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-22 00:16:57,930 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-22 00:16:57,930 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-22 00:16:57,930 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-22 00:16:57,931 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-22 00:16:57,931 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-22 00:16:57,931 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-22 00:16:57,932 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-22 00:16:57,932 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-22 00:16:57,932 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-22 00:16:57,932 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-22 00:16:57,933 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-22 00:16:57,933 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-22 00:16:57,933 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-22 00:16:57,933 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-22 00:16:57,934 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-22 00:16:57,934 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-22 00:16:57,934 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-22 00:16:57,935 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-22 00:16:57,935 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-22 00:16:57,935 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-22 00:16:57,935 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-22 00:16:57,936 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-22 00:16:57,937 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-22 00:16:57,938 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-22 00:16:57,938 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-22 00:16:57,938 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-22 00:16:57,938 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-22 00:16:57,939 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-22 00:16:57,939 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-22 00:16:57,939 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-22 00:16:57,939 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-22 00:16:57,940 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-22 00:16:57,940 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-22 00:16:57,940 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-22 00:16:57,941 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-22 00:16:57,941 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-22 00:16:57,941 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-22 00:16:57,941 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-22 00:16:57,942 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-22 00:16:57,942 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-22 00:16:57,942 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-22 00:16:57,943 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-22 00:16:57,943 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-22 00:16:57,943 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-22 00:16:57,944 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-22 00:16:57,944 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-22 00:16:57,944 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-22 00:16:57,944 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-22 00:16:57,945 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-22 00:16:57,945 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-22 00:16:57,945 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-22 00:16:57,945 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-22 00:16:57,946 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-22 00:16:57,946 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-22 00:16:57,946 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-22 00:16:57,947 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-22 00:16:57,947 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-22 00:16:57,947 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-22 00:16:57,947 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-22 00:16:57,948 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-22 00:16:57,948 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-22 00:16:57,948 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-22 00:16:57,948 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-22 00:16:57,949 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 && h == 1) && j == 0) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 2) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && k == 1) && \valid[4] == 1) && (\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) && 0 <= 2147483647 + unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && 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) || (((((((((((((((((((((((((((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && h <= 1) && 5 <= globalFive) && argv == argv) && argc == \old(argc)) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && 1 <= j) && 1 <= h) && 1 <= k) && unknown-#memory_int-unknown[1][0] == 0) && globalFalse <= 0) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && 2147483647 <= unknown-#memory_int-unknown[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) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && 3 <= data) && GLOBAL_CONST_FIVE <= 5) && data <= 3) && \valid[3] == 1) && argv == argv) && #NULL <= 0) && argv == argv) && 1 <= GLOBAL_CONST_TRUE) && \valid[4] == 1) && 3 <= result) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && 0 <= globalFalse) && 0 <= globalArgc) && result <= 3) && 0 <= globalArgv) && argv == argv) && #NULL <= 0) && \old(argc) == \old(argc)) && \valid[0] == 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && 0 <= globalArgv) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && j <= 1) && 1 <= globalTrue) && k <= 1) && 0 <= #NULL) && globalFive <= 5) && 0 < unknown-#StackHeapBarrier-unknown) && i <= 1)) || (((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && j == 0) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 2) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && 2147483647 <= unknown-#memory_int-unknown[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) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 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) && 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) && k == 1) && \valid[4] == 1) && 3 <= result) && (\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) && 0 <= 2147483647 + unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && result <= 3) && 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) - 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) && unknown-#memory_int-unknown[data][data] <= 2147483647) && 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)) - InvariantResult [Line: 1557]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((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) && result == unknown-#memory_int-unknown[data][data]) && \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) && 0 <= 2147483647 + unknown-#memory_int-unknown[data][data]) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && globalArgc == 0) && \valid[data] == 1) && 5 == globalFive) && data == 0) && unknown-#memory_int-unknown[data][data] <= 2147483647) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || (((((((((((((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && GLOBAL_CONST_FALSE == 0) && k == 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) && \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) && unknown-#StackHeapBarrier-unknown < data) && globalArgc == 0) && \valid[data] == 1) && 5 == globalFive) && data == 0) && unknown-#memory_int-unknown[data][data] <= 2147483647) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1)) || (((((((((((((((((((((((((((((((((((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) && 2147483647 <= unknown-#memory_int-unknown[data][data]) && globalFalse == 0) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && globalArgc == 0) && \valid[data] == 1) && 5 == globalFive) && data == 0) && unknown-#memory_int-unknown[data][data] <= 2147483647) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) RESULT: Ultimate proved your program to be correct! [2022-11-22 00:16:57,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08593dad-8445-4354-92af-d88d94453fad/bin/utaipan-g80aRyZoba/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