./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_08_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_08_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 544427bc529e2c0f20a946d0ff425ec392089e48ebfc4e3308da2aa6ad8905e4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 14:08:31,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:08:31,169 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-64bit-Taipan_Default.epf [2023-12-02 14:08:31,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:08:31,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:08:31,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:08:31,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:08:31,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:08:31,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:08:31,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:08:31,202 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:08:31,202 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:08:31,203 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:08:31,203 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 14:08:31,204 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:08:31,204 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:08:31,205 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 14:08:31,205 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 14:08:31,206 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:08:31,206 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 14:08:31,207 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 14:08:31,208 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 14:08:31,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:08:31,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 14:08:31,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 14:08:31,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:08:31,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 14:08:31,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:08:31,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 14:08:31,211 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 14:08:31,212 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 14:08:31,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 14:08:31,212 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:08:31,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:08:31,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:08:31,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:08:31,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:08:31,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:08:31,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:08:31,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 14:08:31,214 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 14:08:31,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 14:08:31,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:08:31,215 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 14:08:31,215 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:08:31,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:08:31,215 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/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_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 544427bc529e2c0f20a946d0ff425ec392089e48ebfc4e3308da2aa6ad8905e4 [2023-12-02 14:08:31,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:08:31,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:08:31,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:08:31,444 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:08:31,445 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:08:31,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_08_good.i [2023-12-02 14:08:34,250 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:08:34,598 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:08:34,598 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_08_good.i [2023-12-02 14:08:34,625 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/data/fa653bb53/91555666c54e462eba7460fb2c2a98ff/FLAGf3d47d108 [2023-12-02 14:08:34,641 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/data/fa653bb53/91555666c54e462eba7460fb2c2a98ff [2023-12-02 14:08:34,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:08:34,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:08:34,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:08:34,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:08:34,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:08:34,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:08:34" (1/1) ... [2023-12-02 14:08:34,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@770e2a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:34, skipping insertion in model container [2023-12-02 14:08:34,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:08:34" (1/1) ... [2023-12-02 14:08:34,715 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:08:35,663 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:08:35,677 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 14:08:35,769 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:08:35,937 WARN L675 CHandler]: The function puts is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 14:08:35,937 WARN L675 CHandler]: The function __ctype_b_loc is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 14:08:35,938 WARN L675 CHandler]: The function iswxdigit is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 14:08:35,938 WARN L675 CHandler]: The function time is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 14:08:35,938 WARN L675 CHandler]: The function fgets is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 14:08:35,945 INFO L206 MainTranslator]: Completed translation [2023-12-02 14:08:35,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:35 WrapperNode [2023-12-02 14:08:35,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:08:35,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 14:08:35,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 14:08:35,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 14:08:35,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:35" (1/1) ... [2023-12-02 14:08:35,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:35" (1/1) ... [2023-12-02 14:08:36,012 INFO L138 Inliner]: procedures = 505, calls = 94, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 163 [2023-12-02 14:08:36,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 14:08:36,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 14:08:36,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 14:08:36,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 14:08:36,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:35" (1/1) ... [2023-12-02 14:08:36,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:35" (1/1) ... [2023-12-02 14:08:36,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:35" (1/1) ... [2023-12-02 14:08:36,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:35" (1/1) ... [2023-12-02 14:08:36,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:35" (1/1) ... [2023-12-02 14:08:36,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:35" (1/1) ... [2023-12-02 14:08:36,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:35" (1/1) ... [2023-12-02 14:08:36,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:35" (1/1) ... [2023-12-02 14:08:36,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 14:08:36,047 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 14:08:36,047 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 14:08:36,047 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 14:08:36,048 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:35" (1/1) ... [2023-12-02 14:08:36,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:08:36,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:36,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 14:08:36,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 14:08:36,120 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2023-12-02 14:08:36,121 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2023-12-02 14:08:36,121 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2023-12-02 14:08:36,121 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2023-12-02 14:08:36,121 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2023-12-02 14:08:36,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 14:08:36,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-12-02 14:08:36,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 14:08:36,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 14:08:36,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 14:08:36,123 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2023-12-02 14:08:36,123 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2023-12-02 14:08:36,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 14:08:36,124 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2023-12-02 14:08:36,124 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2023-12-02 14:08:36,124 INFO L130 BoogieDeclarations]: Found specification of procedure time [2023-12-02 14:08:36,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 14:08:36,277 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 14:08:36,279 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 14:08:36,498 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 14:08:36,538 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 14:08:36,539 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 14:08:36,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:08:36 BoogieIcfgContainer [2023-12-02 14:08:36,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 14:08:36,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 14:08:36,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 14:08:36,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 14:08:36,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:08:34" (1/3) ... [2023-12-02 14:08:36,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736ed08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:08:36, skipping insertion in model container [2023-12-02 14:08:36,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:35" (2/3) ... [2023-12-02 14:08:36,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736ed08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:08:36, skipping insertion in model container [2023-12-02 14:08:36,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:08:36" (3/3) ... [2023-12-02 14:08:36,550 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_multiply_08_good.i [2023-12-02 14:08:36,569 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 14:08:36,570 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-12-02 14:08:36,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 14:08:36,628 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=LoopHeads, 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;@32533a2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 14:08:36,629 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-12-02 14:08:36,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 62 states have internal predecessors, (77), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 14:08:36,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 14:08:36,640 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:36,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:36,641 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 14:08:36,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:36,647 INFO L85 PathProgramCache]: Analyzing trace with hash -296961157, now seen corresponding path program 1 times [2023-12-02 14:08:36,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:36,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396482360] [2023-12-02 14:08:36,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:36,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:36,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:36,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396482360] [2023-12-02 14:08:36,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396482360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:36,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:36,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:08:36,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346121874] [2023-12-02 14:08:36,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:36,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:08:37,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:37,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:08:37,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:08:37,030 INFO L87 Difference]: Start difference. First operand has 87 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 62 states have internal predecessors, (77), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 14:08:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:37,105 INFO L93 Difference]: Finished difference Result 164 states and 219 transitions. [2023-12-02 14:08:37,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:08:37,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2023-12-02 14:08:37,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:37,116 INFO L225 Difference]: With dead ends: 164 [2023-12-02 14:08:37,117 INFO L226 Difference]: Without dead ends: 81 [2023-12-02 14:08:37,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:08:37,124 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:37,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:08:37,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-02 14:08:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-12-02 14:08:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 58 states have internal predecessors, (70), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-02 14:08:37,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2023-12-02 14:08:37,170 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 18 [2023-12-02 14:08:37,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:37,171 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2023-12-02 14:08:37,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 14:08:37,172 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2023-12-02 14:08:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 14:08:37,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:37,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:37,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 14:08:37,174 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 14:08:37,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:37,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1572497610, now seen corresponding path program 1 times [2023-12-02 14:08:37,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:37,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098070633] [2023-12-02 14:08:37,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:37,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:37,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:37,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098070633] [2023-12-02 14:08:37,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098070633] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:37,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:37,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:08:37,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171126606] [2023-12-02 14:08:37,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:37,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:08:37,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:37,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:08:37,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:08:37,277 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 14:08:37,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:37,328 INFO L93 Difference]: Finished difference Result 148 states and 193 transitions. [2023-12-02 14:08:37,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:08:37,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2023-12-02 14:08:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:37,330 INFO L225 Difference]: With dead ends: 148 [2023-12-02 14:08:37,331 INFO L226 Difference]: Without dead ends: 89 [2023-12-02 14:08:37,332 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 [2023-12-02 14:08:37,333 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 14 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:37,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 188 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:08:37,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-02 14:08:37,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2023-12-02 14:08:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 62 states have internal predecessors, (76), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-02 14:08:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 114 transitions. [2023-12-02 14:08:37,350 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 114 transitions. Word has length 20 [2023-12-02 14:08:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:37,350 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 114 transitions. [2023-12-02 14:08:37,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 14:08:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 114 transitions. [2023-12-02 14:08:37,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 14:08:37,352 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:37,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:37,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 14:08:37,353 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 14:08:37,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:37,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1502785572, now seen corresponding path program 1 times [2023-12-02 14:08:37,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:37,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579914496] [2023-12-02 14:08:37,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:37,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:37,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:37,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579914496] [2023-12-02 14:08:37,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579914496] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:37,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:37,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:08:37,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276364874] [2023-12-02 14:08:37,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:37,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:08:37,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:37,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:08:37,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:08:37,431 INFO L87 Difference]: Start difference. First operand 86 states and 114 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 14:08:37,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:37,470 INFO L93 Difference]: Finished difference Result 87 states and 115 transitions. [2023-12-02 14:08:37,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:08:37,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2023-12-02 14:08:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:37,473 INFO L225 Difference]: With dead ends: 87 [2023-12-02 14:08:37,473 INFO L226 Difference]: Without dead ends: 86 [2023-12-02 14:08:37,473 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 [2023-12-02 14:08:37,475 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 4 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 180 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 [2023-12-02 14:08:37,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 180 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:08:37,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-02 14:08:37,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2023-12-02 14:08:37,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 61 states have internal predecessors, (75), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-02 14:08:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 113 transitions. [2023-12-02 14:08:37,489 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 113 transitions. Word has length 21 [2023-12-02 14:08:37,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:37,490 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 113 transitions. [2023-12-02 14:08:37,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 14:08:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 113 transitions. [2023-12-02 14:08:37,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 14:08:37,492 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:37,492 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:37,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 14:08:37,493 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 14:08:37,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:37,493 INFO L85 PathProgramCache]: Analyzing trace with hash 604636002, now seen corresponding path program 1 times [2023-12-02 14:08:37,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:37,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273438858] [2023-12-02 14:08:37,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:37,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:08:37,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273438858] [2023-12-02 14:08:37,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273438858] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:08:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368214719] [2023-12-02 14:08:37,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:37,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:37,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:37,599 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:08:37,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 14:08:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:37,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 14:08:37,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:08:37,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 14:08:37,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:08:37,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368214719] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:37,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:08:37,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-12-02 14:08:37,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77770292] [2023-12-02 14:08:37,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:37,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:08:37,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:37,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:08:37,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:08:37,769 INFO L87 Difference]: Start difference. First operand 85 states and 113 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 14:08:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:37,803 INFO L93 Difference]: Finished difference Result 135 states and 173 transitions. [2023-12-02 14:08:37,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:08:37,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2023-12-02 14:08:37,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:37,805 INFO L225 Difference]: With dead ends: 135 [2023-12-02 14:08:37,806 INFO L226 Difference]: Without dead ends: 91 [2023-12-02 14:08:37,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:08:37,808 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 6 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:37,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 178 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:08:37,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-02 14:08:37,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2023-12-02 14:08:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 65 states have internal predecessors, (80), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 14:08:37,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 120 transitions. [2023-12-02 14:08:37,821 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 120 transitions. Word has length 32 [2023-12-02 14:08:37,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:37,821 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 120 transitions. [2023-12-02 14:08:37,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 14:08:37,822 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 120 transitions. [2023-12-02 14:08:37,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 14:08:37,823 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:37,824 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:37,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 14:08:38,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:38,029 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 14:08:38,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:38,029 INFO L85 PathProgramCache]: Analyzing trace with hash -717002115, now seen corresponding path program 1 times [2023-12-02 14:08:38,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:38,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895500386] [2023-12-02 14:08:38,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:38,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 14:08:38,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:38,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895500386] [2023-12-02 14:08:38,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895500386] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:38,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:38,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:08:38,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935245124] [2023-12-02 14:08:38,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:38,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:08:38,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:38,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:08:38,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:08:38,095 INFO L87 Difference]: Start difference. First operand 90 states and 120 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 14:08:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:38,128 INFO L93 Difference]: Finished difference Result 91 states and 121 transitions. [2023-12-02 14:08:38,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:08:38,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2023-12-02 14:08:38,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:38,130 INFO L225 Difference]: With dead ends: 91 [2023-12-02 14:08:38,130 INFO L226 Difference]: Without dead ends: 90 [2023-12-02 14:08:38,130 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 [2023-12-02 14:08:38,131 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 13 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:38,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 178 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:08:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-02 14:08:38,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2023-12-02 14:08:38,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 64 states have internal predecessors, (79), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 14:08:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2023-12-02 14:08:38,142 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 34 [2023-12-02 14:08:38,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:38,142 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2023-12-02 14:08:38,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 14:08:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2023-12-02 14:08:38,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 14:08:38,144 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:38,144 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:38,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 14:08:38,145 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 14:08:38,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:38,145 INFO L85 PathProgramCache]: Analyzing trace with hash -752228960, now seen corresponding path program 1 times [2023-12-02 14:08:38,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:38,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541993785] [2023-12-02 14:08:38,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:38,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 14:08:38,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:38,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541993785] [2023-12-02 14:08:38,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541993785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:38,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:38,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:08:38,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047674071] [2023-12-02 14:08:38,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:38,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:08:38,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:38,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:08:38,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:08:38,206 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 14:08:38,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:38,236 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2023-12-02 14:08:38,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:08:38,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2023-12-02 14:08:38,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:38,238 INFO L225 Difference]: With dead ends: 90 [2023-12-02 14:08:38,238 INFO L226 Difference]: Without dead ends: 89 [2023-12-02 14:08:38,238 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 [2023-12-02 14:08:38,239 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 176 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 [2023-12-02 14:08:38,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 176 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:08:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-02 14:08:38,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2023-12-02 14:08:38,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.3) internal successors, (78), 63 states have internal predecessors, (78), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 14:08:38,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 118 transitions. [2023-12-02 14:08:38,249 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 118 transitions. Word has length 35 [2023-12-02 14:08:38,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:38,250 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 118 transitions. [2023-12-02 14:08:38,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 14:08:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 118 transitions. [2023-12-02 14:08:38,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 14:08:38,252 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:38,253 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:38,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 14:08:38,253 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 14:08:38,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:38,254 INFO L85 PathProgramCache]: Analyzing trace with hash 703582655, now seen corresponding path program 1 times [2023-12-02 14:08:38,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:38,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287748571] [2023-12-02 14:08:38,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:38,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 14:08:38,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:38,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287748571] [2023-12-02 14:08:38,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287748571] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:08:38,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202626899] [2023-12-02 14:08:38,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:38,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:38,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:38,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:08:38,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 14:08:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:38,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 14:08:38,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:08:38,474 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 14:08:38,474 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:08:38,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202626899] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:38,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:08:38,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-12-02 14:08:38,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525270500] [2023-12-02 14:08:38,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:38,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:08:38,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:38,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:08:38,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:08:38,477 INFO L87 Difference]: Start difference. First operand 88 states and 118 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-02 14:08:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:38,502 INFO L93 Difference]: Finished difference Result 88 states and 118 transitions. [2023-12-02 14:08:38,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:08:38,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 42 [2023-12-02 14:08:38,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:38,504 INFO L225 Difference]: With dead ends: 88 [2023-12-02 14:08:38,504 INFO L226 Difference]: Without dead ends: 87 [2023-12-02 14:08:38,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:08:38,505 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 9 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:38,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 166 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:08:38,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-02 14:08:38,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-12-02 14:08:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 62 states have internal predecessors, (77), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 14:08:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2023-12-02 14:08:38,514 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 42 [2023-12-02 14:08:38,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:38,515 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2023-12-02 14:08:38,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-02 14:08:38,515 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2023-12-02 14:08:38,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 14:08:38,517 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:38,517 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:38,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 14:08:38,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:38,721 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 14:08:38,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:38,721 INFO L85 PathProgramCache]: Analyzing trace with hash 336225986, now seen corresponding path program 1 times [2023-12-02 14:08:38,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:38,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575670244] [2023-12-02 14:08:38,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:38,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 14:08:38,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:38,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575670244] [2023-12-02 14:08:38,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575670244] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:08:38,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815303208] [2023-12-02 14:08:38,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:38,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:38,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:38,810 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:08:38,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 14:08:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:38,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 14:08:38,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:08:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 14:08:38,935 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:08:38,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815303208] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:38,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:08:38,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-12-02 14:08:38,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598312509] [2023-12-02 14:08:38,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:38,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:08:38,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:38,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:08:38,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:08:38,937 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-02 14:08:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:38,966 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2023-12-02 14:08:38,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:08:38,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2023-12-02 14:08:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:38,968 INFO L225 Difference]: With dead ends: 110 [2023-12-02 14:08:38,969 INFO L226 Difference]: Without dead ends: 96 [2023-12-02 14:08:38,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:08:38,970 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:38,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 179 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:08:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-02 14:08:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2023-12-02 14:08:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 67 states have internal predecessors, (83), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-02 14:08:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2023-12-02 14:08:38,979 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 125 transitions. Word has length 43 [2023-12-02 14:08:38,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:38,980 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 125 transitions. [2023-12-02 14:08:38,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-02 14:08:38,980 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2023-12-02 14:08:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 14:08:38,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:38,983 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:38,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 14:08:39,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:39,188 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 14:08:39,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:39,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1125738395, now seen corresponding path program 1 times [2023-12-02 14:08:39,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:39,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659318490] [2023-12-02 14:08:39,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:39,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 14:08:39,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:39,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659318490] [2023-12-02 14:08:39,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659318490] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:08:39,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868300889] [2023-12-02 14:08:39,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:39,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:39,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:39,261 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:08:39,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 14:08:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:39,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 14:08:39,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:08:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 14:08:39,401 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:08:39,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868300889] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:39,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:08:39,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-12-02 14:08:39,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637969803] [2023-12-02 14:08:39,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:39,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:08:39,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:39,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:08:39,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:08:39,403 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-02 14:08:39,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:39,428 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2023-12-02 14:08:39,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:08:39,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 47 [2023-12-02 14:08:39,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:39,430 INFO L225 Difference]: With dead ends: 111 [2023-12-02 14:08:39,430 INFO L226 Difference]: Without dead ends: 91 [2023-12-02 14:08:39,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:08:39,431 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 2 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:39,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 182 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:08:39,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-02 14:08:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2023-12-02 14:08:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.253968253968254) internal successors, (79), 64 states have internal predecessors, (79), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-02 14:08:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 121 transitions. [2023-12-02 14:08:39,439 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 121 transitions. Word has length 47 [2023-12-02 14:08:39,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:39,440 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 121 transitions. [2023-12-02 14:08:39,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-02 14:08:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 121 transitions. [2023-12-02 14:08:39,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-02 14:08:39,442 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:39,442 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:39,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 14:08:39,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:39,645 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 14:08:39,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:39,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1372838386, now seen corresponding path program 1 times [2023-12-02 14:08:39,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:39,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244718813] [2023-12-02 14:08:39,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:39,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 14:08:39,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:39,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244718813] [2023-12-02 14:08:39,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244718813] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:08:39,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881478337] [2023-12-02 14:08:39,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:39,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:39,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:39,706 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:08:39,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 14:08:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:39,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:08:39,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:08:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 14:08:39,846 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:08:39,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881478337] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:39,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:08:39,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-12-02 14:08:39,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510192593] [2023-12-02 14:08:39,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:39,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:08:39,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:39,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:08:39,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:08:39,848 INFO L87 Difference]: Start difference. First operand 90 states and 121 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-02 14:08:39,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:39,878 INFO L93 Difference]: Finished difference Result 131 states and 169 transitions. [2023-12-02 14:08:39,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:08:39,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 52 [2023-12-02 14:08:39,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:39,880 INFO L225 Difference]: With dead ends: 131 [2023-12-02 14:08:39,880 INFO L226 Difference]: Without dead ends: 90 [2023-12-02 14:08:39,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:08:39,881 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:39,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:08:39,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-02 14:08:39,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-12-02 14:08:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-02 14:08:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 120 transitions. [2023-12-02 14:08:39,892 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 120 transitions. Word has length 52 [2023-12-02 14:08:39,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:39,893 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 120 transitions. [2023-12-02 14:08:39,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-02 14:08:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 120 transitions. [2023-12-02 14:08:39,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 14:08:39,895 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:39,895 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:39,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 14:08:40,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 14:08:40,096 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 14:08:40,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:40,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1741549993, now seen corresponding path program 1 times [2023-12-02 14:08:40,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:40,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484420751] [2023-12-02 14:08:40,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:40,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:40,185 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 14:08:40,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:40,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484420751] [2023-12-02 14:08:40,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484420751] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:08:40,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258050168] [2023-12-02 14:08:40,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:40,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:40,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:40,188 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:08:40,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 14:08:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:40,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:08:40,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:08:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 14:08:40,347 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:08:40,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258050168] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:40,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:08:40,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-12-02 14:08:40,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348823173] [2023-12-02 14:08:40,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:40,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:08:40,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:40,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:08:40,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:08:40,351 INFO L87 Difference]: Start difference. First operand 90 states and 120 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-02 14:08:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:40,389 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2023-12-02 14:08:40,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:08:40,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 54 [2023-12-02 14:08:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:40,392 INFO L225 Difference]: With dead ends: 127 [2023-12-02 14:08:40,392 INFO L226 Difference]: Without dead ends: 90 [2023-12-02 14:08:40,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:08:40,394 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:40,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:08:40,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-02 14:08:40,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-12-02 14:08:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-02 14:08:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 118 transitions. [2023-12-02 14:08:40,405 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 118 transitions. Word has length 54 [2023-12-02 14:08:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:40,406 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 118 transitions. [2023-12-02 14:08:40,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-02 14:08:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 118 transitions. [2023-12-02 14:08:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 14:08:40,407 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:40,407 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:40,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 14:08:40,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-02 14:08:40,608 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 14:08:40,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:40,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1061750769, now seen corresponding path program 1 times [2023-12-02 14:08:40,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:40,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788108257] [2023-12-02 14:08:40,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:40,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:40,683 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 14:08:40,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:40,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788108257] [2023-12-02 14:08:40,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788108257] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:08:40,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442366109] [2023-12-02 14:08:40,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:40,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:40,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:40,685 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:08:40,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 14:08:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:40,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:08:40,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:08:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 14:08:40,839 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:08:40,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442366109] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:40,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:08:40,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-12-02 14:08:40,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476210187] [2023-12-02 14:08:40,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:40,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:08:40,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:40,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:08:40,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:08:40,841 INFO L87 Difference]: Start difference. First operand 90 states and 118 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-02 14:08:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:40,868 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2023-12-02 14:08:40,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:08:40,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2023-12-02 14:08:40,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:40,869 INFO L225 Difference]: With dead ends: 103 [2023-12-02 14:08:40,870 INFO L226 Difference]: Without dead ends: 90 [2023-12-02 14:08:40,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:08:40,871 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:40,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 264 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:08:40,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-02 14:08:40,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-12-02 14:08:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 64 states have internal predecessors, (74), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-02 14:08:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 116 transitions. [2023-12-02 14:08:40,878 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 116 transitions. Word has length 55 [2023-12-02 14:08:40,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:40,879 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 116 transitions. [2023-12-02 14:08:40,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-02 14:08:40,879 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 116 transitions. [2023-12-02 14:08:40,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-02 14:08:40,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:40,880 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:40,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-02 14:08:41,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 14:08:41,081 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 14:08:41,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:41,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1215854525, now seen corresponding path program 1 times [2023-12-02 14:08:41,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:41,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148137951] [2023-12-02 14:08:41,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:41,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:41,145 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-02 14:08:41,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:41,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148137951] [2023-12-02 14:08:41,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148137951] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:41,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:41,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:08:41,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771387822] [2023-12-02 14:08:41,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:41,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:08:41,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:41,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:08:41,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:08:41,148 INFO L87 Difference]: Start difference. First operand 90 states and 116 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-02 14:08:41,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:41,174 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2023-12-02 14:08:41,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:08:41,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2023-12-02 14:08:41,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:41,176 INFO L225 Difference]: With dead ends: 105 [2023-12-02 14:08:41,176 INFO L226 Difference]: Without dead ends: 84 [2023-12-02 14:08:41,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:08:41,177 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:41,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:08:41,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-02 14:08:41,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-12-02 14:08:41,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-02 14:08:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2023-12-02 14:08:41,185 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 60 [2023-12-02 14:08:41,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:41,186 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2023-12-02 14:08:41,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-02 14:08:41,187 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2023-12-02 14:08:41,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 14:08:41,188 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:41,188 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:41,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 14:08:41,188 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-12-02 14:08:41,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:41,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1104405854, now seen corresponding path program 1 times [2023-12-02 14:08:41,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:41,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549648821] [2023-12-02 14:08:41,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:41,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 14:08:41,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:41,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549648821] [2023-12-02 14:08:41,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549648821] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:08:41,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083142312] [2023-12-02 14:08:41,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:41,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:41,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:41,311 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:08:41,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 14:08:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:41,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:08:41,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:08:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 14:08:41,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:08:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 14:08:41,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083142312] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:08:41,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [884112040] [2023-12-02 14:08:41,589 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2023-12-02 14:08:41,590 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:08:41,593 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:08:41,597 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:08:41,598 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:08:46,551 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 24 for LOIs [2023-12-02 14:08:46,555 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 158 for LOIs [2023-12-02 14:08:46,594 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 171 for LOIs [2023-12-02 14:08:46,707 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 99 for LOIs [2023-12-02 14:08:46,740 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:09:19,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [884112040] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:09:19,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:09:19,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 41 [2023-12-02 14:09:19,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120701229] [2023-12-02 14:09:19,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:09:19,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 14:09:19,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:09:19,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 14:09:19,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1539, Unknown=14, NotChecked=0, Total=1722 [2023-12-02 14:09:19,449 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 34 states, 25 states have (on average 1.44) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 14:09:22,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:09:25,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:09:28,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:09:31,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:09:38,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:09:41,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:09:44,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:09:46,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:09:48,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:09:50,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:09:52,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:09:54,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:09:56,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:09:58,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:10:01,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:10:04,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:10:06,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:10:08,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:10:10,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:10:12,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:10:14,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:10:16,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:10:29,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:10:29,091 INFO L93 Difference]: Finished difference Result 152 states and 183 transitions. [2023-12-02 14:10:29,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-02 14:10:29,092 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.44) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 62 [2023-12-02 14:10:29,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:10:29,092 INFO L225 Difference]: With dead ends: 152 [2023-12-02 14:10:29,092 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 14:10:29,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=199, Invalid=1857, Unknown=14, NotChecked=0, Total=2070 [2023-12-02 14:10:29,094 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 52 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 2144 mSolverCounterSat, 21 mSolverCounterUnsat, 33 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2144 IncrementalHoareTripleChecker+Invalid, 33 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:10:29,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 361 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2144 Invalid, 33 Unknown, 0 Unchecked, 67.1s Time] [2023-12-02 14:10:29,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 14:10:29,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 14:10:29,094 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) [2023-12-02 14:10:29,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 14:10:29,095 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2023-12-02 14:10:29,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:10:29,095 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 14:10:29,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.44) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 14:10:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 14:10:29,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 14:10:29,097 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-12-02 14:10:29,097 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-12-02 14:10:29,098 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-12-02 14:10:29,098 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-12-02 14:10:29,098 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-12-02 14:10:29,098 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-12-02 14:10:29,098 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-12-02 14:10:29,098 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-12-02 14:10:29,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 14:10:29,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:10:29,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 14:11:21,728 WARN L293 SmtUtils]: Spent 52.24s on a formula simplification. DAG size of input: 225 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-02 14:12:14,573 WARN L293 SmtUtils]: Spent 52.31s on a formula simplification. DAG size of input: 228 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-02 14:12:19,124 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2023-12-02 14:12:19,124 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2023-12-02 14:12:19,124 INFO L899 garLoopResultBuilder]: For program point staticReturnsFalseEXIT(lines 1552 1555) no Hoare annotation was computed. [2023-12-02 14:12:19,124 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1552 1555) the Hoare annotation is: true [2023-12-02 14:12:19,124 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2023-12-02 14:12:19,124 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2023-12-02 14:12:19,124 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1618) no Hoare annotation was computed. [2023-12-02 14:12:19,124 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2023-12-02 14:12:19,124 INFO L899 garLoopResultBuilder]: For program point L1662-1(line 1662) no Hoare annotation was computed. [2023-12-02 14:12:19,125 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1591) no Hoare annotation was computed. [2023-12-02 14:12:19,125 INFO L899 garLoopResultBuilder]: For program point L1580-1(lines 1556 1593) no Hoare annotation was computed. [2023-12-02 14:12:19,125 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2023-12-02 14:12:19,125 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1584) no Hoare annotation was computed. [2023-12-02 14:12:19,125 INFO L899 garLoopResultBuilder]: For program point L1564(lines 1564 1571) no Hoare annotation was computed. [2023-12-02 14:12:19,125 INFO L899 garLoopResultBuilder]: For program point L1564-2(lines 1564 1571) no Hoare annotation was computed. [2023-12-02 14:12:19,126 INFO L895 garLoopResultBuilder]: At program point L1589(line 1589) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1) 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int)))) (and (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= 16 (select |v_#length_8| 3)) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= |#memory_int| (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store ((as const (Array Int Int)) 0) 0 0))) (= 21 (select |v_#length_8| 9)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 8) 51) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= |#length| (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14)) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0) |#valid|) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= 51 (select |v_#length_8| 5)) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0))) (= |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|) (= ~globalFalse~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 14:12:19,126 INFO L899 garLoopResultBuilder]: For program point L1589-1(line 1589) no Hoare annotation was computed. [2023-12-02 14:12:19,127 INFO L899 garLoopResultBuilder]: For program point L1614(lines 1614 1625) no Hoare annotation was computed. [2023-12-02 14:12:19,127 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1584) no Hoare annotation was computed. [2023-12-02 14:12:19,127 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= |ULTIMATE.start_goodB2G2_~data~1#1| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int)))) (and (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= 16 (select |v_#length_8| 3)) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= |#memory_int| (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store ((as const (Array Int Int)) 0) 0 0))) (= 21 (select |v_#length_8| 9)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 8) 51) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= |#length| (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14)) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0) |#valid|) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= 51 (select |v_#length_8| 5)) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0))) (= |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|) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 14:12:19,128 INFO L899 garLoopResultBuilder]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2023-12-02 14:12:19,128 INFO L899 garLoopResultBuilder]: For program point L1598-2(lines 1598 1611) no Hoare annotation was computed. [2023-12-02 14:12:19,128 INFO L895 garLoopResultBuilder]: At program point L1598-4(lines 1598 1611) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0))) (and (= |v_#memory_$Pointer$.base_6| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= |#memory_int| (let ((.cse0 (store ((as const (Array Int Int)) 0) 0 0))) (store (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| .cse0) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| .cse0))) (= 16 (select |v_#length_8| 3)) (<= .cse1 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= 21 (select |v_#length_8| 9)) (<= .cse1 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 8) 51) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (select .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= 51 (select |v_#length_8| 5)) (= (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0))) |v_#memory_$Pointer$.offset_6|) (= (store .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0) |#valid|) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (store (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 14) |#length|) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0)))) (= |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|) (= ~globalFalse~0 0) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (= ~globalArgc~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648)) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 14:12:19,129 INFO L895 garLoopResultBuilder]: At program point L1623(line 1623) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0))) (and (= |v_#memory_$Pointer$.base_6| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= |#memory_int| (let ((.cse0 (store ((as const (Array Int Int)) 0) 0 0))) (store (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| .cse0) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| .cse0))) (= 16 (select |v_#length_8| 3)) (<= .cse1 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= 21 (select |v_#length_8| 9)) (<= .cse1 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 8) 51) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (select .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= 51 (select |v_#length_8| 5)) (= (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0))) |v_#memory_$Pointer$.offset_6|) (= (store .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0) |#valid|) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (store (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 14) |#length|) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0)))) (= |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|) (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1) 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648)) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 14:12:19,129 INFO L899 garLoopResultBuilder]: For program point L1623-1(line 1623) no Hoare annotation was computed. [2023-12-02 14:12:19,129 INFO L899 garLoopResultBuilder]: For program point L1582(lines 1582 1590) no Hoare annotation was computed. [2023-12-02 14:12:19,129 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 14:12:19,129 INFO L899 garLoopResultBuilder]: For program point L1640(line 1640) no Hoare annotation was computed. [2023-12-02 14:12:19,129 INFO L899 garLoopResultBuilder]: For program point L1640-1(lines 1640 1647) no Hoare annotation was computed. [2023-12-02 14:12:19,130 INFO L899 garLoopResultBuilder]: For program point L1574(line 1574) no Hoare annotation was computed. [2023-12-02 14:12:19,130 INFO L899 garLoopResultBuilder]: For program point L1574-1(lines 1574 1592) no Hoare annotation was computed. [2023-12-02 14:12:19,130 INFO L895 garLoopResultBuilder]: At program point L1632(line 1632) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_goodG2B1_~data~2#1| 0) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0))) (and (= |v_#memory_$Pointer$.base_6| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= |#memory_int| (let ((.cse0 (store ((as const (Array Int Int)) 0) 0 0))) (store (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| .cse0) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| .cse0))) (= 16 (select |v_#length_8| 3)) (<= .cse1 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= 21 (select |v_#length_8| 9)) (<= .cse1 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 8) 51) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (select .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= 51 (select |v_#length_8| 5)) (= (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0))) |v_#memory_$Pointer$.offset_6|) (= (store .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0) |#valid|) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (store (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 14) |#length|) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0)))) (= |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|) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 14:12:19,131 INFO L899 garLoopResultBuilder]: For program point L1632-1(line 1632) no Hoare annotation was computed. [2023-12-02 14:12:19,131 INFO L899 garLoopResultBuilder]: For program point L1632-2(lines 1632 1639) no Hoare annotation was computed. [2023-12-02 14:12:19,131 INFO L895 garLoopResultBuilder]: At program point L1632-4(lines 1632 1639) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0))) (and (= |v_#memory_$Pointer$.base_6| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= |#memory_int| (let ((.cse0 (store ((as const (Array Int Int)) 0) 0 0))) (store (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| .cse0) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| .cse0))) (= 16 (select |v_#length_8| 3)) (<= .cse1 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= 21 (select |v_#length_8| 9)) (<= .cse1 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 8) 51) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (select .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= 51 (select |v_#length_8| 5)) (= (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0))) |v_#memory_$Pointer$.offset_6|) (= (store .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0) |#valid|) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (store (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 14) |#length|) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0)))) (= |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|) (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 14:12:19,132 INFO L899 garLoopResultBuilder]: For program point L1657(line 1657) no Hoare annotation was computed. [2023-12-02 14:12:19,132 INFO L899 garLoopResultBuilder]: For program point L1657-1(lines 1657 1664) no Hoare annotation was computed. [2023-12-02 14:12:19,132 INFO L899 garLoopResultBuilder]: For program point L1649(lines 1649 1665) no Hoare annotation was computed. [2023-12-02 14:12:19,132 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1624) no Hoare annotation was computed. [2023-12-02 14:12:19,132 INFO L895 garLoopResultBuilder]: At program point L1608(line 1608) the Hoare annotation is: (let ((.cse0 (+ |#StackHeapBarrier| 1))) (and (= |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.offset| 0) (= ~GLOBAL_CONST_FALSE~0 0) (<= .cse0 |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) (= |ULTIMATE.start_goodB2G2_~data~1#1| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |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|) (= ~globalFalse~0 0) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int)))) (let ((.cse1 (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0))) (and (= |v_#memory_$Pointer$.base_6| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= 16 (select |v_#length_8| 3)) (<= .cse0 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= 21 (select |v_#length_8| 9)) (= |#valid| (store .cse1 |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base| 1)) (= 16 (select |v_#length_8| 7)) (= (select .cse1 |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 0) (= (select |v_#valid_12| 5) 1) (= (select (select |v_#memory_int_10| 1) 0) 0) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_6| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base| (store (select |v_#memory_$Pointer$.base_6| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 0)))) (= (select |v_#valid_12| 3) 1) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_6| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base| (store (select |v_#memory_$Pointer$.offset_6| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 0)))) (= (select |v_#length_8| 8) 51) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (store (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14) |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base| 14) |#length|) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= 51 (select |v_#length_8| 5)) (= (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0))) |v_#memory_$Pointer$.offset_6|) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= |#memory_int| (let ((.cse2 (store ((as const (Array Int Int)) 0) 0 0))) (store (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| .cse2) |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base| .cse2))) (= (select (select |v_#memory_int_10| 6) 0) 0)))) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1))) [2023-12-02 14:12:19,133 INFO L899 garLoopResultBuilder]: For program point L1608-1(line 1608) no Hoare annotation was computed. [2023-12-02 14:12:19,133 INFO L899 garLoopResultBuilder]: For program point L1584(line 1584) no Hoare annotation was computed. [2023-12-02 14:12:19,133 INFO L899 garLoopResultBuilder]: For program point L1584-1(line 1584) no Hoare annotation was computed. [2023-12-02 14:12:19,133 INFO L899 garLoopResultBuilder]: For program point L1642(lines 1642 1646) no Hoare annotation was computed. [2023-12-02 14:12:19,133 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: false [2023-12-02 14:12:19,133 INFO L899 garLoopResultBuilder]: For program point L1576-1(line 1576) no Hoare annotation was computed. [2023-12-02 14:12:19,133 INFO L895 garLoopResultBuilder]: At program point L1634(line 1634) the Hoare annotation is: false [2023-12-02 14:12:19,133 INFO L899 garLoopResultBuilder]: For program point L1634-1(line 1634) no Hoare annotation was computed. [2023-12-02 14:12:19,133 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1644) no Hoare annotation was computed. [2023-12-02 14:12:19,133 INFO L899 garLoopResultBuilder]: For program point L1659(lines 1659 1663) no Hoare annotation was computed. [2023-12-02 14:12:19,134 INFO L895 garLoopResultBuilder]: At program point L1560(line 1560) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= 51 (select |#length| 8)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |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 (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= 51 (select |#length| 5)) (= (select |#valid| 2) 1) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (= ~globalTrue~0 1)) [2023-12-02 14:12:19,134 INFO L899 garLoopResultBuilder]: For program point L1560-1(line 1560) no Hoare annotation was computed. [2023-12-02 14:12:19,134 INFO L899 garLoopResultBuilder]: For program point L1560-2(lines 1560 1573) no Hoare annotation was computed. [2023-12-02 14:12:19,135 INFO L895 garLoopResultBuilder]: At program point L1560-4(lines 1560 1573) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int)))) (and (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= 16 (select |v_#length_8| 3)) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= |#memory_int| (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store ((as const (Array Int Int)) 0) 0 0))) (= 21 (select |v_#length_8| 9)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 8) 51) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= |#length| (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14)) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0) |#valid|) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= 51 (select |v_#length_8| 5)) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0))) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= |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|) (= ~globalFalse~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 14:12:19,135 INFO L899 garLoopResultBuilder]: For program point L1618(line 1618) no Hoare annotation was computed. [2023-12-02 14:12:19,135 INFO L895 garLoopResultBuilder]: At program point L1585(line 1585) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (<= 0 (+ 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|)) (= ~globalArgv~0.offset 0) (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1) 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int)))) (and (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= 16 (select |v_#length_8| 3)) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= |#memory_int| (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store ((as const (Array Int Int)) 0) 0 0))) (= 21 (select |v_#length_8| 9)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 8) 51) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= |#length| (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14)) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0) |#valid|) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= 51 (select |v_#length_8| 5)) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0))) (= |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|) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 14:12:19,135 INFO L899 garLoopResultBuilder]: For program point L1618-1(line 1618) no Hoare annotation was computed. [2023-12-02 14:12:19,135 INFO L899 garLoopResultBuilder]: For program point L1585-1(line 1585) no Hoare annotation was computed. [2023-12-02 14:12:19,136 INFO L895 garLoopResultBuilder]: At program point L1676(line 1676) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= 51 (select |#length| 8)) (= (select |#valid| 11) 1) (= |ULTIMATE.start_main_#t~nondet117#1.offset| 0) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= |ULTIMATE.start_main_#t~nondet117#1.base| 10) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |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 (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= 51 (select |#length| 5)) (= (select |#valid| 2) 1) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (= ~globalTrue~0 1)) [2023-12-02 14:12:19,136 INFO L899 garLoopResultBuilder]: For program point L1676-1(line 1676) no Hoare annotation was computed. [2023-12-02 14:12:19,136 INFO L899 garLoopResultBuilder]: For program point L1602(lines 1602 1609) no Hoare annotation was computed. [2023-12-02 14:12:19,136 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 14:12:19,136 INFO L899 garLoopResultBuilder]: For program point L1602-2(lines 1602 1609) no Hoare annotation was computed. [2023-12-02 14:12:19,136 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1644) no Hoare annotation was computed. [2023-12-02 14:12:19,136 INFO L899 garLoopResultBuilder]: For program point L1594(lines 1594 1627) no Hoare annotation was computed. [2023-12-02 14:12:19,137 INFO L895 garLoopResultBuilder]: At program point L1619(line 1619) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1073741823)) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0))) (and (= |v_#memory_$Pointer$.base_6| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= |#memory_int| (let ((.cse0 (store ((as const (Array Int Int)) 0) 0 0))) (store (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| .cse0) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| .cse0))) (= 16 (select |v_#length_8| 3)) (<= .cse1 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= 21 (select |v_#length_8| 9)) (<= .cse1 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 8) 51) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (select .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= 51 (select |v_#length_8| 5)) (= (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0))) |v_#memory_$Pointer$.offset_6|) (= (store .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0) |#valid|) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (store (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 14) |#length|) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0)))) (= |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|) (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1) 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 14:12:19,137 INFO L899 garLoopResultBuilder]: For program point L1619-1(line 1619) no Hoare annotation was computed. [2023-12-02 14:12:19,137 INFO L899 garLoopResultBuilder]: For program point L1644(line 1644) no Hoare annotation was computed. [2023-12-02 14:12:19,137 INFO L899 garLoopResultBuilder]: For program point L1644-1(line 1644) no Hoare annotation was computed. [2023-12-02 14:12:19,137 INFO L895 garLoopResultBuilder]: At program point L1570(line 1570) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (exists ((|v_#length_8| (Array Int Int))) (and (= (select |v_#length_8| 6) 1) (= 16 (select |v_#length_8| 3)) (= 21 (select |v_#length_8| 9)) (= 16 (select |v_#length_8| 7)) (= (select |v_#length_8| 8) 51) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (select |v_#length_8| 1) 1) (= |#length| (store |v_#length_8| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base| 14)) (= 51 (select |v_#length_8| 5)) (= (select |v_#length_8| 11) 16))) (exists ((|v_#memory_int_10| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select (select |v_#memory_int_10| 2) 0) 0) (= |#memory_int| (store |v_#memory_int_10| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base| (store ((as const (Array Int Int)) 0) 0 0))) (= (select (select |v_#memory_int_10| 6) 0) 0))) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= |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|) (= |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (exists ((|v_#valid_12| (Array Int Int))) (and (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#valid_12| 10) 1) (= (select |v_#valid_12| 5) 1) (= (select |v_#valid_12| 3) 1) (= (select |v_#valid_12| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 0) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= (store |v_#valid_12| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base| 1) |#valid|) (= (select |v_#valid_12| 11) 1) (= (select |v_#valid_12| 6) 1))) (= ~globalTrue~0 1)) [2023-12-02 14:12:19,137 INFO L899 garLoopResultBuilder]: For program point L1570-1(line 1570) no Hoare annotation was computed. [2023-12-02 14:12:19,138 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1618) no Hoare annotation was computed. [2023-12-02 14:12:19,138 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2023-12-02 14:12:19,138 INFO L899 garLoopResultBuilder]: For program point L1628(lines 1628 1648) no Hoare annotation was computed. [2023-12-02 14:12:19,138 INFO L899 garLoopResultBuilder]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2023-12-02 14:12:19,138 INFO L895 garLoopResultBuilder]: At program point L1653(line 1653) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0))) (and (= |v_#memory_$Pointer$.base_6| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= |#memory_int| (let ((.cse0 (store ((as const (Array Int Int)) 0) 0 0))) (store (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| .cse0) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| .cse0))) (= 16 (select |v_#length_8| 3)) (<= .cse1 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= 21 (select |v_#length_8| 9)) (<= .cse1 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 8) 51) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (select .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= 51 (select |v_#length_8| 5)) (= (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0))) |v_#memory_$Pointer$.offset_6|) (= (store .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0) |#valid|) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (store (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 14) |#length|) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0)))) (= |ULTIMATE.start_goodG2B2_~data~3#1| 0) (= |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|) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 14:12:19,139 INFO L899 garLoopResultBuilder]: For program point L1653-1(line 1653) no Hoare annotation was computed. [2023-12-02 14:12:19,139 INFO L895 garLoopResultBuilder]: At program point L1653-4(lines 1653 1656) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2) 0) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0))) (and (= |v_#memory_$Pointer$.base_6| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= |#memory_int| (let ((.cse0 (store ((as const (Array Int Int)) 0) 0 0))) (store (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| .cse0) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| .cse0))) (= 16 (select |v_#length_8| 3)) (<= .cse1 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= 21 (select |v_#length_8| 9)) (<= .cse1 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 8) 51) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (select .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= 51 (select |v_#length_8| 5)) (= (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0))) |v_#memory_$Pointer$.offset_6|) (= (store .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0) |#valid|) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (store (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 14) |#length|) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0)))) (= |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|) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= ~globalTrue~0 1)) [2023-12-02 14:12:19,139 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2023-12-02 14:12:19,140 INFO L895 garLoopResultBuilder]: At program point L1645(line 1645) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (exists ((|v_#valid_12| (Array Int Int)) (|v_#memory_int_10| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int) (|v_#length_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_5| (Array Int (Array Int Int))) (|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (store |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0))) (and (= |v_#memory_$Pointer$.base_6| (store |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0)))) (= (select |v_#valid_12| 8) 1) (= (select |v_#valid_12| 1) 1) (= (select |v_#valid_12| 2) 1) (= (select |v_#length_8| 6) 1) (= (select |v_#valid_12| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (= |#memory_int| (let ((.cse0 (store ((as const (Array Int Int)) 0) 0 0))) (store (store |v_#memory_int_10| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| .cse0) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| .cse0))) (= 16 (select |v_#length_8| 3)) (<= .cse1 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (= (select |v_#valid_12| 10) 1) (= 21 (select |v_#length_8| 9)) (<= .cse1 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= 16 (select |v_#length_8| 7)) (= (select |v_#valid_12| 5) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| (store (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0)))) (= (select (select |v_#memory_int_10| 1) 0) 0) (= (select |v_#valid_12| 3) 1) (= (select |v_#length_8| 8) 51) (= (select |v_#length_8| 2) 1) (= (select |v_#length_8| 10) 18) (= (select |v_#length_8| 4) 21) (= (select .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (= (select |v_#length_8| 1) 1) (= (select |v_#valid_12| 7) 1) (= (select |v_#valid_12| 0) 0) (= (select |v_#valid_12| 4) 1) (= (select |v_#valid_12| 9) 1) (= 51 (select |v_#length_8| 5)) (= (store |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| (store (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0 (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0))) |v_#memory_$Pointer$.offset_6|) (= (store .cse2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0) |#valid|) (= (select (select |v_#memory_int_10| 2) 0) 0) (= (select |v_#valid_12| 11) 1) (= (store (store |v_#length_8| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 14) |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 14) |#length|) (= (select |v_#valid_12| 6) 1) (= (select |v_#length_8| 11) 16) (= (select (select |v_#memory_int_10| 6) 0) 0)))) (= |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|) (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (= (+ |ULTIMATE.start_goodG2B1_~result~2#1| 4) 0) (= ~globalTrue~0 1)) [2023-12-02 14:12:19,140 INFO L899 garLoopResultBuilder]: For program point L1678-1(line 1678) no Hoare annotation was computed. [2023-12-02 14:12:19,140 INFO L899 garLoopResultBuilder]: For program point L1612(line 1612) no Hoare annotation was computed. [2023-12-02 14:12:19,140 INFO L899 garLoopResultBuilder]: For program point L1645-1(line 1645) no Hoare annotation was computed. [2023-12-02 14:12:19,140 INFO L899 garLoopResultBuilder]: For program point L1612-1(lines 1612 1626) no Hoare annotation was computed. [2023-12-02 14:12:19,141 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2023-12-02 14:12:19,141 INFO L899 garLoopResultBuilder]: For program point staticReturnsTrueEXIT(lines 1548 1551) no Hoare annotation was computed. [2023-12-02 14:12:19,141 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1548 1551) the Hoare annotation is: true [2023-12-02 14:12:19,143 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:12:19,145 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 14:12:19,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:12:19 BoogieIcfgContainer [2023-12-02 14:12:19,150 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 14:12:19,150 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 14:12:19,150 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 14:12:19,150 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 14:12:19,151 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:08:36" (3/4) ... [2023-12-02 14:12:19,152 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 14:12:19,155 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2023-12-02 14:12:19,155 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2023-12-02 14:12:19,155 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2023-12-02 14:12:19,155 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2023-12-02 14:12:19,160 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2023-12-02 14:12:19,161 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-12-02 14:12:19,161 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-12-02 14:12:19,162 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 14:12:19,162 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 14:12:19,251 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 14:12:19,251 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 14:12:19,252 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 14:12:19,252 INFO L158 Benchmark]: Toolchain (without parser) took 224606.77ms. Allocated memory was 142.6MB in the beginning and 532.7MB in the end (delta: 390.1MB). Free memory was 101.9MB in the beginning and 419.7MB in the end (delta: -317.8MB). Peak memory consumption was 73.9MB. Max. memory is 16.1GB. [2023-12-02 14:12:19,252 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 100.7MB. Free memory is still 52.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 14:12:19,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1299.63ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 91.5MB in the end (delta: 10.4MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. [2023-12-02 14:12:19,253 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.76ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 87.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 14:12:19,253 INFO L158 Benchmark]: Boogie Preprocessor took 32.52ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 85.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 14:12:19,253 INFO L158 Benchmark]: RCFGBuilder took 494.20ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 63.4MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-12-02 14:12:19,254 INFO L158 Benchmark]: TraceAbstraction took 222606.33ms. Allocated memory was 142.6MB in the beginning and 532.7MB in the end (delta: 390.1MB). Free memory was 63.4MB in the beginning and 426.0MB in the end (delta: -362.6MB). Peak memory consumption was 277.0MB. Max. memory is 16.1GB. [2023-12-02 14:12:19,254 INFO L158 Benchmark]: Witness Printer took 101.57ms. Allocated memory is still 532.7MB. Free memory was 426.0MB in the beginning and 419.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-02 14:12:19,256 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 100.7MB. Free memory is still 52.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1299.63ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 91.5MB in the end (delta: 10.4MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.76ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 87.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.52ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 85.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 494.20ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 63.4MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 222606.33ms. Allocated memory was 142.6MB in the beginning and 532.7MB in the end (delta: 390.1MB). Free memory was 63.4MB in the beginning and 426.0MB in the end (delta: -362.6MB). Peak memory consumption was 277.0MB. Max. memory is 16.1GB. * Witness Printer took 101.57ms. Allocated memory is still 532.7MB. Free memory was 426.0MB in the beginning and 419.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1584]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1584]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1644]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1644]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: 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 5 procedures, 87 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 222.5s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 70.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 109.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 33 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 67.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 3153 SdHoareTripleChecker+Invalid, 66.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1887 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2435 IncrementalHoareTripleChecker+Invalid, 2498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 1266 mSDtfsCounter, 2435 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 555 GetRequests, 478 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 35.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=8, InterpolantAutomatonStates: 82, 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, 14 MinimizatonAttempts, 11 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 116 PreInvPairs, 133 NumberOfFragments, 4352 HoareAnnotationTreeSize, 116 FomulaSimplifications, 93 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 24 FomulaSimplificationsInter, 5946 FormulaSimplificationTreeSizeReductionInter, 109.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 962 NumberOfCodeBlocks, 962 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1001 ConstructedInterpolants, 0 QuantifiedInterpolants, 1254 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1836 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 415/434 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.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 5, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 56, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 40, TOOLS_POST_TIME: 1.7s, TOOLS_POST_CALL_APPLICATIONS: 30, TOOLS_POST_CALL_TIME: 1.3s, TOOLS_POST_RETURN_APPLICATIONS: 20, TOOLS_POST_RETURN_TIME: 1.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 90, TOOLS_QUANTIFIERELIM_TIME: 4.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 134, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 26, DOMAIN_JOIN_TIME: 0.7s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 56, DOMAIN_ISBOTTOM_TIME: 0.3s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, 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.0s, DAG_COMPRESSION_PROCESSED_NODES: 1732, DAG_COMPRESSION_RETAINED_NODES: 137, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-02 14:12:19,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abc34833-965f-4856-85d4-4f8114c9a1fb/bin/utaipan-verify-nQ1chXbOIh/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