./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7769e2cb1241ce193327f3081ef594a62cf8a609eb0db6e89ed527de779b57ea --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 20:12:35,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 20:12:35,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 20:12:35,556 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 20:12:35,556 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 20:12:35,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 20:12:35,559 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 20:12:35,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 20:12:35,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 20:12:35,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 20:12:35,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 20:12:35,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 20:12:35,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 20:12:35,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 20:12:35,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 20:12:35,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 20:12:35,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 20:12:35,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 20:12:35,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 20:12:35,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 20:12:35,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 20:12:35,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 20:12:35,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 20:12:35,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 20:12:35,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 20:12:35,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 20:12:35,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 20:12:35,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 20:12:35,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 20:12:35,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 20:12:35,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 20:12:35,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 20:12:35,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 20:12:35,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 20:12:35,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 20:12:35,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 20:12:35,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 20:12:35,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 20:12:35,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 20:12:35,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 20:12:35,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 20:12:35,619 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-16 20:12:35,643 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 20:12:35,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 20:12:35,644 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 20:12:35,645 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 20:12:35,645 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 20:12:35,646 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 20:12:35,646 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 20:12:35,646 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 20:12:35,646 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 20:12:35,647 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 20:12:35,648 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 20:12:35,648 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 20:12:35,648 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 20:12:35,648 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 20:12:35,648 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 20:12:35,649 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 20:12:35,649 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 20:12:35,649 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 20:12:35,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 20:12:35,650 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 20:12:35,650 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 20:12:35,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 20:12:35,651 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 20:12:35,652 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 20:12:35,652 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 20:12:35,653 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-16 20:12:35,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 20:12:35,653 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 20:12:35,653 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 20:12:35,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 20:12:35,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 20:12:35,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:12:35,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 20:12:35,656 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 20:12:35,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 20:12:35,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 20:12:35,656 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 20:12:35,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 20:12:35,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 20:12:35,657 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 20:12:35,657 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/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_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7769e2cb1241ce193327f3081ef594a62cf8a609eb0db6e89ed527de779b57ea [2022-11-16 20:12:35,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 20:12:35,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 20:12:35,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 20:12:35,956 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 20:12:35,957 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 20:12:35,958 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_good.i [2022-11-16 20:12:36,020 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/data/58dac9521/e6fb4ac892394919a8431b3a954998e9/FLAG3da2b55f4 [2022-11-16 20:12:36,692 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 20:12:36,692 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_good.i [2022-11-16 20:12:36,720 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/data/58dac9521/e6fb4ac892394919a8431b3a954998e9/FLAG3da2b55f4 [2022-11-16 20:12:36,872 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/data/58dac9521/e6fb4ac892394919a8431b3a954998e9 [2022-11-16 20:12:36,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 20:12:36,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 20:12:36,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 20:12:36,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 20:12:36,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 20:12:36,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:12:36" (1/1) ... [2022-11-16 20:12:36,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7accff6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:36, skipping insertion in model container [2022-11-16 20:12:36,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:12:36" (1/1) ... [2022-11-16 20:12:36,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 20:12:36,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 20:12:37,517 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-16 20:12:38,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:12:38,448 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 20:12:38,478 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-16 20:12:38,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:12:38,667 INFO L208 MainTranslator]: Completed translation [2022-11-16 20:12:38,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:38 WrapperNode [2022-11-16 20:12:38,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 20:12:38,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 20:12:38,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 20:12:38,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 20:12:38,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:38" (1/1) ... [2022-11-16 20:12:38,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:38" (1/1) ... [2022-11-16 20:12:38,752 INFO L138 Inliner]: procedures = 501, calls = 141, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 196 [2022-11-16 20:12:38,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 20:12:38,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 20:12:38,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 20:12:38,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 20:12:38,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:38" (1/1) ... [2022-11-16 20:12:38,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:38" (1/1) ... [2022-11-16 20:12:38,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:38" (1/1) ... [2022-11-16 20:12:38,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:38" (1/1) ... [2022-11-16 20:12:38,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:38" (1/1) ... [2022-11-16 20:12:38,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:38" (1/1) ... [2022-11-16 20:12:38,781 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:38" (1/1) ... [2022-11-16 20:12:38,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:38" (1/1) ... [2022-11-16 20:12:38,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 20:12:38,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 20:12:38,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 20:12:38,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 20:12:38,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:38" (1/1) ... [2022-11-16 20:12:38,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:12:38,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:12:38,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 20:12:38,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 20:12:38,902 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-16 20:12:38,902 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-16 20:12:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-16 20:12:38,903 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-16 20:12:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 20:12:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 20:12:38,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 20:12:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-16 20:12:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 20:12:39,082 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 20:12:39,084 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 20:12:39,432 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 20:12:39,580 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 20:12:39,583 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 20:12:39,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:12:39 BoogieIcfgContainer [2022-11-16 20:12:39,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 20:12:39,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 20:12:39,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 20:12:39,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 20:12:39,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:12:36" (1/3) ... [2022-11-16 20:12:39,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d466cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:12:39, skipping insertion in model container [2022-11-16 20:12:39,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:38" (2/3) ... [2022-11-16 20:12:39,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d466cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:12:39, skipping insertion in model container [2022-11-16 20:12:39,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:12:39" (3/3) ... [2022-11-16 20:12:39,598 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_predec_17_good.i [2022-11-16 20:12:39,618 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 20:12:39,618 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-16 20:12:39,686 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 20:12:39,692 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24d0ebc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 20:12:39,692 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-11-16 20:12:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 37 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 20:12:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 20:12:39,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:12:39,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:12:39,706 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-16 20:12:39,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:12:39,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1231915530, now seen corresponding path program 1 times [2022-11-16 20:12:39,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:12:39,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420203069] [2022-11-16 20:12:39,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:12:39,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:12:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:12:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:12:40,220 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:12:40,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420203069] [2022-11-16 20:12:40,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420203069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:12:40,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:12:40,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:12:40,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799847375] [2022-11-16 20:12:40,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:12:40,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:12:40,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:12:40,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:12:40,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:12:40,273 INFO L87 Difference]: Start difference. First operand has 44 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 37 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 20:12:40,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:12:40,363 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2022-11-16 20:12:40,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:12:40,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2022-11-16 20:12:40,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:12:40,374 INFO L225 Difference]: With dead ends: 85 [2022-11-16 20:12:40,375 INFO L226 Difference]: Without dead ends: 44 [2022-11-16 20:12:40,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:12:40,382 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:12:40,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 114 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:12:40,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-16 20:12:40,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-16 20:12:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 38 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 20:12:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-11-16 20:12:40,434 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 7 [2022-11-16 20:12:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:12:40,437 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-11-16 20:12:40,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 20:12:40,439 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-11-16 20:12:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 20:12:40,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:12:40,442 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:12:40,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 20:12:40,443 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-16 20:12:40,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:12:40,444 INFO L85 PathProgramCache]: Analyzing trace with hash -499922354, now seen corresponding path program 1 times [2022-11-16 20:12:40,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:12:40,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911841375] [2022-11-16 20:12:40,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:12:40,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:12:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:12:40,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:12:40,793 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:12:40,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911841375] [2022-11-16 20:12:40,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911841375] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:12:40,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485455026] [2022-11-16 20:12:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:12:40,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:12:40,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:12:40,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:12:40,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 20:12:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:12:40,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 20:12:40,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:12:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:12:41,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:12:41,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485455026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:12:41,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 20:12:41,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-16 20:12:41,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402326205] [2022-11-16 20:12:41,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:12:41,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:12:41,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:12:41,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:12:41,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 20:12:41,031 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 20:12:41,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:12:41,080 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2022-11-16 20:12:41,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:12:41,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-16 20:12:41,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:12:41,082 INFO L225 Difference]: With dead ends: 78 [2022-11-16 20:12:41,082 INFO L226 Difference]: Without dead ends: 40 [2022-11-16 20:12:41,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 20:12:41,083 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 32 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:12:41,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 79 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:12:41,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-16 20:12:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-16 20:12:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 34 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 20:12:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-11-16 20:12:41,091 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 10 [2022-11-16 20:12:41,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:12:41,091 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-11-16 20:12:41,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 20:12:41,092 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-11-16 20:12:41,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 20:12:41,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:12:41,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:12:41,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 20:12:41,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:12:41,299 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-16 20:12:41,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:12:41,301 INFO L85 PathProgramCache]: Analyzing trace with hash 611278119, now seen corresponding path program 1 times [2022-11-16 20:12:41,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:12:41,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293871444] [2022-11-16 20:12:41,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:12:41,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:12:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:12:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:12:41,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:12:41,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293871444] [2022-11-16 20:12:41,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293871444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:12:41,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:12:41,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:12:41,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652120225] [2022-11-16 20:12:41,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:12:41,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:12:41,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:12:41,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:12:41,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:12:41,431 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 20:12:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:12:41,486 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2022-11-16 20:12:41,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:12:41,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-16 20:12:41,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:12:41,492 INFO L225 Difference]: With dead ends: 71 [2022-11-16 20:12:41,493 INFO L226 Difference]: Without dead ends: 53 [2022-11-16 20:12:41,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:12:41,498 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:12:41,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 70 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:12:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-16 20:12:41,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2022-11-16 20:12:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.52) internal successors, (38), 35 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 20:12:41,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-11-16 20:12:41,513 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 12 [2022-11-16 20:12:41,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:12:41,513 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-11-16 20:12:41,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 20:12:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-11-16 20:12:41,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 20:12:41,514 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:12:41,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:12:41,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 20:12:41,516 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-16 20:12:41,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:12:41,517 INFO L85 PathProgramCache]: Analyzing trace with hash 611179511, now seen corresponding path program 1 times [2022-11-16 20:12:41,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:12:41,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130469130] [2022-11-16 20:12:41,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:12:41,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:12:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:12:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:12:41,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:12:41,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130469130] [2022-11-16 20:12:41,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130469130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:12:41,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:12:41,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:12:41,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013565117] [2022-11-16 20:12:41,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:12:41,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:12:41,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:12:41,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:12:41,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:12:41,675 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 20:12:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:12:41,719 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-11-16 20:12:41,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:12:41,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-16 20:12:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:12:41,721 INFO L225 Difference]: With dead ends: 41 [2022-11-16 20:12:41,721 INFO L226 Difference]: Without dead ends: 40 [2022-11-16 20:12:41,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:12:41,730 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:12:41,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 36 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:12:41,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-16 20:12:41,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-16 20:12:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 34 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 20:12:41,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-11-16 20:12:41,759 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 12 [2022-11-16 20:12:41,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:12:41,760 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-11-16 20:12:41,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 20:12:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-11-16 20:12:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 20:12:41,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:12:41,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:12:41,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 20:12:41,762 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-16 20:12:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:12:41,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1766695741, now seen corresponding path program 1 times [2022-11-16 20:12:41,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:12:41,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426437630] [2022-11-16 20:12:41,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:12:41,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:12:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:12:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:12:41,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:12:41,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426437630] [2022-11-16 20:12:41,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426437630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:12:41,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:12:41,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:12:41,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358121491] [2022-11-16 20:12:41,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:12:41,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:12:41,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:12:41,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:12:41,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:12:41,823 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 20:12:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:12:41,858 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-11-16 20:12:41,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:12:41,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-16 20:12:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:12:41,866 INFO L225 Difference]: With dead ends: 40 [2022-11-16 20:12:41,866 INFO L226 Difference]: Without dead ends: 39 [2022-11-16 20:12:41,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:12:41,868 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:12:41,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:12:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-16 20:12:41,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-16 20:12:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.44) internal successors, (36), 33 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 20:12:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-11-16 20:12:41,882 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 13 [2022-11-16 20:12:41,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:12:41,883 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-11-16 20:12:41,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 20:12:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-11-16 20:12:41,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 20:12:41,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:12:41,884 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:12:41,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 20:12:41,884 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-16 20:12:41,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:12:41,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1370502306, now seen corresponding path program 1 times [2022-11-16 20:12:41,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:12:41,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346737580] [2022-11-16 20:12:41,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:12:41,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:12:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:12:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:12:41,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:12:41,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346737580] [2022-11-16 20:12:41,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346737580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:12:41,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:12:41,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:12:41,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605143714] [2022-11-16 20:12:41,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:12:41,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:12:41,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:12:41,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:12:41,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:12:41,981 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 20:12:42,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:12:42,042 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-11-16 20:12:42,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:12:42,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-11-16 20:12:42,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:12:42,045 INFO L225 Difference]: With dead ends: 49 [2022-11-16 20:12:42,046 INFO L226 Difference]: Without dead ends: 47 [2022-11-16 20:12:42,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:12:42,047 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:12:42,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 94 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:12:42,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-16 20:12:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-16 20:12:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 40 states have internal predecessors, (43), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 20:12:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-11-16 20:12:42,066 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 16 [2022-11-16 20:12:42,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:12:42,067 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-11-16 20:12:42,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 20:12:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-11-16 20:12:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 20:12:42,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:12:42,070 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:12:42,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 20:12:42,070 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-16 20:12:42,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:12:42,071 INFO L85 PathProgramCache]: Analyzing trace with hash -544310589, now seen corresponding path program 1 times [2022-11-16 20:12:42,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:12:42,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539307119] [2022-11-16 20:12:42,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:12:42,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:12:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:12:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:12:42,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:12:42,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539307119] [2022-11-16 20:12:42,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539307119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:12:42,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:12:42,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:12:42,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627780391] [2022-11-16 20:12:42,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:12:42,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:12:42,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:12:42,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:12:42,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:12:42,181 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 20:12:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:12:42,237 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-11-16 20:12:42,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:12:42,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-11-16 20:12:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:12:42,239 INFO L225 Difference]: With dead ends: 65 [2022-11-16 20:12:42,239 INFO L226 Difference]: Without dead ends: 50 [2022-11-16 20:12:42,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:12:42,241 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:12:42,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 98 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:12:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-16 20:12:42,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-16 20:12:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 43 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 20:12:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-11-16 20:12:42,261 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 20 [2022-11-16 20:12:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:12:42,262 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-11-16 20:12:42,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 20:12:42,262 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-11-16 20:12:42,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 20:12:42,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:12:42,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:12:42,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 20:12:42,264 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-16 20:12:42,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:12:42,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2055101797, now seen corresponding path program 1 times [2022-11-16 20:12:42,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:12:42,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473065648] [2022-11-16 20:12:42,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:12:42,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:12:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:12:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:12:42,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:12:42,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473065648] [2022-11-16 20:12:42,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473065648] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:12:42,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372996404] [2022-11-16 20:12:42,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:12:42,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:12:42,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:12:42,416 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:12:42,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 20:12:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:12:42,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 20:12:42,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:12:42,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:12:42,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:12:42,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372996404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:12:42,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 20:12:42,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-16 20:12:42,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76332974] [2022-11-16 20:12:42,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:12:42,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:12:42,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:12:42,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:12:42,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 20:12:42,611 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 20:12:42,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:12:42,658 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-11-16 20:12:42,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:12:42,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-11-16 20:12:42,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:12:42,660 INFO L225 Difference]: With dead ends: 64 [2022-11-16 20:12:42,660 INFO L226 Difference]: Without dead ends: 46 [2022-11-16 20:12:42,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 20:12:42,661 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:12:42,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 102 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:12:42,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-16 20:12:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-16 20:12:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.28125) internal successors, (41), 39 states have internal predecessors, (41), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 20:12:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-11-16 20:12:42,668 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 23 [2022-11-16 20:12:42,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:12:42,669 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-11-16 20:12:42,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 20:12:42,669 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-11-16 20:12:42,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 20:12:42,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:12:42,670 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:12:42,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 20:12:42,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-16 20:12:42,875 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-16 20:12:42,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:12:42,876 INFO L85 PathProgramCache]: Analyzing trace with hash 110044222, now seen corresponding path program 1 times [2022-11-16 20:12:42,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:12:42,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356477712] [2022-11-16 20:12:42,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:12:42,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:12:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:12:42,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 20:12:42,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:12:42,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356477712] [2022-11-16 20:12:42,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356477712] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:12:42,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433574894] [2022-11-16 20:12:42,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:12:42,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:12:42,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:12:42,997 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:12:43,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 20:12:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:12:43,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 20:12:43,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:12:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:12:43,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:12:43,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433574894] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:12:43,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 20:12:43,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-16 20:12:43,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081567951] [2022-11-16 20:12:43,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:12:43,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:12:43,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:12:43,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:12:43,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 20:12:43,185 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 20:12:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:12:43,244 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-11-16 20:12:43,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:12:43,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2022-11-16 20:12:43,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:12:43,246 INFO L225 Difference]: With dead ends: 66 [2022-11-16 20:12:43,246 INFO L226 Difference]: Without dead ends: 36 [2022-11-16 20:12:43,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 20:12:43,249 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 35 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:12:43,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 64 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:12:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-16 20:12:43,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-11-16 20:12:43,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 30 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 20:12:43,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-11-16 20:12:43,264 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 24 [2022-11-16 20:12:43,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:12:43,266 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-11-16 20:12:43,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 20:12:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-11-16 20:12:43,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 20:12:43,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:12:43,270 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:12:43,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 20:12:43,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-16 20:12:43,483 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-16 20:12:43,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:12:43,483 INFO L85 PathProgramCache]: Analyzing trace with hash 716359098, now seen corresponding path program 1 times [2022-11-16 20:12:43,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:12:43,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538852567] [2022-11-16 20:12:43,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:12:43,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:12:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:12:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:12:43,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:12:43,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538852567] [2022-11-16 20:12:43,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538852567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:12:43,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:12:43,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:12:43,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534636451] [2022-11-16 20:12:43,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:12:43,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:12:43,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:12:43,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:12:43,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:12:43,549 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 20:12:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:12:43,581 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-11-16 20:12:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:12:43,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-16 20:12:43,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:12:43,584 INFO L225 Difference]: With dead ends: 36 [2022-11-16 20:12:43,585 INFO L226 Difference]: Without dead ends: 35 [2022-11-16 20:12:43,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:12:43,586 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:12:43,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:12:43,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-16 20:12:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-16 20:12:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 20:12:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-11-16 20:12:43,593 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 24 [2022-11-16 20:12:43,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:12:43,593 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-11-16 20:12:43,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 20:12:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-11-16 20:12:43,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 20:12:43,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:12:43,599 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:12:43,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 20:12:43,599 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-16 20:12:43,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:12:43,600 INFO L85 PathProgramCache]: Analyzing trace with hash 732295686, now seen corresponding path program 1 times [2022-11-16 20:12:43,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:12:43,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384087277] [2022-11-16 20:12:43,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:12:43,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:12:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:12:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:12:43,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:12:43,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384087277] [2022-11-16 20:12:43,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384087277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:12:43,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:12:43,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:12:43,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945945480] [2022-11-16 20:12:43,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:12:43,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:12:43,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:12:43,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:12:43,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:12:43,708 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 20:12:43,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:12:43,746 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-11-16 20:12:43,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:12:43,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-11-16 20:12:43,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:12:43,748 INFO L225 Difference]: With dead ends: 39 [2022-11-16 20:12:43,748 INFO L226 Difference]: Without dead ends: 38 [2022-11-16 20:12:43,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:12:43,749 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:12:43,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:12:43,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-16 20:12:43,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-16 20:12:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 20:12:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-11-16 20:12:43,755 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 25 [2022-11-16 20:12:43,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:12:43,757 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-11-16 20:12:43,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 20:12:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-11-16 20:12:43,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 20:12:43,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:12:43,760 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:12:43,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 20:12:43,761 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-16 20:12:43,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:12:43,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1530142354, now seen corresponding path program 1 times [2022-11-16 20:12:43,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:12:43,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683902109] [2022-11-16 20:12:43,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:12:43,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:12:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:12:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 20:12:43,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:12:43,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683902109] [2022-11-16 20:12:43,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683902109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:12:43,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:12:43,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:12:43,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717077981] [2022-11-16 20:12:43,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:12:43,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:12:43,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:12:43,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:12:43,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:12:43,885 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 20:12:43,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:12:43,931 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-11-16 20:12:43,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:12:43,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-11-16 20:12:43,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:12:43,933 INFO L225 Difference]: With dead ends: 44 [2022-11-16 20:12:43,933 INFO L226 Difference]: Without dead ends: 42 [2022-11-16 20:12:43,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:12:43,935 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:12:43,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 79 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:12:43,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-16 20:12:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-16 20:12:43,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 20:12:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-11-16 20:12:43,941 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 30 [2022-11-16 20:12:43,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:12:43,943 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-11-16 20:12:43,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 20:12:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-11-16 20:12:43,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 20:12:43,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:12:43,944 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:12:43,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 20:12:43,945 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-16 20:12:43,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:12:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1346225385, now seen corresponding path program 1 times [2022-11-16 20:12:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:12:43,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841878643] [2022-11-16 20:12:43,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:12:43,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:12:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:12:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 20:12:44,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:12:44,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841878643] [2022-11-16 20:12:44,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841878643] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:12:44,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808846181] [2022-11-16 20:12:44,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:12:44,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:12:44,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:12:44,064 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:12:44,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 20:12:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:12:44,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 20:12:44,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:12:44,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:12:44,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:12:44,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:12:44,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808846181] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:12:44,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [26039390] [2022-11-16 20:12:44,327 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-16 20:12:44,328 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:12:44,331 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 20:12:44,337 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 20:12:44,337 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 20:12:47,394 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 32 for LOIs [2022-11-16 20:12:47,397 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 330 for LOIs [2022-11-16 20:12:47,624 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 20:12:57,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [26039390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:12:57,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:12:57,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [5, 3, 3] total 26 [2022-11-16 20:12:57,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613994133] [2022-11-16 20:12:57,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:12:57,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 20:12:57,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:12:57,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 20:12:57,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2022-11-16 20:12:57,489 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 19 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 20:13:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:13:00,117 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2022-11-16 20:13:00,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 20:13:00,117 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2022-11-16 20:13:00,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:13:00,118 INFO L225 Difference]: With dead ends: 69 [2022-11-16 20:13:00,118 INFO L226 Difference]: Without dead ends: 41 [2022-11-16 20:13:00,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2022-11-16 20:13:00,120 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 55 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 20:13:00,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 113 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 291 Invalid, 0 Unknown, 5 Unchecked, 0.6s Time] [2022-11-16 20:13:00,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-16 20:13:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-16 20:13:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 20:13:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-11-16 20:13:00,142 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 34 [2022-11-16 20:13:00,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:13:00,142 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-11-16 20:13:00,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 20:13:00,143 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-11-16 20:13:00,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 20:13:00,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:13:00,143 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:13:00,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 20:13:00,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:13:00,349 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-16 20:13:00,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:13:00,349 INFO L85 PathProgramCache]: Analyzing trace with hash 736934810, now seen corresponding path program 1 times [2022-11-16 20:13:00,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:13:00,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333599215] [2022-11-16 20:13:00,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:13:00,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:13:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:13:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 20:13:00,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:13:00,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333599215] [2022-11-16 20:13:00,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333599215] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:13:00,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132088463] [2022-11-16 20:13:00,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:13:00,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:13:00,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:13:00,446 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:13:00,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 20:13:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:13:00,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 20:13:00,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:13:00,617 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:13:00,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:13:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:13:00,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132088463] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:13:00,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [315944540] [2022-11-16 20:13:00,674 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-16 20:13:00,674 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:13:00,675 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 20:13:00,675 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 20:13:00,675 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 20:13:02,766 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 67 for LOIs [2022-11-16 20:13:02,784 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 294 for LOIs [2022-11-16 20:13:02,863 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 20:13:13,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [315944540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:13:13,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:13:13,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [5, 3, 3] total 28 [2022-11-16 20:13:13,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918106501] [2022-11-16 20:13:13,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:13:13,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-16 20:13:13,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:13:13,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-16 20:13:13,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2022-11-16 20:13:13,130 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 21 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 20:13:15,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:13:15,782 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-11-16 20:13:15,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 20:13:15,783 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-11-16 20:13:15,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:13:15,784 INFO L225 Difference]: With dead ends: 41 [2022-11-16 20:13:15,784 INFO L226 Difference]: Without dead ends: 0 [2022-11-16 20:13:15,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2022-11-16 20:13:15,785 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 20:13:15,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 12 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 316 Invalid, 0 Unknown, 31 Unchecked, 0.6s Time] [2022-11-16 20:13:15,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-16 20:13:15,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-16 20:13:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:13:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-16 20:13:15,787 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2022-11-16 20:13:15,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:13:15,787 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-16 20:13:15,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 20:13:15,787 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-16 20:13:15,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-16 20:13:15,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2022-11-16 20:13:15,790 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2022-11-16 20:13:15,790 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2022-11-16 20:13:15,790 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2022-11-16 20:13:15,790 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2022-11-16 20:13:15,790 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2022-11-16 20:13:15,791 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2022-11-16 20:13:15,791 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2022-11-16 20:13:15,791 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2022-11-16 20:13:15,791 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2022-11-16 20:13:15,791 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2022-11-16 20:13:15,792 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2022-11-16 20:13:15,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 20:13:15,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:13:16,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-16 20:13:22,226 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-16 20:13:22,226 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-16 20:13:22,226 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-16 20:13:22,226 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-16 20:13:22,227 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1561) no Hoare annotation was computed. [2022-11-16 20:13:22,227 INFO L895 garLoopResultBuilder]: At program point L1563(line 1563) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= |ULTIMATE.start_goodB2G_~k~0#1| 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (<= 0 (+ |ULTIMATE.start_goodB2G_~data~0#1| 2147483648)) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_goodB2G_~result~0#1| |ULTIMATE.start_goodB2G_~data~0#1|) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= |ULTIMATE.start_goodB2G_~i~1#1| 1) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (<= |ULTIMATE.start_goodB2G_~data~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-16 20:13:22,227 INFO L899 garLoopResultBuilder]: For program point L1580-2(line 1580) no Hoare annotation was computed. [2022-11-16 20:13:22,227 INFO L899 garLoopResultBuilder]: For program point L1580-3(line 1580) no Hoare annotation was computed. [2022-11-16 20:13:22,227 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1576) no Hoare annotation was computed. [2022-11-16 20:13:22,228 INFO L895 garLoopResultBuilder]: At program point L1580-4(lines 1580 1587) the Hoare annotation is: (and (let ((.cse0 (<= 0 ~GLOBAL_CONST_FALSE~0)) (.cse1 (<= ~globalTrue~0 1)) (.cse2 (<= 1 |ULTIMATE.start_goodB2G_~i~1#1|)) (.cse3 (<= ~globalArgc~0 0)) (.cse4 (<= 0 |#NULL.base|)) (.cse5 (<= |ULTIMATE.start_goodG2B_~h~0#1| 1)) (.cse7 (<= 5 ~globalFive~0)) (.cse9 (<= 5 ~GLOBAL_CONST_FIVE~0)) (.cse10 (<= ~GLOBAL_CONST_TRUE~0 1)) (.cse11 (<= ~globalArgv~0.offset 0)) (.cse12 (<= 1 |ULTIMATE.start_goodG2B_~h~0#1|)) (.cse13 (<= 1 |ULTIMATE.start_goodB2G_~k~0#1|)) (.cse14 (<= ~globalFalse~0 0)) (.cse15 (<= ~GLOBAL_CONST_FIVE~0 5)) (.cse16 (<= |#NULL.offset| 0)) (.cse17 (<= 1 ~GLOBAL_CONST_TRUE~0)) (.cse18 (<= 0 ~globalFalse~0)) (.cse19 (<= 0 ~globalArgc~0)) (.cse20 (<= 0 ~globalArgv~0.base)) (.cse21 (<= |#NULL.base| 0)) (.cse22 (<= ~globalArgv~0.base 0)) (.cse23 (<= ~GLOBAL_CONST_FALSE~0 0)) (.cse24 (<= 0 ~globalArgv~0.offset)) (.cse25 (<= 1 ~globalTrue~0)) (.cse26 (<= |ULTIMATE.start_goodB2G_~k~0#1| 1)) (.cse27 (<= 0 |#NULL.offset|)) (.cse28 (<= ~globalFive~0 5)) (.cse29 (<= 0 |#StackHeapBarrier|)) (.cse30 (<= |ULTIMATE.start_goodB2G_~i~1#1| 1))) (or (let ((.cse6 (+ |ULTIMATE.start_goodG2B_~data~1#1| 3)) (.cse8 (+ |ULTIMATE.start_goodG2B_~result~1#1| 3))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse6) .cse7 (<= 0 .cse8) .cse9 .cse10 .cse11 (<= 1 |ULTIMATE.start_goodG2B_~j~0#1|) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= |ULTIMATE.start_goodG2B_~j~0#1| 1) (<= .cse6 0) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (<= .cse8 0))) (let ((.cse31 (+ |ULTIMATE.start_goodG2B_~data~1#1| 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= .cse31 0) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= 0 .cse31) .cse24 .cse25 .cse26 .cse27 .cse28 (<= 0 |ULTIMATE.start_goodG2B_~j~0#1|) .cse29 (<= |ULTIMATE.start_goodG2B_~j~0#1| 0) .cse30)))) (<= |ULTIMATE.start_goodB2G_~data~0#1| 2147483647)) [2022-11-16 20:13:22,228 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1553) no Hoare annotation was computed. [2022-11-16 20:13:22,228 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-16 20:13:22,229 INFO L895 garLoopResultBuilder]: At program point L1597(line 1597) the Hoare annotation is: (let ((.cse8 (select |#memory_int| 8)) (.cse5 (select |#memory_int| 13)) (.cse4 (select |#memory_int| 5)) (.cse11 (select |#memory_int| 7)) (.cse2 (select |#memory_int| 2)) (.cse0 (select |#memory_int| 11)) (.cse7 (select |#memory_int| 6)) (.cse6 (select |#memory_int| 9)) (.cse1 (select |#memory_int| 12)) (.cse10 (select |#memory_int| 10)) (.cse12 (select |#memory_int| 3)) (.cse13 (select |#memory_int| 4)) (.cse3 (select |#memory_int| 1)) (.cse9 (select |#memory_int| 15))) (and (= (select .cse0 2) 10) (= ~GLOBAL_CONST_FALSE~0 0) (= 48 (select .cse1 1)) (= (select |#length| 17) 54) (= (select .cse1 5) 0) (= 1 (select |#valid| 5)) (= 10 (select .cse2 3)) (= (select |#valid| 15) 1) (= (select .cse3 0) 37) (= (select .cse4 3) 0) (= 5 (select |#length| 10)) (= (select |#length| 6) 5) (= (select .cse3 2) 10) (= (select .cse5 3) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= 108 (select .cse2 1)) (= (select |#valid| 9) 1) (= (select .cse0 3) 0) (= (select .cse6 5) 0) (= (select .cse7 3) 10) (= 5 (select |#length| 4)) (= (select .cse6 4) 10) (= 115 (select .cse3 1)) (= (select .cse8 3) 10) (= (select (select |#memory_int| 16) 0) 0) (= (select |#valid| 11) 1) (= (select .cse8 0) 37) (= (select .cse5 2) 10) (= (select |#length| 8) 5) (= (select .cse9 1) 48) (= (select .cse2 4) 0) (= (select .cse9 3) 120) (= ~globalArgv~0.offset 0) (= 5 (select |#length| 2)) (= 1 (select |#length| 16)) (= (select .cse10 3) 10) (= 122 (select .cse8 1)) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select .cse1 0) 37) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= (select .cse4 1) 102) (= (select .cse7 0) 37) (= 117 (select .cse8 2)) (= (select .cse1 2) 50) (= 108 (select .cse11 1)) (= (select .cse12 0) 37) (= ~GLOBAL_CONST_TRUE~0 1) (= (select |#valid| 18) 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select .cse2 0) 37) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select .cse6 3) 120) (= 5 (select |#length| 7)) (= (select .cse13 4) 0) (= (select .cse10 0) 37) (= (select .cse11 0) 37) (= (select .cse8 4) 0) (= (select |#length| 1) 4) (= (select |#valid| 12) 1) (= (select .cse12 3) 0) (= (select .cse4 2) 10) (= (select .cse0 0) 37) (= 10 (select .cse13 3)) (= (select .cse13 0) 37) (= 103 (select .cse5 1)) (= (select |#valid| 4) 1) (= 0 (select .cse11 4)) (= (select |#length| 13) 4) (= (select |#valid| 1) 1) (= (select .cse5 0) 37) (= 10 (select |#length| 14)) (= 18 (select |#length| 18)) (= (select .cse6 2) 50) (= (select |#length| 19) 16) (= (select .cse13 2) 100) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= 6 (select |#length| 12)) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#length| 5) 4) (= (select .cse9 4) 0) (= (select .cse11 3) 10) (= (select .cse4 0) 37) (= (select |#valid| 14) 1) (= (select |#length| 9) 6) (= (select .cse9 2) 50) (= (select |#valid| 0) 0) (= 108 (select .cse10 1)) (= 115 (select .cse10 2)) (= (select |#valid| 2) 1) (= (select .cse6 1) 48) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= (select .cse1 3) 120) (= (select .cse11 2) 100) (= (select .cse7 4) 0) (= 115 (select .cse2 2)) (= ~globalArgc~0 0) (= (select |#valid| 19) 1) (= (select |#valid| 16) 1) (= (select .cse0 1) 117) (= (select |#valid| 6) 1) (= (select .cse7 2) 100) (= 108 (select .cse7 1)) (= 5 ~globalFive~0) (= (select .cse6 0) 37) (= (select .cse1 4) 10) (= (select .cse12 2) 10) (= (select .cse10 4) 0) (= (select |#length| 3) 4) (= (select |#length| 11) 4) (= (select |#valid| 17) 1) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (= (select .cse12 1) 100) (= 104 (select .cse13 1)) (= (select |#valid| 13) 1) (< 0 |#StackHeapBarrier|) (= (select |#length| 15) 5) (= (select .cse3 3) 0) (= |#NULL.base| 0) (= ~globalTrue~0 1) (= (select .cse9 0) 37))) [2022-11-16 20:13:22,230 INFO L899 garLoopResultBuilder]: For program point L1597-1(line 1597) no Hoare annotation was computed. [2022-11-16 20:13:22,230 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1583) no Hoare annotation was computed. [2022-11-16 20:13:22,230 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1553) no Hoare annotation was computed. [2022-11-16 20:13:22,230 INFO L899 garLoopResultBuilder]: For program point L1557-2(line 1557) no Hoare annotation was computed. [2022-11-16 20:13:22,230 INFO L899 garLoopResultBuilder]: For program point L1557-3(line 1557) no Hoare annotation was computed. [2022-11-16 20:13:22,231 INFO L895 garLoopResultBuilder]: At program point L1557-4(lines 1557 1569) the Hoare annotation is: (let ((.cse0 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse1 (= ~globalArgv~0.offset 0)) (.cse2 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse3 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse4 (= ~globalArgv~0.base 0)) (.cse5 (= |#NULL.offset| 0)) (.cse6 (= ~globalFalse~0 0)) (.cse7 (= ~globalArgc~0 0)) (.cse8 (= 5 ~globalFive~0)) (.cse9 (<= |ULTIMATE.start_goodB2G_~data~0#1| 2147483647)) (.cse10 (<= 0 |#StackHeapBarrier|)) (.cse11 (= |#NULL.base| 0)) (.cse12 (= ~globalTrue~0 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_goodB2G_~i~1#1|) (<= 1 |ULTIMATE.start_goodB2G_~k~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_goodB2G_~k~0#1| 1) .cse8 .cse9 .cse10 (<= |ULTIMATE.start_goodB2G_~i~1#1| 1) .cse11 .cse12) (and .cse0 (= |ULTIMATE.start_goodB2G_~k~0#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_goodB2G_~i~1#1| 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-11-16 20:13:22,231 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1583) no Hoare annotation was computed. [2022-11-16 20:13:22,231 INFO L902 garLoopResultBuilder]: At program point L1599(line 1599) the Hoare annotation is: true [2022-11-16 20:13:22,231 INFO L902 garLoopResultBuilder]: At program point L1599-1(line 1599) the Hoare annotation is: true [2022-11-16 20:13:22,231 INFO L899 garLoopResultBuilder]: For program point L1583(line 1583) no Hoare annotation was computed. [2022-11-16 20:13:22,231 INFO L899 garLoopResultBuilder]: For program point L1583-1(line 1583) no Hoare annotation was computed. [2022-11-16 20:13:22,232 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1580) no Hoare annotation was computed. [2022-11-16 20:13:22,232 INFO L895 garLoopResultBuilder]: At program point L1567(line 1567) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (<= 1 |ULTIMATE.start_goodB2G_~i~1#1|) (= |ULTIMATE.start_goodB2G_~k~0#1| 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (<= (+ |ULTIMATE.start_goodB2G_~data~0#1| 2147483648) 0) (= ~globalArgv~0.base 0) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_goodB2G_~i~1#1| 1) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-16 20:13:22,232 INFO L899 garLoopResultBuilder]: For program point L1567-1(lines 1557 1569) no Hoare annotation was computed. [2022-11-16 20:13:22,232 INFO L899 garLoopResultBuilder]: For program point L1559(lines 1559 1568) no Hoare annotation was computed. [2022-11-16 20:13:22,232 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1580) no Hoare annotation was computed. [2022-11-16 20:13:22,232 INFO L899 garLoopResultBuilder]: For program point L1576-3(line 1576) no Hoare annotation was computed. [2022-11-16 20:13:22,233 INFO L899 garLoopResultBuilder]: For program point L1576-4(line 1576) no Hoare annotation was computed. [2022-11-16 20:13:22,233 INFO L895 garLoopResultBuilder]: At program point L1576-5(lines 1576 1579) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_goodB2G_~k~0#1|) (let ((.cse0 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse1 (<= 1 |ULTIMATE.start_goodB2G_~i~1#1|)) (.cse2 (= ~globalArgv~0.offset 0)) (.cse3 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse4 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse5 (= ~globalArgv~0.base 0)) (.cse6 (= |#NULL.offset| 0)) (.cse7 (= ~globalFalse~0 0)) (.cse8 (= ~globalArgc~0 0)) (.cse9 (= 5 ~globalFive~0)) (.cse10 (= |#NULL.base| 0)) (.cse11 (= ~globalTrue~0 1))) (or (and .cse0 (= |ULTIMATE.start_goodG2B_~h~0#1| 1) .cse1 (= (+ |ULTIMATE.start_goodG2B_~data~1#1| 2) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_goodG2B_~data~1#1| 0) .cse3 .cse4 .cse5 (= |ULTIMATE.start_goodG2B_~h~0#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) (<= |ULTIMATE.start_goodB2G_~k~0#1| 1) (<= |ULTIMATE.start_goodB2G_~data~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_goodB2G_~i~1#1| 1)) [2022-11-16 20:13:22,233 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1557) no Hoare annotation was computed. [2022-11-16 20:13:22,233 INFO L895 garLoopResultBuilder]: At program point L1585(line 1585) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= |ULTIMATE.start_goodG2B_~h~0#1| 1) (<= 1 |ULTIMATE.start_goodB2G_~i~1#1|) (= |ULTIMATE.start_goodG2B_~j~0#1| 0) (<= 1 |ULTIMATE.start_goodB2G_~k~0#1|) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= ~GLOBAL_CONST_TRUE~0 1) (= (+ |ULTIMATE.start_goodG2B_~data~1#1| 3) 0) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_goodG2B_~result~1#1| |ULTIMATE.start_goodG2B_~data~1#1|) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (<= |ULTIMATE.start_goodB2G_~k~0#1| 1) (= 5 ~globalFive~0) (<= |ULTIMATE.start_goodB2G_~data~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_goodB2G_~i~1#1| 1) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-16 20:13:22,233 INFO L899 garLoopResultBuilder]: For program point L1585-1(lines 1580 1587) no Hoare annotation was computed. [2022-11-16 20:13:22,234 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-16 20:13:22,234 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1557) no Hoare annotation was computed. [2022-11-16 20:13:22,234 INFO L899 garLoopResultBuilder]: For program point L1561(line 1561) no Hoare annotation was computed. [2022-11-16 20:13:22,234 INFO L899 garLoopResultBuilder]: For program point L1561-1(line 1561) no Hoare annotation was computed. [2022-11-16 20:13:22,234 INFO L899 garLoopResultBuilder]: For program point L1553-3(line 1553) no Hoare annotation was computed. [2022-11-16 20:13:22,234 INFO L899 garLoopResultBuilder]: For program point L1553-4(line 1553) no Hoare annotation was computed. [2022-11-16 20:13:22,236 INFO L895 garLoopResultBuilder]: At program point L1553-5(lines 1553 1556) the Hoare annotation is: (let ((.cse0 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse1 (= ~globalArgc~0 0)) (.cse2 (= 5 ~globalFive~0)) (.cse3 (= |#NULL.base| 0)) (.cse4 (= ~globalTrue~0 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_goodB2G_~i~1#1|) (<= 5 ~GLOBAL_CONST_FIVE~0) (<= ~GLOBAL_CONST_TRUE~0 1) (<= ~globalArgv~0.offset 0) (<= ~globalFalse~0 0) (<= ~GLOBAL_CONST_FIVE~0 5) (<= |#NULL.offset| 0) (<= 1 ~GLOBAL_CONST_TRUE~0) (<= 0 ~globalFalse~0) (<= 0 ~globalArgv~0.base) (<= ~globalArgv~0.base 0) (<= 0 ~globalArgv~0.offset) .cse1 (<= 0 |#NULL.offset|) .cse2 (<= |ULTIMATE.start_goodB2G_~data~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_goodB2G_~i~1#1| 1) .cse3 .cse4) (let ((.cse13 (select |#memory_int| 8)) (.cse10 (select |#memory_int| 13)) (.cse9 (select |#memory_int| 5)) (.cse16 (select |#memory_int| 7)) (.cse7 (select |#memory_int| 2)) (.cse5 (select |#memory_int| 11)) (.cse12 (select |#memory_int| 6)) (.cse11 (select |#memory_int| 9)) (.cse6 (select |#memory_int| 12)) (.cse15 (select |#memory_int| 10)) (.cse17 (select |#memory_int| 3)) (.cse18 (select |#memory_int| 4)) (.cse8 (select |#memory_int| 1)) (.cse14 (select |#memory_int| 15))) (and (= (select .cse5 2) 10) .cse0 (= 48 (select .cse6 1)) (= (select |#length| 17) 54) (= (select .cse6 5) 0) (= 1 (select |#valid| 5)) (= 10 (select .cse7 3)) (= (select |#valid| 15) 1) (= (select .cse8 0) 37) (= (select .cse9 3) 0) (= 5 (select |#length| 10)) (= (select |#length| 6) 5) (= (select .cse8 2) 10) (= (select .cse10 3) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= 108 (select .cse7 1)) (= (select |#valid| 9) 1) (= (select .cse5 3) 0) (= (select .cse11 5) 0) (= (select .cse12 3) 10) (= 5 (select |#length| 4)) (= (select .cse11 4) 10) (= 115 (select .cse8 1)) (= (select .cse13 3) 10) (= (select (select |#memory_int| 16) 0) 0) (= (select |#valid| 11) 1) (= (select .cse13 0) 37) (= (select .cse10 2) 10) (= (select |#length| 8) 5) (= (select .cse14 1) 48) (= (select .cse7 4) 0) (= (select .cse14 3) 120) (= ~globalArgv~0.offset 0) (= 5 (select |#length| 2)) (= 1 (select |#length| 16)) (= (select .cse15 3) 10) (= 122 (select .cse13 1)) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select .cse6 0) 37) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= (select .cse9 1) 102) (= (select .cse12 0) 37) (= 117 (select .cse13 2)) (= (select .cse6 2) 50) (= 108 (select .cse16 1)) (= (select .cse17 0) 37) (= ~GLOBAL_CONST_TRUE~0 1) (= (select |#valid| 18) 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select .cse7 0) 37) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select .cse11 3) 120) (= 5 (select |#length| 7)) (= |ULTIMATE.start_goodB2G_~data~0#1| 0) (= (select .cse18 4) 0) (= (select .cse15 0) 37) (= (select .cse16 0) 37) (= (select .cse13 4) 0) (= (select |#length| 1) 4) (= (select |#valid| 12) 1) (= (select .cse17 3) 0) (= (select .cse9 2) 10) (= (select .cse5 0) 37) (= |ULTIMATE.start_goodB2G_~i~1#1| 0) (= 10 (select .cse18 3)) (= (select .cse18 0) 37) (= 103 (select .cse10 1)) (= (select |#valid| 4) 1) (= 0 (select .cse16 4)) (= (select |#length| 13) 4) (= (select |#valid| 1) 1) (= (select .cse10 0) 37) (= 10 (select |#length| 14)) (= 18 (select |#length| 18)) (= (select .cse11 2) 50) (= (select |#length| 19) 16) (= (select .cse18 2) 100) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= 6 (select |#length| 12)) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#length| 5) 4) (= (select .cse14 4) 0) (= (select .cse16 3) 10) (= (select .cse9 0) 37) (= (select |#valid| 14) 1) (= (select |#length| 9) 6) (= (select .cse14 2) 50) (= (select |#valid| 0) 0) (= 108 (select .cse15 1)) (= 115 (select .cse15 2)) (= (select |#valid| 2) 1) (= (select .cse11 1) 48) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= (select .cse6 3) 120) (= (select .cse16 2) 100) (= (select .cse12 4) 0) (= 115 (select .cse7 2)) .cse1 (= (select |#valid| 19) 1) (= (select |#valid| 16) 1) (= (select .cse5 1) 117) (= (select |#valid| 6) 1) (= (select .cse12 2) 100) (= 108 (select .cse12 1)) .cse2 (= (select .cse11 0) 37) (= (select .cse6 4) 10) (= (select .cse17 2) 10) (= (select .cse15 4) 0) (= (select |#length| 3) 4) (= (select |#length| 11) 4) (= (select |#valid| 17) 1) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (= (select .cse17 1) 100) (= 104 (select .cse18 1)) (= (select |#valid| 13) 1) (< 0 |#StackHeapBarrier|) (= (select |#length| 15) 5) (= (select .cse8 3) 0) .cse3 .cse4 (= (select .cse14 0) 37))))) [2022-11-16 20:13:22,236 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1561) no Hoare annotation was computed. [2022-11-16 20:13:22,236 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1576) no Hoare annotation was computed. [2022-11-16 20:13:22,240 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:13:22,242 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 20:13:22,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:13:22 BoogieIcfgContainer [2022-11-16 20:13:22,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 20:13:22,272 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 20:13:22,272 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 20:13:22,272 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 20:13:22,273 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:12:39" (3/4) ... [2022-11-16 20:13:22,276 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 20:13:22,281 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-16 20:13:22,281 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-16 20:13:22,287 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 67 nodes and edges [2022-11-16 20:13:22,287 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2022-11-16 20:13:22,287 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-16 20:13:22,288 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-16 20:13:22,288 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-16 20:13:22,288 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 20:13:22,289 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 20:13:22,312 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && 1 <= i) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && 0 <= globalFalse) && 0 <= globalArgv) && globalArgv <= 0) && 0 <= globalArgv) && globalArgc == 0) && 0 <= #NULL) && 5 == globalFive) && data <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && i <= 1) && #NULL == 0) && globalTrue == 1) || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((unknown-#memory_int-unknown[11][2] == 10 && GLOBAL_CONST_FALSE == 0) && 48 == unknown-#memory_int-unknown[12][1]) && unknown-#length-unknown[17] == 54) && unknown-#memory_int-unknown[12][5] == 0) && 1 == \valid[5]) && 10 == unknown-#memory_int-unknown[2][3]) && \valid[15] == 1) && unknown-#memory_int-unknown[1][0] == 37) && unknown-#memory_int-unknown[5][3] == 0) && 5 == unknown-#length-unknown[10]) && unknown-#length-unknown[6] == 5) && unknown-#memory_int-unknown[1][2] == 10) && unknown-#memory_int-unknown[13][3] == 0) && argv == argv) && argc == \old(argc)) && 108 == unknown-#memory_int-unknown[2][1]) && \valid[9] == 1) && unknown-#memory_int-unknown[11][3] == 0) && unknown-#memory_int-unknown[9][5] == 0) && unknown-#memory_int-unknown[6][3] == 10) && 5 == unknown-#length-unknown[4]) && unknown-#memory_int-unknown[9][4] == 10) && 115 == unknown-#memory_int-unknown[1][1]) && unknown-#memory_int-unknown[8][3] == 10) && unknown-#memory_int-unknown[16][0] == 0) && \valid[11] == 1) && unknown-#memory_int-unknown[8][0] == 37) && unknown-#memory_int-unknown[13][2] == 10) && unknown-#length-unknown[8] == 5) && unknown-#memory_int-unknown[15][1] == 48) && unknown-#memory_int-unknown[2][4] == 0) && unknown-#memory_int-unknown[15][3] == 120) && globalArgv == 0) && 5 == unknown-#length-unknown[2]) && 1 == unknown-#length-unknown[16]) && unknown-#memory_int-unknown[10][3] == 10) && 122 == unknown-#memory_int-unknown[8][1]) && 5 == GLOBAL_CONST_FIVE) && unknown-#memory_int-unknown[12][0] == 37) && \valid[3] == 1) && \valid[7] == 1) && unknown-#memory_int-unknown[5][1] == 102) && unknown-#memory_int-unknown[6][0] == 37) && 117 == unknown-#memory_int-unknown[8][2]) && unknown-#memory_int-unknown[12][2] == 50) && 108 == unknown-#memory_int-unknown[7][1]) && unknown-#memory_int-unknown[3][0] == 37) && GLOBAL_CONST_TRUE == 1) && \valid[18] == 1) && argv == argv) && unknown-#memory_int-unknown[2][0] == 37) && argv == argv) && unknown-#memory_int-unknown[9][3] == 120) && 5 == unknown-#length-unknown[7]) && data == 0) && unknown-#memory_int-unknown[4][4] == 0) && unknown-#memory_int-unknown[10][0] == 37) && unknown-#memory_int-unknown[7][0] == 37) && unknown-#memory_int-unknown[8][4] == 0) && unknown-#length-unknown[1] == 4) && \valid[12] == 1) && unknown-#memory_int-unknown[3][3] == 0) && unknown-#memory_int-unknown[5][2] == 10) && unknown-#memory_int-unknown[11][0] == 37) && i == 0) && 10 == unknown-#memory_int-unknown[4][3]) && unknown-#memory_int-unknown[4][0] == 37) && 103 == unknown-#memory_int-unknown[13][1]) && \valid[4] == 1) && 0 == unknown-#memory_int-unknown[7][4]) && unknown-#length-unknown[13] == 4) && \valid[1] == 1) && unknown-#memory_int-unknown[13][0] == 37) && 10 == unknown-#length-unknown[14]) && 18 == unknown-#length-unknown[18]) && unknown-#memory_int-unknown[9][2] == 50) && unknown-#length-unknown[19] == 16) && unknown-#memory_int-unknown[4][2] == 100) && argv == argv) && 6 == unknown-#length-unknown[12]) && globalArgv == 0) && \old(argc) == \old(argc)) && unknown-#length-unknown[5] == 4) && unknown-#memory_int-unknown[15][4] == 0) && unknown-#memory_int-unknown[7][3] == 10) && unknown-#memory_int-unknown[5][0] == 37) && \valid[14] == 1) && unknown-#length-unknown[9] == 6) && unknown-#memory_int-unknown[15][2] == 50) && \valid[0] == 0) && 108 == unknown-#memory_int-unknown[10][1]) && 115 == unknown-#memory_int-unknown[10][2]) && \valid[2] == 1) && unknown-#memory_int-unknown[9][1] == 48) && #NULL == 0) && globalFalse == 0) && unknown-#memory_int-unknown[12][3] == 120) && unknown-#memory_int-unknown[7][2] == 100) && unknown-#memory_int-unknown[6][4] == 0) && 115 == unknown-#memory_int-unknown[2][2]) && globalArgc == 0) && \valid[19] == 1) && \valid[16] == 1) && unknown-#memory_int-unknown[11][1] == 117) && \valid[6] == 1) && unknown-#memory_int-unknown[6][2] == 100) && 108 == unknown-#memory_int-unknown[6][1]) && 5 == globalFive) && unknown-#memory_int-unknown[9][0] == 37) && unknown-#memory_int-unknown[12][4] == 10) && unknown-#memory_int-unknown[3][2] == 10) && unknown-#memory_int-unknown[10][4] == 0) && unknown-#length-unknown[3] == 4) && unknown-#length-unknown[11] == 4) && \valid[17] == 1) && \valid[10] == 1) && \valid[8] == 1) && unknown-#memory_int-unknown[3][1] == 100) && 104 == unknown-#memory_int-unknown[4][1]) && \valid[13] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[15] == 5) && unknown-#memory_int-unknown[1][3] == 0) && #NULL == 0) && globalTrue == 1) && unknown-#memory_int-unknown[15][0] == 37) [2022-11-16 20:13:22,336 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/witness.graphml [2022-11-16 20:13:22,336 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 20:13:22,337 INFO L158 Benchmark]: Toolchain (without parser) took 45458.06ms. Allocated memory was 132.1MB in the beginning and 339.7MB in the end (delta: 207.6MB). Free memory was 92.9MB in the beginning and 286.9MB in the end (delta: -194.0MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2022-11-16 20:13:22,337 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 132.1MB. Free memory was 105.7MB in the beginning and 105.7MB in the end (delta: 30.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 20:13:22,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1785.70ms. Allocated memory is still 132.1MB. Free memory was 92.6MB in the beginning and 54.9MB in the end (delta: 37.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-16 20:13:22,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.85ms. Allocated memory is still 132.1MB. Free memory was 54.9MB in the beginning and 51.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 20:13:22,338 INFO L158 Benchmark]: Boogie Preprocessor took 32.08ms. Allocated memory is still 132.1MB. Free memory was 51.4MB in the beginning and 49.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 20:13:22,338 INFO L158 Benchmark]: RCFGBuilder took 801.06ms. Allocated memory was 132.1MB in the beginning and 161.5MB in the end (delta: 29.4MB). Free memory was 49.3MB in the beginning and 115.0MB in the end (delta: -65.7MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2022-11-16 20:13:22,339 INFO L158 Benchmark]: TraceAbstraction took 42681.08ms. Allocated memory was 161.5MB in the beginning and 339.7MB in the end (delta: 178.3MB). Free memory was 115.0MB in the beginning and 290.0MB in the end (delta: -175.0MB). Peak memory consumption was 184.3MB. Max. memory is 16.1GB. [2022-11-16 20:13:22,340 INFO L158 Benchmark]: Witness Printer took 64.27ms. Allocated memory is still 339.7MB. Free memory was 290.0MB in the beginning and 286.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 20:13:22,347 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 132.1MB. Free memory was 105.7MB in the beginning and 105.7MB in the end (delta: 30.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1785.70ms. Allocated memory is still 132.1MB. Free memory was 92.6MB in the beginning and 54.9MB in the end (delta: 37.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.85ms. Allocated memory is still 132.1MB. Free memory was 54.9MB in the beginning and 51.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.08ms. Allocated memory is still 132.1MB. Free memory was 51.4MB in the beginning and 49.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 801.06ms. Allocated memory was 132.1MB in the beginning and 161.5MB in the end (delta: 29.4MB). Free memory was 49.3MB in the beginning and 115.0MB in the end (delta: -65.7MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * TraceAbstraction took 42681.08ms. Allocated memory was 161.5MB in the beginning and 339.7MB in the end (delta: 178.3MB). Free memory was 115.0MB in the beginning and 290.0MB in the end (delta: -175.0MB). Peak memory consumption was 184.3MB. Max. memory is 16.1GB. * Witness Printer took 64.27ms. Allocated memory is still 339.7MB. Free memory was 290.0MB in the beginning and 286.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 42.6s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 238 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 223 mSDsluCounter, 1022 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 36 IncrementalHoareTripleChecker+Unchecked, 614 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 934 IncrementalHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 408 mSDtfsCounter, 934 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 317 GetRequests, 220 SyntacticMatches, 10 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 24.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=7, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 31 PreInvPairs, 50 NumberOfFragments, 2125 HoareAnnotationTreeSize, 31 FomulaSimplifications, 243 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 12 FomulaSimplificationsInter, 6190 FormulaSimplificationTreeSizeReductionInter, 6.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 462 ConstructedInterpolants, 0 QuantifiedInterpolants, 860 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1624 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 21 InterpolantComputations, 12 PerfectInterpolantSequences, 96/113 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.5s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 6, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 64, DAG_INTERPRETER_EARLY_EXITS: 6, TOOLS_POST_APPLICATIONS: 104, TOOLS_POST_TIME: 3.4s, TOOLS_POST_CALL_APPLICATIONS: 26, TOOLS_POST_CALL_TIME: 0.6s, TOOLS_POST_RETURN_APPLICATIONS: 20, TOOLS_POST_RETURN_TIME: 0.4s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 142, TOOLS_QUANTIFIERELIM_TIME: 4.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.4s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 224, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 36, DOMAIN_JOIN_TIME: 0.8s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 10, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 64, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 8, LOOP_SUMMARIZER_CACHE_MISSES: 8, LOOP_SUMMARIZER_OVERALL_TIME: 1.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 10, CALL_SUMMARIZER_APPLICATIONS: 20, CALL_SUMMARIZER_CACHE_MISSES: 4, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 2873, DAG_COMPRESSION_RETAINED_NODES: 230, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 1576]: Loop Invariant Derived loop invariant: ((((1 <= k && ((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && 1 <= i) && data + 2 == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE == 1) && globalArgv == 0) && #NULL == 0) && globalFalse == 0) && globalArgc == 0) && 5 == globalFive) && #NULL == 0) && globalTrue == 1) || (((((((((((((GLOBAL_CONST_FALSE == 0 && 1 <= i) && globalArgv == 0) && data == 0) && 5 == GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE == 1) && globalArgv == 0) && h == 0) && #NULL == 0) && globalFalse == 0) && globalArgc == 0) && 5 == globalFive) && #NULL == 0) && globalTrue == 1))) && k <= 1) && data <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && i <= 1 - InvariantResult [Line: 1580]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && h <= 1) && 0 <= data + 3) && 5 <= globalFive) && 0 <= result + 3) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && 1 <= j) && 1 <= h) && 1 <= k) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && 0 <= globalFalse) && 0 <= globalArgc) && 0 <= globalArgv) && #NULL <= 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && j <= 1) && data + 3 <= 0) && 1 <= globalTrue) && k <= 1) && 0 <= #NULL) && globalFive <= 5) && 0 <= unknown-#StackHeapBarrier-unknown) && i <= 1) && result + 3 <= 0) || ((((((((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && h <= 1) && 5 <= globalFive) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && 1 <= h) && 1 <= k) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && data + 2 <= 0) && 1 <= GLOBAL_CONST_TRUE) && 0 <= globalFalse) && 0 <= globalArgc) && 0 <= globalArgv) && #NULL <= 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= data + 2) && 0 <= globalArgv) && 1 <= globalTrue) && k <= 1) && 0 <= #NULL) && globalFive <= 5) && 0 <= j) && 0 <= unknown-#StackHeapBarrier-unknown) && j <= 0) && i <= 1)) && data <= 2147483647 - InvariantResult [Line: 1599]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1553]: Loop Invariant Derived loop invariant: ((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && 1 <= i) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && 0 <= globalFalse) && 0 <= globalArgv) && globalArgv <= 0) && 0 <= globalArgv) && globalArgc == 0) && 0 <= #NULL) && 5 == globalFive) && data <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && i <= 1) && #NULL == 0) && globalTrue == 1) || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((unknown-#memory_int-unknown[11][2] == 10 && GLOBAL_CONST_FALSE == 0) && 48 == unknown-#memory_int-unknown[12][1]) && unknown-#length-unknown[17] == 54) && unknown-#memory_int-unknown[12][5] == 0) && 1 == \valid[5]) && 10 == unknown-#memory_int-unknown[2][3]) && \valid[15] == 1) && unknown-#memory_int-unknown[1][0] == 37) && unknown-#memory_int-unknown[5][3] == 0) && 5 == unknown-#length-unknown[10]) && unknown-#length-unknown[6] == 5) && unknown-#memory_int-unknown[1][2] == 10) && unknown-#memory_int-unknown[13][3] == 0) && argv == argv) && argc == \old(argc)) && 108 == unknown-#memory_int-unknown[2][1]) && \valid[9] == 1) && unknown-#memory_int-unknown[11][3] == 0) && unknown-#memory_int-unknown[9][5] == 0) && unknown-#memory_int-unknown[6][3] == 10) && 5 == unknown-#length-unknown[4]) && unknown-#memory_int-unknown[9][4] == 10) && 115 == unknown-#memory_int-unknown[1][1]) && unknown-#memory_int-unknown[8][3] == 10) && unknown-#memory_int-unknown[16][0] == 0) && \valid[11] == 1) && unknown-#memory_int-unknown[8][0] == 37) && unknown-#memory_int-unknown[13][2] == 10) && unknown-#length-unknown[8] == 5) && unknown-#memory_int-unknown[15][1] == 48) && unknown-#memory_int-unknown[2][4] == 0) && unknown-#memory_int-unknown[15][3] == 120) && globalArgv == 0) && 5 == unknown-#length-unknown[2]) && 1 == unknown-#length-unknown[16]) && unknown-#memory_int-unknown[10][3] == 10) && 122 == unknown-#memory_int-unknown[8][1]) && 5 == GLOBAL_CONST_FIVE) && unknown-#memory_int-unknown[12][0] == 37) && \valid[3] == 1) && \valid[7] == 1) && unknown-#memory_int-unknown[5][1] == 102) && unknown-#memory_int-unknown[6][0] == 37) && 117 == unknown-#memory_int-unknown[8][2]) && unknown-#memory_int-unknown[12][2] == 50) && 108 == unknown-#memory_int-unknown[7][1]) && unknown-#memory_int-unknown[3][0] == 37) && GLOBAL_CONST_TRUE == 1) && \valid[18] == 1) && argv == argv) && unknown-#memory_int-unknown[2][0] == 37) && argv == argv) && unknown-#memory_int-unknown[9][3] == 120) && 5 == unknown-#length-unknown[7]) && data == 0) && unknown-#memory_int-unknown[4][4] == 0) && unknown-#memory_int-unknown[10][0] == 37) && unknown-#memory_int-unknown[7][0] == 37) && unknown-#memory_int-unknown[8][4] == 0) && unknown-#length-unknown[1] == 4) && \valid[12] == 1) && unknown-#memory_int-unknown[3][3] == 0) && unknown-#memory_int-unknown[5][2] == 10) && unknown-#memory_int-unknown[11][0] == 37) && i == 0) && 10 == unknown-#memory_int-unknown[4][3]) && unknown-#memory_int-unknown[4][0] == 37) && 103 == unknown-#memory_int-unknown[13][1]) && \valid[4] == 1) && 0 == unknown-#memory_int-unknown[7][4]) && unknown-#length-unknown[13] == 4) && \valid[1] == 1) && unknown-#memory_int-unknown[13][0] == 37) && 10 == unknown-#length-unknown[14]) && 18 == unknown-#length-unknown[18]) && unknown-#memory_int-unknown[9][2] == 50) && unknown-#length-unknown[19] == 16) && unknown-#memory_int-unknown[4][2] == 100) && argv == argv) && 6 == unknown-#length-unknown[12]) && globalArgv == 0) && \old(argc) == \old(argc)) && unknown-#length-unknown[5] == 4) && unknown-#memory_int-unknown[15][4] == 0) && unknown-#memory_int-unknown[7][3] == 10) && unknown-#memory_int-unknown[5][0] == 37) && \valid[14] == 1) && unknown-#length-unknown[9] == 6) && unknown-#memory_int-unknown[15][2] == 50) && \valid[0] == 0) && 108 == unknown-#memory_int-unknown[10][1]) && 115 == unknown-#memory_int-unknown[10][2]) && \valid[2] == 1) && unknown-#memory_int-unknown[9][1] == 48) && #NULL == 0) && globalFalse == 0) && unknown-#memory_int-unknown[12][3] == 120) && unknown-#memory_int-unknown[7][2] == 100) && unknown-#memory_int-unknown[6][4] == 0) && 115 == unknown-#memory_int-unknown[2][2]) && globalArgc == 0) && \valid[19] == 1) && \valid[16] == 1) && unknown-#memory_int-unknown[11][1] == 117) && \valid[6] == 1) && unknown-#memory_int-unknown[6][2] == 100) && 108 == unknown-#memory_int-unknown[6][1]) && 5 == globalFive) && unknown-#memory_int-unknown[9][0] == 37) && unknown-#memory_int-unknown[12][4] == 10) && unknown-#memory_int-unknown[3][2] == 10) && unknown-#memory_int-unknown[10][4] == 0) && unknown-#length-unknown[3] == 4) && unknown-#length-unknown[11] == 4) && \valid[17] == 1) && \valid[10] == 1) && \valid[8] == 1) && unknown-#memory_int-unknown[3][1] == 100) && 104 == unknown-#memory_int-unknown[4][1]) && \valid[13] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[15] == 5) && unknown-#memory_int-unknown[1][3] == 0) && #NULL == 0) && globalTrue == 1) && unknown-#memory_int-unknown[15][0] == 37) - InvariantResult [Line: 1557]: Loop Invariant Derived loop invariant: ((((((((((((((((GLOBAL_CONST_FALSE == 0 && 1 <= i) && 1 <= k) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE == 1) && globalArgv == 0) && #NULL == 0) && globalFalse == 0) && globalArgc == 0) && k <= 1) && 5 == globalFive) && data <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && i <= 1) && #NULL == 0) && globalTrue == 1) || ((((((((((((((GLOBAL_CONST_FALSE == 0 && k == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE == 1) && globalArgv == 0) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && data <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) RESULT: Ultimate proved your program to be correct! [2022-11-16 20:13:22,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27b4b0eb-0685-46ab-b280-de7f8394ffe7/bin/utaipan-Xvt2sAort0/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