./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- 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-38b53e6 [2022-11-25 23:31:40,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:31:40,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:31:40,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:31:40,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:31:40,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:31:40,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:31:40,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:31:40,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:31:40,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:31:40,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:31:40,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:31:40,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:31:40,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:31:40,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:31:40,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:31:40,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:31:40,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:31:40,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:31:40,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:31:40,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:31:40,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:31:40,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:31:40,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:31:40,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:31:40,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:31:40,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:31:40,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:31:40,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:31:40,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:31:40,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:31:40,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:31:40,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:31:40,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:31:40,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:31:40,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:31:40,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:31:40,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:31:40,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:31:40,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:31:40,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:31:40,907 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-25 23:31:40,944 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:31:40,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:31:40,948 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:31:40,948 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:31:40,949 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:31:40,949 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:31:40,949 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:31:40,949 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:31:40,950 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:31:40,950 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:31:40,951 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:31:40,951 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:31:40,951 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:31:40,952 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:31:40,952 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:31:40,952 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:31:40,952 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:31:40,953 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:31:40,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:31:40,954 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:31:40,954 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:31:40,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:31:40,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:31:40,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:31:40,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:31:40,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:31:40,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:31:40,956 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 23:31:40,956 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:31:40,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:31:40,957 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:31:40,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:31:40,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:31:40,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:31:40,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:31:40,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:31:40,958 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:31:40,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:31:40,959 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:31:40,959 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:31:40,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:31:40,959 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:31:40,960 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:31:40,960 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_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/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_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2022-11-25 23:31:41,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:31:41,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:31:41,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:31:41,342 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:31:41,342 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:31:41,343 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2022-11-25 23:31:44,412 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:31:44,667 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:31:44,668 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2022-11-25 23:31:44,674 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/data/b3978dbad/8dbbdb38b88c4b58bc42933831109953/FLAG1da0abffe [2022-11-25 23:31:44,690 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/data/b3978dbad/8dbbdb38b88c4b58bc42933831109953 [2022-11-25 23:31:44,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:31:44,694 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:31:44,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:31:44,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:31:44,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:31:44,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:31:44" (1/1) ... [2022-11-25 23:31:44,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f1b72c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:31:44, skipping insertion in model container [2022-11-25 23:31:44,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:31:44" (1/1) ... [2022-11-25 23:31:44,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:31:44,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:31:44,915 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2022-11-25 23:31:44,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:31:44,978 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:31:44,994 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2022-11-25 23:31:45,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:31:45,022 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:31:45,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:31:45 WrapperNode [2022-11-25 23:31:45,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:31:45,024 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:31:45,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:31:45,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:31:45,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:31:45" (1/1) ... [2022-11-25 23:31:45,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:31:45" (1/1) ... [2022-11-25 23:31:45,069 INFO L138 Inliner]: procedures = 18, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 186 [2022-11-25 23:31:45,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:31:45,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:31:45,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:31:45,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:31:45,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:31:45" (1/1) ... [2022-11-25 23:31:45,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:31:45" (1/1) ... [2022-11-25 23:31:45,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:31:45" (1/1) ... [2022-11-25 23:31:45,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:31:45" (1/1) ... [2022-11-25 23:31:45,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:31:45" (1/1) ... [2022-11-25 23:31:45,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:31:45" (1/1) ... [2022-11-25 23:31:45,108 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:31:45" (1/1) ... [2022-11-25 23:31:45,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:31:45" (1/1) ... [2022-11-25 23:31:45,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:31:45,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:31:45,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:31:45,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:31:45,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:31:45" (1/1) ... [2022-11-25 23:31:45,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:31:45,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:31:45,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:31:45,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:31:45,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:31:45,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:31:45,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:31:45,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:31:45,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:31:45,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:31:45,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:31:45,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 23:31:45,219 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 23:31:45,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:31:45,376 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:31:45,379 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:31:45,810 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:31:45,878 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:31:45,879 INFO L300 CfgBuilder]: Removed 10 assume(true) statements. [2022-11-25 23:31:45,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:31:45 BoogieIcfgContainer [2022-11-25 23:31:45,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:31:45,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:31:45,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:31:45,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:31:45,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:31:44" (1/3) ... [2022-11-25 23:31:45,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472ec7d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:31:45, skipping insertion in model container [2022-11-25 23:31:45,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:31:45" (2/3) ... [2022-11-25 23:31:45,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472ec7d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:31:45, skipping insertion in model container [2022-11-25 23:31:45,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:31:45" (3/3) ... [2022-11-25 23:31:45,891 INFO L112 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2022-11-25 23:31:45,912 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:31:45,912 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-11-25 23:31:45,977 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:31:45,983 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;@b9c8287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:31:45,983 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-11-25 23:31:45,987 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 47 states have (on average 1.851063829787234) internal successors, (87), 75 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:31:45,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:31:45,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:31:45,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:31:45,993 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-25 23:31:45,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:31:45,999 INFO L85 PathProgramCache]: Analyzing trace with hash 268783, now seen corresponding path program 1 times [2022-11-25 23:31:46,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:31:46,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649829844] [2022-11-25 23:31:46,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:31:46,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:31:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:31:46,210 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-25 23:31:46,210 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:31:46,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649829844] [2022-11-25 23:31:46,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649829844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:31:46,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:31:46,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:31:46,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169856443] [2022-11-25 23:31:46,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:31:46,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:31:46,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:31:46,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:31:46,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:31:46,261 INFO L87 Difference]: Start difference. First operand has 80 states, 47 states have (on average 1.851063829787234) internal successors, (87), 75 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-25 23:31:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:31:46,434 INFO L93 Difference]: Finished difference Result 149 states and 178 transitions. [2022-11-25 23:31:46,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:31:46,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 23:31:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:31:46,445 INFO L225 Difference]: With dead ends: 149 [2022-11-25 23:31:46,445 INFO L226 Difference]: Without dead ends: 143 [2022-11-25 23:31:46,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-25 23:31:46,452 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 76 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:31:46,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 164 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:31:46,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-25 23:31:46,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 84. [2022-11-25 23:31:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.7547169811320755) internal successors, (93), 79 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:31:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2022-11-25 23:31:46,529 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 3 [2022-11-25 23:31:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:31:46,530 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2022-11-25 23:31:46,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-25 23:31:46,532 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2022-11-25 23:31:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:31:46,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:31:46,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:31:46,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:31:46,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-25 23:31:46,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:31:46,534 INFO L85 PathProgramCache]: Analyzing trace with hash 8332319, now seen corresponding path program 1 times [2022-11-25 23:31:46,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:31:46,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165754751] [2022-11-25 23:31:46,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:31:46,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:31:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:31:46,649 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-25 23:31:46,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:31:46,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165754751] [2022-11-25 23:31:46,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165754751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:31:46,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:31:46,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:31:46,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665822775] [2022-11-25 23:31:46,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:31:46,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:31:46,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:31:46,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:31:46,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:31:46,654 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:31:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:31:46,797 INFO L93 Difference]: Finished difference Result 226 states and 270 transitions. [2022-11-25 23:31:46,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:31:46,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 23:31:46,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:31:46,799 INFO L225 Difference]: With dead ends: 226 [2022-11-25 23:31:46,799 INFO L226 Difference]: Without dead ends: 146 [2022-11-25 23:31:46,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-25 23:31:46,802 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 69 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:31:46,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 181 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:31:46,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-25 23:31:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 90. [2022-11-25 23:31:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.6779661016949152) internal successors, (99), 85 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:31:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions. [2022-11-25 23:31:46,812 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 105 transitions. Word has length 4 [2022-11-25 23:31:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:31:46,813 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 105 transitions. [2022-11-25 23:31:46,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:31:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2022-11-25 23:31:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:31:46,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:31:46,814 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2022-11-25 23:31:46,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:31:46,815 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-25 23:31:46,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:31:46,816 INFO L85 PathProgramCache]: Analyzing trace with hash -879728881, now seen corresponding path program 1 times [2022-11-25 23:31:46,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:31:46,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796373444] [2022-11-25 23:31:46,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:31:46,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:31:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:31:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:31:46,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:31:46,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796373444] [2022-11-25 23:31:46,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796373444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:31:46,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:31:46,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:31:46,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789394088] [2022-11-25 23:31:46,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:31:46,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:31:46,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:31:46,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:31:46,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:31:46,893 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-25 23:31:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:31:46,933 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2022-11-25 23:31:46,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:31:46,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 23:31:46,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:31:46,935 INFO L225 Difference]: With dead ends: 90 [2022-11-25 23:31:46,937 INFO L226 Difference]: Without dead ends: 89 [2022-11-25 23:31:46,938 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-25 23:31:46,939 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:31:46,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:31:46,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-25 23:31:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-11-25 23:31:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 82 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:31:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2022-11-25 23:31:46,964 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 7 [2022-11-25 23:31:46,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:31:46,964 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2022-11-25 23:31:46,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-25 23:31:46,965 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2022-11-25 23:31:46,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:31:46,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:31:46,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:31:46,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:31:46,966 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-25 23:31:46,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:31:46,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1501017704, now seen corresponding path program 1 times [2022-11-25 23:31:46,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:31:46,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421161343] [2022-11-25 23:31:46,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:31:46,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:31:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:31:47,093 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-25 23:31:47,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:31:47,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421161343] [2022-11-25 23:31:47,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421161343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:31:47,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:31:47,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:31:47,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986497386] [2022-11-25 23:31:47,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:31:47,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:31:47,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:31:47,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:31:47,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:31:47,096 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:31:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:31:47,174 INFO L93 Difference]: Finished difference Result 187 states and 220 transitions. [2022-11-25 23:31:47,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:31:47,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 23:31:47,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:31:47,176 INFO L225 Difference]: With dead ends: 187 [2022-11-25 23:31:47,176 INFO L226 Difference]: Without dead ends: 127 [2022-11-25 23:31:47,177 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-25 23:31:47,178 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 40 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:31:47,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 204 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:31:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-25 23:31:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2022-11-25 23:31:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.639344262295082) internal successors, (100), 86 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:31:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2022-11-25 23:31:47,188 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 8 [2022-11-25 23:31:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:31:47,189 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2022-11-25 23:31:47,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:31:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2022-11-25 23:31:47,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:31:47,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:31:47,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:31:47,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:31:47,190 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-25 23:31:47,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:31:47,191 INFO L85 PathProgramCache]: Analyzing trace with hash 416085629, now seen corresponding path program 1 times [2022-11-25 23:31:47,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:31:47,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236194408] [2022-11-25 23:31:47,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:31:47,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:31:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:31:47,287 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-25 23:31:47,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:31:47,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236194408] [2022-11-25 23:31:47,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236194408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:31:47,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:31:47,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:31:47,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907850120] [2022-11-25 23:31:47,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:31:47,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:31:47,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:31:47,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:31:47,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:31:47,291 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-25 23:31:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:31:47,348 INFO L93 Difference]: Finished difference Result 180 states and 210 transitions. [2022-11-25 23:31:47,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:31:47,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-25 23:31:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:31:47,350 INFO L225 Difference]: With dead ends: 180 [2022-11-25 23:31:47,350 INFO L226 Difference]: Without dead ends: 94 [2022-11-25 23:31:47,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:31:47,352 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 58 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:31:47,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 99 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:31:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-25 23:31:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2022-11-25 23:31:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.6166666666666667) internal successors, (97), 79 states have internal predecessors, (97), 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-25 23:31:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2022-11-25 23:31:47,363 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 10 [2022-11-25 23:31:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:31:47,363 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2022-11-25 23:31:47,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-25 23:31:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-11-25 23:31:47,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:31:47,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:31:47,365 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:31:47,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:31:47,365 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-25 23:31:47,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:31:47,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1913792885, now seen corresponding path program 1 times [2022-11-25 23:31:47,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:31:47,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186509719] [2022-11-25 23:31:47,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:31:47,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:31:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:31:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:31:47,436 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:31:47,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186509719] [2022-11-25 23:31:47,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186509719] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:31:47,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326724060] [2022-11-25 23:31:47,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:31:47,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:31:47,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:31:47,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:31:47,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:31:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:31:47,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:31:47,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:31:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:31:47,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:31:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:31:47,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326724060] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:31:47,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [195028576] [2022-11-25 23:31:47,664 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-25 23:31:47,664 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:31:47,667 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:31:47,675 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:31:47,675 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:31:47,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:47,792 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 23:31:47,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-25 23:31:47,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:47,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:31:47,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:47,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 23:31:47,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:47,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:47,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-25 23:31:48,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:48,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:48,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:48,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:31:48,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:48,325 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-11-25 23:31:48,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 215 [2022-11-25 23:31:48,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:31:48,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:31:48,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:31:48,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:31:48,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:48,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-25 23:31:48,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:48,742 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 23:31:48,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 143 [2022-11-25 23:31:48,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:31:48,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:31:49,015 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:31:49,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [195028576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:31:49,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:31:49,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4, 4] total 13 [2022-11-25 23:31:49,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809923286] [2022-11-25 23:31:49,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:31:49,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:31:49,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:31:49,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:31:49,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:31:49,811 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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-25 23:31:50,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:31:50,339 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2022-11-25 23:31:50,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:31:50,340 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 23:31:50,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:31:50,340 INFO L225 Difference]: With dead ends: 93 [2022-11-25 23:31:50,340 INFO L226 Difference]: Without dead ends: 91 [2022-11-25 23:31:50,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:31:50,342 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 27 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:31:50,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 174 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:31:50,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-25 23:31:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2022-11-25 23:31:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.603448275862069) internal successors, (93), 75 states have internal predecessors, (93), 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-25 23:31:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2022-11-25 23:31:50,358 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 11 [2022-11-25 23:31:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:31:50,359 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2022-11-25 23:31:50,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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-25 23:31:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-11-25 23:31:50,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:31:50,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:31:50,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:31:50,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:31:50,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:31:50,566 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-25 23:31:50,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:31:50,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1897720837, now seen corresponding path program 1 times [2022-11-25 23:31:50,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:31:50,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507330083] [2022-11-25 23:31:50,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:31:50,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:31:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:31:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:31:50,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:31:50,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507330083] [2022-11-25 23:31:50,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507330083] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:31:50,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244496464] [2022-11-25 23:31:50,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:31:50,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:31:50,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:31:50,695 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:31:50,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:31:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:31:50,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:31:50,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:31:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:31:50,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:31:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:31:50,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244496464] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:31:50,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [581158943] [2022-11-25 23:31:50,848 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-25 23:31:50,848 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:31:50,848 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:31:50,849 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:31:50,849 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:31:50,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:50,882 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 23:31:50,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-25 23:31:50,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:50,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:31:50,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:50,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 23:31:50,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:50,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:50,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-25 23:31:51,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:51,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:51,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:51,078 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:31:51,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:51,086 INFO L321 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2022-11-25 23:31:51,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 243 treesize of output 212 [2022-11-25 23:31:51,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:31:51,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:31:51,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:31:51,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:31:51,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:51,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-25 23:31:51,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:51,354 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 23:31:51,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 143 [2022-11-25 23:31:51,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:31:51,469 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:31:51,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [581158943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:31:51,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:31:51,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 4, 4] total 18 [2022-11-25 23:31:51,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439020282] [2022-11-25 23:31:51,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:31:51,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:31:51,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:31:51,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:31:51,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:31:51,987 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 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-25 23:31:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:31:52,899 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2022-11-25 23:31:52,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:31:52,900 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 23:31:52,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:31:52,901 INFO L225 Difference]: With dead ends: 174 [2022-11-25 23:31:52,901 INFO L226 Difference]: Without dead ends: 105 [2022-11-25 23:31:52,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2022-11-25 23:31:52,903 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 51 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:31:52,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 234 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:31:52,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-25 23:31:52,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 81. [2022-11-25 23:31:52,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.5833333333333333) internal successors, (95), 77 states have internal predecessors, (95), 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-25 23:31:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2022-11-25 23:31:52,912 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 14 [2022-11-25 23:31:52,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:31:52,912 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2022-11-25 23:31:52,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 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-25 23:31:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2022-11-25 23:31:52,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 23:31:52,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:31:52,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:31:52,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:31:53,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:31:53,114 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-25 23:31:53,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:31:53,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1295851029, now seen corresponding path program 1 times [2022-11-25 23:31:53,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:31:53,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005702555] [2022-11-25 23:31:53,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:31:53,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:31:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:31:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:31:53,209 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:31:53,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005702555] [2022-11-25 23:31:53,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005702555] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:31:53,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378877050] [2022-11-25 23:31:53,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:31:53,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:31:53,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:31:53,211 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:31:53,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:31:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:31:53,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:31:53,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:31:53,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:31:53,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:31:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:31:53,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378877050] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:31:53,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2023702664] [2022-11-25 23:31:53,345 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-25 23:31:53,345 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:31:53,345 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:31:53,345 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:31:53,345 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:31:53,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:53,388 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:31:53,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-25 23:31:53,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:53,413 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 23:31:53,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-25 23:31:53,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:53,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 23:31:53,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:53,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:53,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-25 23:31:53,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:53,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:53,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:53,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:31:53,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:53,588 INFO L321 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2022-11-25 23:31:53,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 243 treesize of output 212 [2022-11-25 23:31:53,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:31:53,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:31:53,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:31:53,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:31:53,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:53,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-25 23:31:53,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:53,791 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 23:31:53,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 140 [2022-11-25 23:31:53,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:31:53,874 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:31:54,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2023702664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:31:54,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:31:54,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5, 4, 4] total 20 [2022-11-25 23:31:54,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050045035] [2022-11-25 23:31:54,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:31:54,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 23:31:54,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:31:54,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 23:31:54,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2022-11-25 23:31:54,669 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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-25 23:31:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:31:55,580 INFO L93 Difference]: Finished difference Result 159 states and 183 transitions. [2022-11-25 23:31:55,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:31:55,580 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 23:31:55,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:31:55,581 INFO L225 Difference]: With dead ends: 159 [2022-11-25 23:31:55,581 INFO L226 Difference]: Without dead ends: 101 [2022-11-25 23:31:55,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2022-11-25 23:31:55,583 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 36 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:31:55,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 260 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:31:55,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-25 23:31:55,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2022-11-25 23:31:55,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.564516129032258) internal successors, (97), 79 states have internal predecessors, (97), 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-25 23:31:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2022-11-25 23:31:55,598 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 15 [2022-11-25 23:31:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:31:55,598 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2022-11-25 23:31:55,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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-25 23:31:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-11-25 23:31:55,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:31:55,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:31:55,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:31:55,611 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-25 23:31:55,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:31:55,806 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-25 23:31:55,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:31:55,807 INFO L85 PathProgramCache]: Analyzing trace with hash 227932173, now seen corresponding path program 1 times [2022-11-25 23:31:55,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:31:55,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957942291] [2022-11-25 23:31:55,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:31:55,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:31:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:31:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:31:55,894 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:31:55,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957942291] [2022-11-25 23:31:55,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957942291] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:31:55,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372622] [2022-11-25 23:31:55,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:31:55,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:31:55,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:31:55,895 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:31:55,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:31:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:31:55,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:31:55,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:31:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:31:55,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:31:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:31:56,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372622] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:31:56,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1989635637] [2022-11-25 23:31:56,037 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-25 23:31:56,038 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:31:56,038 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:31:56,038 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:31:56,038 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:31:56,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:56,064 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:31:56,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-25 23:31:56,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:56,089 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 23:31:56,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-25 23:31:56,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:56,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 23:31:56,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:56,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:56,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-25 23:31:56,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:56,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:56,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:56,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:31:56,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:56,292 INFO L321 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2022-11-25 23:31:56,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 233 treesize of output 212 [2022-11-25 23:31:56,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:31:56,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:31:56,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:31:56,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:31:56,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:56,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-25 23:31:56,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:56,511 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 23:31:56,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 140 [2022-11-25 23:31:56,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:31:56,623 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:31:57,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1989635637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:31:57,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:31:57,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 4, 4] total 22 [2022-11-25 23:31:57,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578344878] [2022-11-25 23:31:57,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:31:57,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:31:57,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:31:57,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:31:57,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2022-11-25 23:31:57,623 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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-25 23:31:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:31:58,540 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2022-11-25 23:31:58,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 23:31:58,541 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 23:31:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:31:58,542 INFO L225 Difference]: With dead ends: 120 [2022-11-25 23:31:58,542 INFO L226 Difference]: Without dead ends: 118 [2022-11-25 23:31:58,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2022-11-25 23:31:58,543 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 72 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:31:58,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 204 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:31:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-25 23:31:58,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 87. [2022-11-25 23:31:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 83 states have internal predecessors, (101), 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-25 23:31:58,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2022-11-25 23:31:58,559 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 17 [2022-11-25 23:31:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:31:58,559 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2022-11-25 23:31:58,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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-25 23:31:58,560 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2022-11-25 23:31:58,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:31:58,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:31:58,560 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] [2022-11-25 23:31:58,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:31:58,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-25 23:31:58,772 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-25 23:31:58,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:31:58,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2058412952, now seen corresponding path program 1 times [2022-11-25 23:31:58,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:31:58,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312931819] [2022-11-25 23:31:58,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:31:58,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:31:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:31:58,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:31:58,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:31:58,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312931819] [2022-11-25 23:31:58,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312931819] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:31:58,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092816798] [2022-11-25 23:31:58,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:31:58,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:31:58,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:31:58,837 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:31:58,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:31:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:31:58,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:31:58,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:31:58,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:31:58,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:31:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:31:58,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092816798] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:31:58,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [537529555] [2022-11-25 23:31:58,974 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-25 23:31:58,974 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:31:58,975 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:31:58,975 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:31:58,975 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:31:58,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:59,012 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 23:31:59,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-25 23:31:59,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:59,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:31:59,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:59,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 23:31:59,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:59,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-11-25 23:31:59,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:59,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:59,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:59,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:31:59,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:59,193 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-11-25 23:31:59,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 215 [2022-11-25 23:31:59,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:31:59,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:31:59,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:31:59,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:31:59,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:59,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-25 23:31:59,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:31:59,460 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 23:31:59,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 140 [2022-11-25 23:31:59,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:32:00,196 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:32:01,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [537529555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:32:01,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:32:01,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 4, 4] total 22 [2022-11-25 23:32:01,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661765169] [2022-11-25 23:32:01,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:32:01,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:32:01,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:32:01,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:32:01,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2022-11-25 23:32:01,450 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:32:03,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:32:03,457 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-11-25 23:32:03,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 23:32:03,457 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 23:32:03,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:32:03,458 INFO L225 Difference]: With dead ends: 99 [2022-11-25 23:32:03,458 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 23:32:03,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=236, Invalid=886, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 23:32:03,459 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:32:03,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:32:03,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 23:32:03,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 23:32:03,460 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-25 23:32:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 23:32:03,461 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-11-25 23:32:03,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:32:03,461 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 23:32:03,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:32:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 23:32:03,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 23:32:03,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 28 remaining) [2022-11-25 23:32:03,465 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2022-11-25 23:32:03,465 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2022-11-25 23:32:03,465 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 28 remaining) [2022-11-25 23:32:03,465 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2022-11-25 23:32:03,465 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2022-11-25 23:32:03,466 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2022-11-25 23:32:03,466 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2022-11-25 23:32:03,466 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2022-11-25 23:32:03,466 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2022-11-25 23:32:03,466 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2022-11-25 23:32:03,467 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2022-11-25 23:32:03,467 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2022-11-25 23:32:03,467 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2022-11-25 23:32:03,467 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 28 remaining) [2022-11-25 23:32:03,467 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 28 remaining) [2022-11-25 23:32:03,468 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2022-11-25 23:32:03,468 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2022-11-25 23:32:03,468 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2022-11-25 23:32:03,468 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2022-11-25 23:32:03,468 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2022-11-25 23:32:03,469 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2022-11-25 23:32:03,469 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2022-11-25 23:32:03,469 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2022-11-25 23:32:03,469 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2022-11-25 23:32:03,469 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2022-11-25 23:32:03,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2022-11-25 23:32:03,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2022-11-25 23:32:03,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:32:03,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 23:32:03,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 23:32:05,249 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-25 23:32:05,249 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 54) no Hoare annotation was computed. [2022-11-25 23:32:05,249 INFO L899 garLoopResultBuilder]: For program point L52-2(lines 52 54) no Hoare annotation was computed. [2022-11-25 23:32:05,249 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-25 23:32:05,249 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 23:32:05,250 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 62) no Hoare annotation was computed. [2022-11-25 23:32:05,250 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2022-11-25 23:32:05,250 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 62) no Hoare annotation was computed. [2022-11-25 23:32:05,250 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2022-11-25 23:32:05,250 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-25 23:32:05,250 INFO L899 garLoopResultBuilder]: For program point L55-3(line 55) no Hoare annotation was computed. [2022-11-25 23:32:05,255 INFO L899 garLoopResultBuilder]: For program point L22-3(line 22) no Hoare annotation was computed. [2022-11-25 23:32:05,255 INFO L899 garLoopResultBuilder]: For program point L55-4(line 55) no Hoare annotation was computed. [2022-11-25 23:32:05,255 INFO L899 garLoopResultBuilder]: For program point L22-4(line 22) no Hoare annotation was computed. [2022-11-25 23:32:05,257 INFO L895 garLoopResultBuilder]: At program point L55-5(lines 55 59) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#values~0#1.offset| 0)) (.cse1 (<= 0 |ULTIMATE.start_main_~#set~0#1.base|)) (.cse2 (= |ULTIMATE.start_elem_exists_~i~0#1| 0)) (.cse3 (<= 0 |ULTIMATE.start_main_~#values~0#1.base|)) (.cse4 (<= |ULTIMATE.start_elem_exists_~size#1| 0)) (.cse5 (= 0 |ULTIMATE.start_elem_exists_#res#1|)) (.cse6 (= |ULTIMATE.start_main_~#set~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse8 (= |#NULL.offset| 0)) (.cse9 (<= 0 |ULTIMATE.start_elem_exists_#in~set#1.offset|)) (.cse10 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse11 (<= 0 |#StackHeapBarrier|)) (.cse12 (<= 0 |ULTIMATE.start_elem_exists_~size#1|)) (.cse13 (= |#NULL.base| 0)) (.cse14 (<= |ULTIMATE.start_elem_exists_~set#1.offset| 0))) (or (and (= |ULTIMATE.start_elem_exists_~set#1.base| |ULTIMATE.start_elem_exists_#in~set#1.base|) .cse0 .cse1 (= (select (select |#memory_int| |ULTIMATE.start_main_~#values~0#1.base|) (+ |ULTIMATE.start_main_~#values~0#1.offset| (* |ULTIMATE.start_main_~v~0#1| 4))) |ULTIMATE.start_elem_exists_#in~value#1|) .cse2 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_elem_exists_#in~size#1|) (= |ULTIMATE.start_main_~#set~0#1.base| |ULTIMATE.start_elem_exists_#in~set#1.base|) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~v~0#1| 0) .cse8 .cse9 .cse10 (= |ULTIMATE.start_elem_exists_#in~value#1| |ULTIMATE.start_elem_exists_~value#1|) .cse11 .cse12 (= |ULTIMATE.start_elem_exists_#in~set#1.offset| |ULTIMATE.start_elem_exists_~set#1.offset|) .cse13 .cse14) (and (<= |ULTIMATE.start_elem_exists_#in~size#1| 0) (<= |ULTIMATE.start_main_~v~0#1| 100000) (<= 0 |ULTIMATE.start_elem_exists_#in~set#1.base|) (<= 0 |ULTIMATE.start_elem_exists_~set#1.base|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 |ULTIMATE.start_elem_exists_~set#1.offset|) .cse8 .cse9 (or (<= 1 |ULTIMATE.start_main_~v~0#1|) (and (= (select |#length| |ULTIMATE.start_main_~#values~0#1.base|) 400000) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#values~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#values~0#1.base|) 1))) (<= 0 |ULTIMATE.start_main_~v~0#1|) .cse10 .cse11 .cse12 (<= 0 |ULTIMATE.start_elem_exists_#in~size#1|) (<= |ULTIMATE.start_elem_exists_#in~set#1.offset| 0) .cse13 .cse14))) [2022-11-25 23:32:05,257 INFO L895 garLoopResultBuilder]: At program point L22-5(lines 22 24) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#values~0#1.offset| 0)) (.cse1 (<= 0 |ULTIMATE.start_main_~#set~0#1.base|)) (.cse2 (= |ULTIMATE.start_elem_exists_~i~0#1| 0)) (.cse3 (<= 0 |ULTIMATE.start_main_~#values~0#1.base|)) (.cse4 (<= |ULTIMATE.start_elem_exists_~size#1| 0)) (.cse5 (= |ULTIMATE.start_main_~#set~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse7 (= |#NULL.offset| 0)) (.cse8 (<= 0 |ULTIMATE.start_elem_exists_#in~set#1.offset|)) (.cse9 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse10 (<= 0 |#StackHeapBarrier|)) (.cse11 (<= 0 |ULTIMATE.start_elem_exists_~size#1|)) (.cse12 (= |#NULL.base| 0)) (.cse13 (<= |ULTIMATE.start_elem_exists_~set#1.offset| 0))) (or (and (= |ULTIMATE.start_elem_exists_~set#1.base| |ULTIMATE.start_elem_exists_#in~set#1.base|) (= |ULTIMATE.start_elem_exists_#in~value#1| |ULTIMATE.start_main_#t~mem12#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#values~0#1.base|) (+ |ULTIMATE.start_main_~#values~0#1.offset| (* |ULTIMATE.start_main_~v~0#1| 4))) |ULTIMATE.start_main_#t~mem12#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_elem_exists_#in~size#1|) (= |ULTIMATE.start_main_~#set~0#1.base| |ULTIMATE.start_elem_exists_#in~set#1.base|) .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_main_~v~0#1| 0) .cse7 .cse8 .cse9 (= |ULTIMATE.start_elem_exists_#in~value#1| |ULTIMATE.start_elem_exists_~value#1|) .cse10 .cse11 (= |ULTIMATE.start_elem_exists_#in~set#1.offset| |ULTIMATE.start_elem_exists_~set#1.offset|) .cse12 .cse13) (and (<= |ULTIMATE.start_elem_exists_#in~size#1| 0) (<= |ULTIMATE.start_main_~v~0#1| 100000) (<= 0 |ULTIMATE.start_elem_exists_#in~set#1.base|) (<= 0 |ULTIMATE.start_elem_exists_~set#1.base|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 0 |ULTIMATE.start_elem_exists_~set#1.offset|) .cse7 .cse8 (or (<= 1 |ULTIMATE.start_main_~v~0#1|) (and (= (select |#length| |ULTIMATE.start_main_~#values~0#1.base|) 400000) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#values~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#values~0#1.base|) 1))) (<= 0 |ULTIMATE.start_main_~v~0#1|) .cse9 .cse10 .cse11 (<= 0 |ULTIMATE.start_elem_exists_#in~size#1|) (<= |ULTIMATE.start_elem_exists_#in~set#1.offset| 0) .cse12 .cse13))) [2022-11-25 23:32:05,258 INFO L899 garLoopResultBuilder]: For program point L39-3(line 39) no Hoare annotation was computed. [2022-11-25 23:32:05,258 INFO L899 garLoopResultBuilder]: For program point L39-4(line 39) no Hoare annotation was computed. [2022-11-25 23:32:05,258 INFO L895 garLoopResultBuilder]: At program point L39-5(lines 39 43) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~#set~0#1.base|) (= |ULTIMATE.start_main_~#set~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) [2022-11-25 23:32:05,258 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-25 23:32:05,258 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-11-25 23:32:05,259 INFO L899 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-11-25 23:32:05,259 INFO L899 garLoopResultBuilder]: For program point L56-1(line 56) no Hoare annotation was computed. [2022-11-25 23:32:05,259 INFO L899 garLoopResultBuilder]: For program point L56-5(line 56) no Hoare annotation was computed. [2022-11-25 23:32:05,259 INFO L899 garLoopResultBuilder]: For program point L56-6(line 56) no Hoare annotation was computed. [2022-11-25 23:32:05,259 INFO L895 garLoopResultBuilder]: At program point L56-7(lines 56 58) the Hoare annotation is: false [2022-11-25 23:32:05,259 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-11-25 23:32:05,260 INFO L899 garLoopResultBuilder]: For program point L40-1(line 40) no Hoare annotation was computed. [2022-11-25 23:32:05,260 INFO L899 garLoopResultBuilder]: For program point L40-5(line 40) no Hoare annotation was computed. [2022-11-25 23:32:05,260 INFO L899 garLoopResultBuilder]: For program point L40-6(line 40) no Hoare annotation was computed. [2022-11-25 23:32:05,260 INFO L895 garLoopResultBuilder]: At program point L40-7(lines 40 42) the Hoare annotation is: false [2022-11-25 23:32:05,260 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: false [2022-11-25 23:32:05,260 INFO L899 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2022-11-25 23:32:05,260 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2022-11-25 23:32:05,261 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: false [2022-11-25 23:32:05,261 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2022-11-25 23:32:05,261 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 23:32:05,261 INFO L895 garLoopResultBuilder]: At program point L25(lines 20 26) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#values~0#1.offset| 0)) (.cse1 (<= 0 |ULTIMATE.start_main_~#set~0#1.base|)) (.cse2 (= |ULTIMATE.start_elem_exists_~i~0#1| 0)) (.cse3 (<= 0 |ULTIMATE.start_main_~#values~0#1.base|)) (.cse4 (<= |ULTIMATE.start_elem_exists_~size#1| 0)) (.cse5 (= 0 |ULTIMATE.start_elem_exists_#res#1|)) (.cse6 (= |ULTIMATE.start_main_~#set~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse8 (= |#NULL.offset| 0)) (.cse9 (<= 0 |ULTIMATE.start_elem_exists_#in~set#1.offset|)) (.cse10 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse11 (<= 0 |#StackHeapBarrier|)) (.cse12 (<= 0 |ULTIMATE.start_elem_exists_~size#1|)) (.cse13 (= |#NULL.base| 0)) (.cse14 (<= |ULTIMATE.start_elem_exists_~set#1.offset| 0))) (or (and (<= |ULTIMATE.start_elem_exists_#in~size#1| 0) (<= |ULTIMATE.start_main_~v~0#1| 100000) (<= 0 |ULTIMATE.start_elem_exists_#in~set#1.base|) (<= 0 |ULTIMATE.start_elem_exists_~set#1.base|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 |ULTIMATE.start_elem_exists_~set#1.offset|) .cse8 .cse9 (or (<= 1 |ULTIMATE.start_main_~v~0#1|) (and (= (select |#length| |ULTIMATE.start_main_~#values~0#1.base|) 400000) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#values~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#values~0#1.base|) 1))) (<= 0 |ULTIMATE.start_main_~v~0#1|) .cse10 .cse11 .cse12 (<= 0 |ULTIMATE.start_elem_exists_#in~size#1|) (<= |ULTIMATE.start_elem_exists_#in~set#1.offset| 0) .cse13 .cse14) (and (= |ULTIMATE.start_elem_exists_~set#1.base| |ULTIMATE.start_elem_exists_#in~set#1.base|) (= |ULTIMATE.start_elem_exists_#in~value#1| |ULTIMATE.start_main_#t~mem12#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#values~0#1.base|) (+ |ULTIMATE.start_main_~#values~0#1.offset| (* |ULTIMATE.start_main_~v~0#1| 4))) |ULTIMATE.start_main_#t~mem12#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_elem_exists_#in~size#1|) (= |ULTIMATE.start_main_~#set~0#1.base| |ULTIMATE.start_elem_exists_#in~set#1.base|) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~v~0#1| 0) .cse8 .cse9 .cse10 (= |ULTIMATE.start_elem_exists_#in~value#1| |ULTIMATE.start_elem_exists_~value#1|) .cse11 .cse12 (= |ULTIMATE.start_elem_exists_#in~set#1.offset| |ULTIMATE.start_elem_exists_~set#1.offset|) .cse13 .cse14))) [2022-11-25 23:32:05,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2022-11-25 23:32:05,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 62) no Hoare annotation was computed. [2022-11-25 23:32:05,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-25 23:32:05,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-25 23:32:05,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 62) no Hoare annotation was computed. [2022-11-25 23:32:05,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-25 23:32:05,263 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-25 23:32:05,263 INFO L899 garLoopResultBuilder]: For program point L61-3(line 61) no Hoare annotation was computed. [2022-11-25 23:32:05,263 INFO L899 garLoopResultBuilder]: For program point L61-4(line 61) no Hoare annotation was computed. [2022-11-25 23:32:05,263 INFO L895 garLoopResultBuilder]: At program point L61-5(lines 61 65) the Hoare annotation is: (and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) [2022-11-25 23:32:05,263 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-25 23:32:05,263 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-25 23:32:05,264 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2022-11-25 23:32:05,264 INFO L899 garLoopResultBuilder]: For program point L62-1(line 62) no Hoare annotation was computed. [2022-11-25 23:32:05,264 INFO L899 garLoopResultBuilder]: For program point L62-5(line 62) no Hoare annotation was computed. [2022-11-25 23:32:05,264 INFO L899 garLoopResultBuilder]: For program point L62-6(line 62) no Hoare annotation was computed. [2022-11-25 23:32:05,264 INFO L895 garLoopResultBuilder]: At program point L62-7(lines 62 64) the Hoare annotation is: false [2022-11-25 23:32:05,264 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-25 23:32:05,265 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: false [2022-11-25 23:32:05,265 INFO L899 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2022-11-25 23:32:05,265 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-11-25 23:32:05,265 INFO L899 garLoopResultBuilder]: For program point L47-3(line 47) no Hoare annotation was computed. [2022-11-25 23:32:05,265 INFO L899 garLoopResultBuilder]: For program point L47-4(line 47) no Hoare annotation was computed. [2022-11-25 23:32:05,265 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-11-25 23:32:05,266 INFO L895 garLoopResultBuilder]: At program point L47-5(lines 47 50) the Hoare annotation is: (and (let ((.cse0 (= |ULTIMATE.start_main_~#values~0#1.offset| 0)) (.cse1 (<= 0 |ULTIMATE.start_main_~#set~0#1.base|)) (.cse2 (= |ULTIMATE.start_main_~#set~0#1.offset| 0)) (.cse3 (= |#NULL.offset| 0)) (.cse4 (<= 0 |#StackHeapBarrier|)) (.cse5 (= |#NULL.base| 0))) (or (and .cse0 .cse1 (<= 0 |ULTIMATE.start_main_~#values~0#1.base|) (<= 1 |ULTIMATE.start_main_~v~0#1|) .cse2 .cse3 (<= |ULTIMATE.start_main_~v~0#1| 2147483647) .cse4 .cse5) (and .cse0 (= (select |#length| |ULTIMATE.start_main_~#values~0#1.base|) 400000) .cse1 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#values~0#1.base|) .cse2 (= |ULTIMATE.start_main_~v~0#1| 0) .cse3 (= (select |#valid| |ULTIMATE.start_main_~#values~0#1.base|) 1) .cse4 .cse5))) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) [2022-11-25 23:32:05,266 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-11-25 23:32:05,266 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-11-25 23:32:05,266 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-25 23:32:05,266 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-11-25 23:32:05,266 INFO L899 garLoopResultBuilder]: For program point L33-3(line 33) no Hoare annotation was computed. [2022-11-25 23:32:05,267 INFO L899 garLoopResultBuilder]: For program point L33-4(line 33) no Hoare annotation was computed. [2022-11-25 23:32:05,267 INFO L895 garLoopResultBuilder]: At program point L33-5(lines 33 36) the Hoare annotation is: (and (let ((.cse0 (= |ULTIMATE.start_main_~#set~0#1.offset| 0)) (.cse1 (= |#NULL.offset| 0)) (.cse3 (= |#NULL.base| 0))) (or (let ((.cse2 (select |#memory_int| 1))) (and (= 48 (select |#length| 2)) (= (select |#valid| |ULTIMATE.start_main_~#set~0#1.base|) 1) (= 2 (select |#length| 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#set~0#1.base|) (= (select |#valid| 1) 1) (= (select |#length| |ULTIMATE.start_main_~#set~0#1.base|) 400000) .cse0 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) .cse1 (= (select .cse2 0) 48) (= |ULTIMATE.start_main_~x~0#1| 0) (= (select .cse2 1) 0) (< 0 |#StackHeapBarrier|) .cse3)) (and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~#set~0#1.base|) (<= 1 |ULTIMATE.start_main_~x~0#1|) .cse0 .cse1 (<= 0 |#StackHeapBarrier|) .cse3))) (= |ULTIMATE.start_main_~n~0#1| 0)) [2022-11-25 23:32:05,267 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-25 23:32:05,267 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-11-25 23:32:05,267 INFO L899 garLoopResultBuilder]: For program point L18(line 18) no Hoare annotation was computed. [2022-11-25 23:32:05,268 INFO L895 garLoopResultBuilder]: At program point L18-1(line 18) the Hoare annotation is: false [2022-11-25 23:32:05,268 INFO L899 garLoopResultBuilder]: For program point L51-3(line 51) no Hoare annotation was computed. [2022-11-25 23:32:05,268 INFO L899 garLoopResultBuilder]: For program point L51-4(line 51) no Hoare annotation was computed. [2022-11-25 23:32:05,268 INFO L895 garLoopResultBuilder]: At program point L51-5(lines 51 60) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#values~0#1.offset| 0)) (.cse1 (<= 0 |ULTIMATE.start_main_~#set~0#1.base|)) (.cse2 (<= 0 |ULTIMATE.start_main_~#values~0#1.base|)) (.cse3 (= |ULTIMATE.start_main_~#set~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse5 (= |#NULL.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse7 (<= 0 |#StackHeapBarrier|)) (.cse8 (= |#NULL.base| 0))) (or (and (<= |ULTIMATE.start_elem_exists_#in~size#1| 0) (<= 0 |ULTIMATE.start_elem_exists_#in~set#1.base|) (<= 0 |ULTIMATE.start_elem_exists_~set#1.base|) .cse0 .cse1 (= |ULTIMATE.start_elem_exists_~i~0#1| 0) .cse2 (<= |ULTIMATE.start_elem_exists_~size#1| 0) (= 0 |ULTIMATE.start_elem_exists_#res#1|) .cse3 .cse4 (<= 0 |ULTIMATE.start_elem_exists_~set#1.offset|) .cse5 (<= 0 |ULTIMATE.start_elem_exists_#in~set#1.offset|) (<= 0 |ULTIMATE.start_main_~v~0#1|) .cse6 (<= |ULTIMATE.start_main_~v~0#1| 2147483647) .cse7 (<= 0 |ULTIMATE.start_elem_exists_~size#1|) (<= 0 |ULTIMATE.start_elem_exists_#in~size#1|) (<= |ULTIMATE.start_elem_exists_#in~set#1.offset| 0) .cse8 (<= |ULTIMATE.start_elem_exists_~set#1.offset| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~v~0#1| 0) .cse5 .cse6 .cse7 .cse8))) [2022-11-25 23:32:05,268 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-25 23:32:05,269 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(line 13) the Hoare annotation is: true [2022-11-25 23:32:05,269 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(line 13) no Hoare annotation was computed. [2022-11-25 23:32:05,272 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:32:05,276 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:32:05,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:32:05 BoogieIcfgContainer [2022-11-25 23:32:05,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:32:05,337 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:32:05,337 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:32:05,338 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:32:05,338 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:31:45" (3/4) ... [2022-11-25 23:32:05,341 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 23:32:05,347 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-25 23:32:05,356 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2022-11-25 23:32:05,357 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-25 23:32:05,358 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 23:32:05,358 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:32:05,385 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((\old(size) <= 0 && 0 <= set) && 0 <= set) && values == 0) && 0 <= set) && i == 0) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && 0 <= set) && #NULL == 0) && 0 <= set) && 0 <= v) && x == 0) && v <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && 0 <= \old(size)) && set <= 0) && #NULL == 0) && set <= 0) || (((((((((values == 0 && 0 <= set) && 0 <= values) && set == 0) && n == 0) && v == 0) && #NULL == 0) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-25 23:32:05,387 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((set == set && \old(value) == aux-values[ v ]-aux) && unknown-#memory_int-unknown[values][values + v * 4] == aux-values[ v ]-aux) && values == 0) && 0 <= set) && i == 0) && n == \old(size)) && set == set) && 0 <= values) && size <= 0) && set == 0) && n == 0) && v == 0) && #NULL == 0) && 0 <= set) && x == 0) && \old(value) == value) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && set == set) && #NULL == 0) && set <= 0) || ((((((((((((((((((((((\old(size) <= 0 && v <= 100000) && 0 <= set) && 0 <= set) && values == 0) && 0 <= set) && i == 0) && 0 <= values) && size <= 0) && set == 0) && n == 0) && 0 <= set) && #NULL == 0) && 0 <= set) && (1 <= v || ((unknown-#length-unknown[values] == 400000 && unknown-#StackHeapBarrier-unknown < values) && \valid[values] == 1))) && 0 <= v) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && 0 <= \old(size)) && set <= 0) && #NULL == 0) && set <= 0) [2022-11-25 23:32:05,388 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((\old(size) <= 0 && v <= 100000) && 0 <= set) && 0 <= set) && values == 0) && 0 <= set) && i == 0) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && 0 <= set) && #NULL == 0) && 0 <= set) && (1 <= v || ((unknown-#length-unknown[values] == 400000 && unknown-#StackHeapBarrier-unknown < values) && \valid[values] == 1))) && 0 <= v) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && 0 <= \old(size)) && set <= 0) && #NULL == 0) && set <= 0) || ((((((((((((((((((((((set == set && \old(value) == aux-values[ v ]-aux) && unknown-#memory_int-unknown[values][values + v * 4] == aux-values[ v ]-aux) && values == 0) && 0 <= set) && i == 0) && n == \old(size)) && set == set) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && v == 0) && #NULL == 0) && 0 <= set) && x == 0) && \old(value) == value) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && set == set) && #NULL == 0) && set <= 0) [2022-11-25 23:32:05,389 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((set == set && values == 0) && 0 <= set) && unknown-#memory_int-unknown[values][values + v * 4] == \old(value)) && i == 0) && n == \old(size)) && set == set) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && v == 0) && #NULL == 0) && 0 <= set) && x == 0) && \old(value) == value) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && set == set) && #NULL == 0) && set <= 0) || (((((((((((((((((((((((\old(size) <= 0 && v <= 100000) && 0 <= set) && 0 <= set) && values == 0) && 0 <= set) && i == 0) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && 0 <= set) && #NULL == 0) && 0 <= set) && (1 <= v || ((unknown-#length-unknown[values] == 400000 && unknown-#StackHeapBarrier-unknown < values) && \valid[values] == 1))) && 0 <= v) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && 0 <= \old(size)) && set <= 0) && #NULL == 0) && set <= 0) [2022-11-25 23:32:05,421 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:32:05,421 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:32:05,423 INFO L158 Benchmark]: Toolchain (without parser) took 20727.76ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 135.3MB in the beginning and 185.2MB in the end (delta: -49.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2022-11-25 23:32:05,423 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 125.8MB. Free memory was 98.1MB in the beginning and 98.0MB in the end (delta: 70.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:32:05,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.58ms. Allocated memory is still 165.7MB. Free memory was 135.3MB in the beginning and 124.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 23:32:05,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.93ms. Allocated memory is still 165.7MB. Free memory was 124.2MB in the beginning and 122.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:32:05,424 INFO L158 Benchmark]: Boogie Preprocessor took 55.69ms. Allocated memory is still 165.7MB. Free memory was 122.1MB in the beginning and 120.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:32:05,424 INFO L158 Benchmark]: RCFGBuilder took 755.25ms. Allocated memory is still 165.7MB. Free memory was 120.0MB in the beginning and 119.8MB in the end (delta: 167.2kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 23:32:05,425 INFO L158 Benchmark]: TraceAbstraction took 19452.69ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 119.1MB in the beginning and 189.4MB in the end (delta: -70.3MB). Peak memory consumption was 129.2MB. Max. memory is 16.1GB. [2022-11-25 23:32:05,425 INFO L158 Benchmark]: Witness Printer took 83.90ms. Allocated memory is still 239.1MB. Free memory was 189.4MB in the beginning and 185.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 23:32:05,431 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.25ms. Allocated memory is still 125.8MB. Free memory was 98.1MB in the beginning and 98.0MB in the end (delta: 70.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.58ms. Allocated memory is still 165.7MB. Free memory was 135.3MB in the beginning and 124.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.93ms. Allocated memory is still 165.7MB. Free memory was 124.2MB in the beginning and 122.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.69ms. Allocated memory is still 165.7MB. Free memory was 122.1MB in the beginning and 120.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 755.25ms. Allocated memory is still 165.7MB. Free memory was 120.0MB in the beginning and 119.8MB in the end (delta: 167.2kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19452.69ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 119.1MB in the beginning and 189.4MB in the end (delta: -70.3MB). Peak memory consumption was 129.2MB. Max. memory is 16.1GB. * Witness Printer took 83.90ms. Allocated memory is still 239.1MB. Free memory was 189.4MB in the beginning and 185.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: 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 2 procedures, 80 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 19.3s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 454 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 447 mSDsluCounter, 1662 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1152 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1447 IncrementalHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 510 mSDtfsCounter, 1447 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 167 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=4, InterpolantAutomatonStates: 94, 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, 10 MinimizatonAttempts, 249 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 29 PreInvPairs, 42 NumberOfFragments, 797 HoareAnnotationTreeSize, 29 FomulaSimplifications, 102 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 1868 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 401 SizeOfPredicates, 5 NumberOfNonLiveVariables, 610 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 29/44 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: 4.3s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 5, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 78, DAG_INTERPRETER_EARLY_EXITS: 3, TOOLS_POST_APPLICATIONS: 191, TOOLS_POST_TIME: 3.6s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 191, TOOLS_QUANTIFIERELIM_TIME: 3.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 336, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 27, DOMAIN_JOIN_TIME: 0.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 22, DOMAIN_WIDEN_TIME: 0.3s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 33, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 78, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 11, LOOP_SUMMARIZER_CACHE_MISSES: 11, LOOP_SUMMARIZER_OVERALL_TIME: 3.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 3.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 33, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 2258, DAG_COMPRESSION_RETAINED_NODES: 233, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((values == 0 && 0 <= set) && 0 <= values) && 1 <= v) && set == 0) && #NULL == 0) && v <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((values == 0 && unknown-#length-unknown[values] == 400000) && 0 <= set) && unknown-#StackHeapBarrier-unknown < values) && set == 0) && v == 0) && #NULL == 0) && \valid[values] == 1) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) && n == 0) && x == 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((((((((((((((((((((set == set && \old(value) == aux-values[ v ]-aux) && unknown-#memory_int-unknown[values][values + v * 4] == aux-values[ v ]-aux) && values == 0) && 0 <= set) && i == 0) && n == \old(size)) && set == set) && 0 <= values) && size <= 0) && set == 0) && n == 0) && v == 0) && #NULL == 0) && 0 <= set) && x == 0) && \old(value) == value) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && set == set) && #NULL == 0) && set <= 0) || ((((((((((((((((((((((\old(size) <= 0 && v <= 100000) && 0 <= set) && 0 <= set) && values == 0) && 0 <= set) && i == 0) && 0 <= values) && size <= 0) && set == 0) && n == 0) && 0 <= set) && #NULL == 0) && 0 <= set) && (1 <= v || ((unknown-#length-unknown[values] == 400000 && unknown-#StackHeapBarrier-unknown < values) && \valid[values] == 1))) && 0 <= v) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && 0 <= \old(size)) && set <= 0) && #NULL == 0) && set <= 0) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\old(size) <= 0 && 0 <= set) && 0 <= set) && values == 0) && 0 <= set) && i == 0) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && 0 <= set) && #NULL == 0) && 0 <= set) && 0 <= v) && x == 0) && v <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && 0 <= \old(size)) && set <= 0) && #NULL == 0) && set <= 0) || (((((((((values == 0 && 0 <= set) && 0 <= values) && set == 0) && n == 0) && v == 0) && #NULL == 0) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((0 <= set && set == 0) && n == 0) && #NULL == 0) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((((((((48 == unknown-#length-unknown[2] && \valid[set] == 1) && 2 == unknown-#length-unknown[1]) && unknown-#StackHeapBarrier-unknown < set) && \valid[1] == 1) && unknown-#length-unknown[set] == 400000) && set == 0) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && x == 0) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((x <= 2147483647 && 0 <= set) && 1 <= x) && set == 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) && n == 0 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((\old(size) <= 0 && v <= 100000) && 0 <= set) && 0 <= set) && values == 0) && 0 <= set) && i == 0) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && 0 <= set) && #NULL == 0) && 0 <= set) && (1 <= v || ((unknown-#length-unknown[values] == 400000 && unknown-#StackHeapBarrier-unknown < values) && \valid[values] == 1))) && 0 <= v) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && 0 <= \old(size)) && set <= 0) && #NULL == 0) && set <= 0) || ((((((((((((((((((((((set == set && \old(value) == aux-values[ v ]-aux) && unknown-#memory_int-unknown[values][values + v * 4] == aux-values[ v ]-aux) && values == 0) && 0 <= set) && i == 0) && n == \old(size)) && set == set) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && v == 0) && #NULL == 0) && 0 <= set) && x == 0) && \old(value) == value) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && set == set) && #NULL == 0) && set <= 0) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((((((((((((((((((((set == set && values == 0) && 0 <= set) && unknown-#memory_int-unknown[values][values + v * 4] == \old(value)) && i == 0) && n == \old(size)) && set == set) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && v == 0) && #NULL == 0) && 0 <= set) && x == 0) && \old(value) == value) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && set == set) && #NULL == 0) && set <= 0) || (((((((((((((((((((((((\old(size) <= 0 && v <= 100000) && 0 <= set) && 0 <= set) && values == 0) && 0 <= set) && i == 0) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && 0 <= set) && #NULL == 0) && 0 <= set) && (1 <= v || ((unknown-#length-unknown[values] == 400000 && unknown-#StackHeapBarrier-unknown < values) && \valid[values] == 1))) && 0 <= v) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && 0 <= \old(size)) && set <= 0) && #NULL == 0) && set <= 0) - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: n == 0 && x == 0 RESULT: Ultimate proved your program to be correct! [2022-11-25 23:32:05,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b96d3c72-f0c3-49d3-9f80-bcf8b4b6ffba/bin/utaipan-ByfvJB40ur/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