./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 06:52:31,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 06:52:31,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 06:52:31,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 06:52:31,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 06:52:31,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 06:52:31,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 06:52:31,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 06:52:31,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 06:52:31,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 06:52:31,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 06:52:31,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 06:52:31,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 06:52:31,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 06:52:31,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 06:52:31,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 06:52:31,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 06:52:31,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 06:52:31,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 06:52:31,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 06:52:31,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 06:52:31,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 06:52:31,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 06:52:31,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 06:52:31,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 06:52:31,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 06:52:31,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 06:52:31,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 06:52:31,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 06:52:31,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 06:52:31,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 06:52:31,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 06:52:31,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 06:52:31,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 06:52:31,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 06:52:31,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 06:52:31,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 06:52:31,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 06:52:31,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 06:52:31,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 06:52:31,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 06:52:31,883 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-19 06:52:31,930 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 06:52:31,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 06:52:31,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 06:52:31,931 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 06:52:31,932 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 06:52:31,933 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 06:52:31,933 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 06:52:31,933 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 06:52:31,933 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 06:52:31,934 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 06:52:31,935 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 06:52:31,935 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 06:52:31,935 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 06:52:31,936 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 06:52:31,936 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 06:52:31,936 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 06:52:31,936 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 06:52:31,936 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 06:52:31,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 06:52:31,938 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 06:52:31,938 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 06:52:31,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 06:52:31,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 06:52:31,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 06:52:31,939 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 06:52:31,939 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 06:52:31,939 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 06:52:31,940 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-19 06:52:31,940 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 06:52:31,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 06:52:31,940 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 06:52:31,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 06:52:31,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 06:52:31,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 06:52:31,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:52:31,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 06:52:31,942 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 06:52:31,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 06:52:31,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 06:52:31,943 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 06:52:31,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 06:52:31,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 06:52:31,943 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 06:52:31,943 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_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a [2022-11-19 06:52:32,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 06:52:32,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 06:52:32,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 06:52:32,286 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 06:52:32,287 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 06:52:32,288 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2022-11-19 06:52:32,376 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/data/6e61efed1/73760296c48a4e88a3f741f9eef606ca/FLAG27c9dddee [2022-11-19 06:52:32,994 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 06:52:32,994 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/sv-benchmarks/c/list-simple/sll2n_update_all.i [2022-11-19 06:52:33,006 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/data/6e61efed1/73760296c48a4e88a3f741f9eef606ca/FLAG27c9dddee [2022-11-19 06:52:33,309 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/data/6e61efed1/73760296c48a4e88a3f741f9eef606ca [2022-11-19 06:52:33,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 06:52:33,315 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 06:52:33,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 06:52:33,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 06:52:33,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 06:52:33,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:52:33" (1/1) ... [2022-11-19 06:52:33,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52457e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:33, skipping insertion in model container [2022-11-19 06:52:33,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:52:33" (1/1) ... [2022-11-19 06:52:33,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 06:52:33,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 06:52:33,734 WARN L234 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_59977101-502c-419d-a412-3b0dc35c4e12/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2022-11-19 06:52:33,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:52:33,743 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 06:52:33,785 WARN L234 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_59977101-502c-419d-a412-3b0dc35c4e12/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2022-11-19 06:52:33,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:52:33,811 INFO L208 MainTranslator]: Completed translation [2022-11-19 06:52:33,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:33 WrapperNode [2022-11-19 06:52:33,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 06:52:33,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 06:52:33,813 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 06:52:33,813 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 06:52:33,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:33" (1/1) ... [2022-11-19 06:52:33,835 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:33" (1/1) ... [2022-11-19 06:52:33,859 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2022-11-19 06:52:33,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 06:52:33,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 06:52:33,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 06:52:33,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 06:52:33,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:33" (1/1) ... [2022-11-19 06:52:33,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:33" (1/1) ... [2022-11-19 06:52:33,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:33" (1/1) ... [2022-11-19 06:52:33,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:33" (1/1) ... [2022-11-19 06:52:33,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:33" (1/1) ... [2022-11-19 06:52:33,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:33" (1/1) ... [2022-11-19 06:52:33,886 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:33" (1/1) ... [2022-11-19 06:52:33,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:33" (1/1) ... [2022-11-19 06:52:33,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 06:52:33,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 06:52:33,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 06:52:33,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 06:52:33,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:33" (1/1) ... [2022-11-19 06:52:33,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:52:33,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:52:33,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 06:52:33,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 06:52:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 06:52:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 06:52:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 06:52:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 06:52:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 06:52:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 06:52:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 06:52:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 06:52:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 06:52:33,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 06:52:34,127 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 06:52:34,129 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 06:52:34,445 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 06:52:34,583 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 06:52:34,584 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-19 06:52:34,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:52:34 BoogieIcfgContainer [2022-11-19 06:52:34,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 06:52:34,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 06:52:34,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 06:52:34,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 06:52:34,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:52:33" (1/3) ... [2022-11-19 06:52:34,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5111bb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:52:34, skipping insertion in model container [2022-11-19 06:52:34,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:33" (2/3) ... [2022-11-19 06:52:34,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5111bb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:52:34, skipping insertion in model container [2022-11-19 06:52:34,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:52:34" (3/3) ... [2022-11-19 06:52:34,596 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2022-11-19 06:52:34,617 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 06:52:34,617 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-19 06:52:34,671 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 06:52:34,678 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;@df96d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 06:52:34,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-19 06:52:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.88) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:34,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-19 06:52:34,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:52:34,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-19 06:52:34,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 06:52:34,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:52:34,698 INFO L85 PathProgramCache]: Analyzing trace with hash 5391530, now seen corresponding path program 1 times [2022-11-19 06:52:34,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:52:34,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142283806] [2022-11-19 06:52:34,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:52:34,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:52:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:52:34,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:52:34,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:52:34,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142283806] [2022-11-19 06:52:34,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142283806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:52:34,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:52:34,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:52:35,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548966005] [2022-11-19 06:52:35,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:52:35,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:52:35,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:52:35,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:52:35,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:52:35,056 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.88) internal successors, (47), 39 states have internal predecessors, (47), 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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-19 06:52:35,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:52:35,166 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2022-11-19 06:52:35,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:52:35,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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-19 06:52:35,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:52:35,183 INFO L225 Difference]: With dead ends: 79 [2022-11-19 06:52:35,183 INFO L226 Difference]: Without dead ends: 42 [2022-11-19 06:52:35,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:52:35,196 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:52:35,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 69 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:52:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-19 06:52:35,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-11-19 06:52:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:35,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-11-19 06:52:35,240 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 4 [2022-11-19 06:52:35,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:52:35,240 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-11-19 06:52:35,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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-19 06:52:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-11-19 06:52:35,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-19 06:52:35,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:52:35,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-19 06:52:35,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 06:52:35,242 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 06:52:35,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:52:35,243 INFO L85 PathProgramCache]: Analyzing trace with hash 5257468, now seen corresponding path program 1 times [2022-11-19 06:52:35,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:52:35,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284829940] [2022-11-19 06:52:35,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:52:35,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:52:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:52:35,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:52:35,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:52:35,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284829940] [2022-11-19 06:52:35,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284829940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:52:35,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:52:35,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:52:35,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505040540] [2022-11-19 06:52:35,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:52:35,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:52:35,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:52:35,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:52:35,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:52:35,457 INFO L87 Difference]: Start difference. First operand 37 states and 41 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-19 06:52:35,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:52:35,539 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-11-19 06:52:35,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:52:35,557 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-19 06:52:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:52:35,559 INFO L225 Difference]: With dead ends: 42 [2022-11-19 06:52:35,562 INFO L226 Difference]: Without dead ends: 41 [2022-11-19 06:52:35,562 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-19 06:52:35,564 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:52:35,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 88 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:52:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-19 06:52:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-11-19 06:52:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.72) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-19 06:52:35,573 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 4 [2022-11-19 06:52:35,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:52:35,581 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-19 06:52:35,581 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-19 06:52:35,581 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-19 06:52:35,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 06:52:35,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:52:35,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 06:52:35,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 06:52:35,583 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 06:52:35,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:52:35,586 INFO L85 PathProgramCache]: Analyzing trace with hash 162981564, now seen corresponding path program 1 times [2022-11-19 06:52:35,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:52:35,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714123776] [2022-11-19 06:52:35,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:52:35,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:52:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:52:35,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:52:35,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:52:35,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714123776] [2022-11-19 06:52:35,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714123776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:52:35,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:52:35,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:52:35,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155066298] [2022-11-19 06:52:35,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:52:35,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:52:35,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:52:35,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:52:35,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:52:35,710 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:35,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:52:35,760 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-11-19 06:52:35,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:52:35,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-11-19 06:52:35,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:52:35,764 INFO L225 Difference]: With dead ends: 41 [2022-11-19 06:52:35,764 INFO L226 Difference]: Without dead ends: 40 [2022-11-19 06:52:35,766 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-19 06:52:35,770 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:52:35,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:52:35,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-19 06:52:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-19 06:52:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-11-19 06:52:35,776 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 5 [2022-11-19 06:52:35,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:52:35,776 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-11-19 06:52:35,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:35,786 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-11-19 06:52:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-19 06:52:35,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:52:35,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:52:35,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 06:52:35,787 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 06:52:35,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:52:35,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2070906749, now seen corresponding path program 1 times [2022-11-19 06:52:35,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:52:35,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650596149] [2022-11-19 06:52:35,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:52:35,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:52:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:52:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:52:35,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:52:35,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650596149] [2022-11-19 06:52:35,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650596149] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:52:35,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104063857] [2022-11-19 06:52:35,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:52:35,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:52:35,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:52:35,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:52:35,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 06:52:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:52:36,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 06:52:36,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:52:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:52:36,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:52:36,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:52:36,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104063857] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:52:36,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1729980605] [2022-11-19 06:52:36,288 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-19 06:52:36,289 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:52:36,292 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:52:36,298 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:52:36,300 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:52:36,458 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-19 06:52:36,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-19 06:52:36,525 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:52:36,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-19 06:52:36,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:36,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-19 06:52:36,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:36,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-19 06:52:36,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:36,668 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:36,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 06:52:36,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:36,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:36,715 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:36,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-19 06:52:36,891 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 06:52:36,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 06:52:36,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-19 06:52:37,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:37,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:37,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:37,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-19 06:52:37,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:37,137 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:37,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 06:52:37,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:37,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-19 06:52:37,193 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:37,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-19 06:52:37,692 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-19 06:52:37,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 401 treesize of output 406 [2022-11-19 06:52:37,839 INFO L321 Elim1Store]: treesize reduction 196, result has 10.5 percent of original size [2022-11-19 06:52:37,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 406 [2022-11-19 06:52:37,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:37,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:37,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:37,971 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:37,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2022-11-19 06:52:38,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:38,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:38,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 06:52:38,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:38,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-19 06:52:38,058 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:38,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-19 06:52:38,612 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-19 06:52:38,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-19 06:52:38,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-19 06:52:38,746 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:52:40,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1729980605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:52:40,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:52:40,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4, 4] total 11 [2022-11-19 06:52:40,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473782293] [2022-11-19 06:52:40,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:52:40,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:52:40,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:52:40,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:52:40,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-19 06:52:40,867 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-19 06:52:41,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:52:41,104 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-11-19 06:52:41,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:52:41,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-19 06:52:41,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:52:41,105 INFO L225 Difference]: With dead ends: 69 [2022-11-19 06:52:41,106 INFO L226 Difference]: Without dead ends: 50 [2022-11-19 06:52:41,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-19 06:52:41,107 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 59 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:52:41,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 66 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:52:41,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-19 06:52:41,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2022-11-19 06:52:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-11-19 06:52:41,117 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 8 [2022-11-19 06:52:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:52:41,118 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-11-19 06:52:41,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-19 06:52:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-11-19 06:52:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 06:52:41,119 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:52:41,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:52:41,125 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-19 06:52:41,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:52:41,325 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 06:52:41,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:52:41,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1472796847, now seen corresponding path program 1 times [2022-11-19 06:52:41,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:52:41,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265545046] [2022-11-19 06:52:41,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:52:41,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:52:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:52:41,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 06:52:41,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:52:41,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265545046] [2022-11-19 06:52:41,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265545046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:52:41,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:52:41,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:52:41,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345918224] [2022-11-19 06:52:41,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:52:41,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:52:41,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:52:41,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:52:41,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:52:41,424 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:41,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:52:41,512 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2022-11-19 06:52:41,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:52:41,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-19 06:52:41,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:52:41,515 INFO L225 Difference]: With dead ends: 62 [2022-11-19 06:52:41,515 INFO L226 Difference]: Without dead ends: 60 [2022-11-19 06:52:41,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:52:41,517 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:52:41,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 59 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:52:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-19 06:52:41,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2022-11-19 06:52:41,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-11-19 06:52:41,540 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 11 [2022-11-19 06:52:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:52:41,541 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-11-19 06:52:41,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:41,541 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-11-19 06:52:41,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 06:52:41,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:52:41,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:52:41,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 06:52:41,543 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 06:52:41,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:52:41,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1472793487, now seen corresponding path program 1 times [2022-11-19 06:52:41,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:52:41,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705319451] [2022-11-19 06:52:41,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:52:41,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:52:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:52:41,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 06:52:41,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:52:41,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705319451] [2022-11-19 06:52:41,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705319451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:52:41,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:52:41,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:52:41,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347275453] [2022-11-19 06:52:41,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:52:41,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:52:41,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:52:41,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:52:41,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:52:41,647 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:52:41,748 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2022-11-19 06:52:41,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:52:41,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-19 06:52:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:52:41,751 INFO L225 Difference]: With dead ends: 125 [2022-11-19 06:52:41,751 INFO L226 Difference]: Without dead ends: 91 [2022-11-19 06:52:41,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:52:41,754 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 73 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:52:41,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 66 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:52:41,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-19 06:52:41,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 41. [2022-11-19 06:52:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-11-19 06:52:41,776 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2022-11-19 06:52:41,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:52:41,776 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-11-19 06:52:41,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:41,776 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-11-19 06:52:41,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 06:52:41,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:52:41,777 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:52:41,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 06:52:41,778 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 06:52:41,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:52:41,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1294929578, now seen corresponding path program 1 times [2022-11-19 06:52:41,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:52:41,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623592237] [2022-11-19 06:52:41,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:52:41,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:52:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:52:41,896 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-19 06:52:41,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:52:41,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623592237] [2022-11-19 06:52:41,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623592237] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:52:41,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21708878] [2022-11-19 06:52:41,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:52:41,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:52:41,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:52:41,898 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:52:41,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 06:52:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:52:42,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 06:52:42,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:52:42,028 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-19 06:52:42,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:52:42,050 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-19 06:52:42,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21708878] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:52:42,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1148430200] [2022-11-19 06:52:42,053 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-19 06:52:42,054 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:52:42,054 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:52:42,054 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:52:42,054 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:52:42,109 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:52:42,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-19 06:52:42,124 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-19 06:52:42,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:42,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:42,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:42,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-19 06:52:42,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:42,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:42,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 06:52:42,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:42,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:42,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 06:52:42,315 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 06:52:42,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 06:52:42,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-19 06:52:42,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:42,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:42,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:42,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-19 06:52:42,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:42,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:42,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 06:52:42,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:42,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-19 06:52:42,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:42,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-19 06:52:42,899 INFO L321 Elim1Store]: treesize reduction 180, result has 17.8 percent of original size [2022-11-19 06:52:42,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 422 [2022-11-19 06:52:42,952 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-11-19 06:52:42,953 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 6 case distinctions, treesize of input 401 treesize of output 406 [2022-11-19 06:52:43,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:43,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:43,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:43,423 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-19 06:52:43,423 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 414 treesize of output 379 [2022-11-19 06:52:43,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:43,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:43,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:43,505 INFO L321 Elim1Store]: treesize reduction 86, result has 19.6 percent of original size [2022-11-19 06:52:43,506 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 7 case distinctions, treesize of input 430 treesize of output 386 [2022-11-19 06:52:43,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:43,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:43,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:43,580 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-19 06:52:43,581 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 415 treesize of output 353 [2022-11-19 06:52:43,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:43,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:43,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:43,659 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-19 06:52:43,660 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 3 case distinctions, treesize of input 415 treesize of output 404 [2022-11-19 06:52:43,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:43,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:43,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:43,718 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-19 06:52:43,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 417 treesize of output 356 [2022-11-19 06:52:43,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:43,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:43,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:43,782 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-19 06:52:43,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 429 treesize of output 419 [2022-11-19 06:52:44,199 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 1 [2022-11-19 06:52:44,215 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 1 [2022-11-19 06:52:44,225 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 11 treesize of output 7 [2022-11-19 06:52:44,311 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 1 [2022-11-19 06:52:44,321 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 1 [2022-11-19 06:52:44,328 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 11 treesize of output 7 [2022-11-19 06:52:44,398 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 1 [2022-11-19 06:52:44,406 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 11 treesize of output 7 [2022-11-19 06:52:44,416 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 1 [2022-11-19 06:52:44,646 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-19 06:52:44,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 401 treesize of output 406 [2022-11-19 06:52:44,747 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-19 06:52:44,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-19 06:52:45,067 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:52:46,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1148430200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:52:46,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:52:46,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 4, 4] total 14 [2022-11-19 06:52:46,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105279205] [2022-11-19 06:52:46,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:52:46,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-19 06:52:46,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:52:46,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-19 06:52:46,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-11-19 06:52:46,925 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:47,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:52:47,993 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-11-19 06:52:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 06:52:47,994 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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-19 06:52:47,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:52:47,994 INFO L225 Difference]: With dead ends: 75 [2022-11-19 06:52:47,995 INFO L226 Difference]: Without dead ends: 69 [2022-11-19 06:52:47,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2022-11-19 06:52:47,996 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 140 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:52:47,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 94 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:52:47,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-19 06:52:48,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2022-11-19 06:52:48,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.5) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:48,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-11-19 06:52:48,028 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 14 [2022-11-19 06:52:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:52:48,028 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-11-19 06:52:48,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-11-19 06:52:48,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 06:52:48,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:52:48,030 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:52:48,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 06:52:48,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:52:48,236 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 06:52:48,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:52:48,236 INFO L85 PathProgramCache]: Analyzing trace with hash 149268246, now seen corresponding path program 1 times [2022-11-19 06:52:48,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:52:48,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680136040] [2022-11-19 06:52:48,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:52:48,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:52:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:52:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 06:52:48,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:52:48,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680136040] [2022-11-19 06:52:48,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680136040] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:52:48,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727747045] [2022-11-19 06:52:48,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:52:48,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:52:48,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:52:48,352 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:52:48,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 06:52:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:52:48,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 06:52:48,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:52:48,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 06:52:48,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:52:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 06:52:48,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727747045] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:52:48,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1829545373] [2022-11-19 06:52:48,529 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-19 06:52:48,529 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:52:48,530 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:52:48,530 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:52:48,530 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:52:48,601 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:52:48,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-19 06:52:48,623 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-19 06:52:48,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:48,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:48,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:48,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-19 06:52:48,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:48,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:48,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 06:52:48,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:48,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-19 06:52:48,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:48,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-19 06:52:48,800 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-19 06:52:48,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-19 06:52:48,861 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 06:52:48,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 06:52:48,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:48,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:48,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:48,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-19 06:52:48,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:48,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:48,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 06:52:48,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:48,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-19 06:52:49,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:49,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-19 06:52:49,401 INFO L321 Elim1Store]: treesize reduction 180, result has 17.8 percent of original size [2022-11-19 06:52:49,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 422 [2022-11-19 06:52:49,452 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-11-19 06:52:49,453 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 6 case distinctions, treesize of input 401 treesize of output 406 [2022-11-19 06:52:49,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:49,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:49,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:49,861 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-19 06:52:49,861 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 415 treesize of output 353 [2022-11-19 06:52:49,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:49,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:49,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:49,937 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-19 06:52:49,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 417 treesize of output 356 [2022-11-19 06:52:49,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:50,000 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-19 06:52:50,001 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 426 treesize of output 391 [2022-11-19 06:52:50,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:50,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:50,075 INFO L321 Elim1Store]: treesize reduction 86, result has 19.6 percent of original size [2022-11-19 06:52:50,075 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 7 case distinctions, treesize of input 442 treesize of output 398 [2022-11-19 06:52:50,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:50,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:50,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:50,138 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-19 06:52:50,139 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 3 case distinctions, treesize of input 427 treesize of output 416 [2022-11-19 06:52:50,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:50,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:50,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:50,190 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-19 06:52:50,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 429 treesize of output 419 [2022-11-19 06:52:50,542 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 11 treesize of output 7 [2022-11-19 06:52:50,553 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 1 [2022-11-19 06:52:50,563 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 1 [2022-11-19 06:52:50,678 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 1 [2022-11-19 06:52:50,687 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 1 [2022-11-19 06:52:50,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2022-11-19 06:52:50,921 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-19 06:52:50,929 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-19 06:52:50,935 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:52:52,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1829545373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:52:52,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:52:52,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4, 4] total 13 [2022-11-19 06:52:52,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880102775] [2022-11-19 06:52:52,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:52:52,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 06:52:52,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:52:52,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 06:52:52,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-19 06:52:52,855 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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-19 06:52:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:52:53,030 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-11-19 06:52:53,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 06:52:53,031 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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 17 [2022-11-19 06:52:53,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:52:53,032 INFO L225 Difference]: With dead ends: 65 [2022-11-19 06:52:53,032 INFO L226 Difference]: Without dead ends: 46 [2022-11-19 06:52:53,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-19 06:52:53,033 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:52:53,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 79 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 8 Unchecked, 0.2s Time] [2022-11-19 06:52:53,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-19 06:52:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-19 06:52:53,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.5) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-11-19 06:52:53,045 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 17 [2022-11-19 06:52:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:52:53,045 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-11-19 06:52:53,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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-19 06:52:53,045 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-11-19 06:52:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 06:52:53,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:52:53,046 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:52:53,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-19 06:52:53,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-19 06:52:53,252 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 06:52:53,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:52:53,253 INFO L85 PathProgramCache]: Analyzing trace with hash 332348417, now seen corresponding path program 1 times [2022-11-19 06:52:53,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:52:53,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274074412] [2022-11-19 06:52:53,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:52:53,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:52:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:52:53,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-19 06:52:53,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:52:53,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274074412] [2022-11-19 06:52:53,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274074412] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:52:53,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:52:53,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:52:53,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556706175] [2022-11-19 06:52:53,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:52:53,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:52:53,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:52:53,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:52:53,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:52:53,328 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-19 06:52:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:52:53,357 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-11-19 06:52:53,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:52:53,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-11-19 06:52:53,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:52:53,358 INFO L225 Difference]: With dead ends: 46 [2022-11-19 06:52:53,358 INFO L226 Difference]: Without dead ends: 45 [2022-11-19 06:52:53,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:52:53,361 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:52:53,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:52:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-19 06:52:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-19 06:52:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-11-19 06:52:53,376 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 18 [2022-11-19 06:52:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:52:53,377 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-11-19 06:52:53,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-11-19 06:52:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 06:52:53,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:52:53,379 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:52:53,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 06:52:53,379 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 06:52:53,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:52:53,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1559254851, now seen corresponding path program 1 times [2022-11-19 06:52:53,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:52:53,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669511241] [2022-11-19 06:52:53,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:52:53,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:52:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:52:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-19 06:52:53,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:52:53,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669511241] [2022-11-19 06:52:53,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669511241] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:52:53,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406799108] [2022-11-19 06:52:53,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:52:53,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:52:53,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:52:53,493 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:52:53,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 06:52:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:52:53,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 06:52:53,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:52:53,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-19 06:52:53,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:52:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-19 06:52:53,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406799108] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:52:53,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [530069416] [2022-11-19 06:52:53,645 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-19 06:52:53,645 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:52:53,646 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:52:53,646 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:52:53,646 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:52:53,693 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-19 06:52:53,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-19 06:52:53,736 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:52:53,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-19 06:52:53,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:53,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-19 06:52:53,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:53,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-19 06:52:53,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:53,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:53,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 06:52:53,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:53,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:53,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:53,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-19 06:52:53,890 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-19 06:52:53,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-19 06:52:53,951 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 06:52:53,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 06:52:54,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:54,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:54,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:54,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-19 06:52:54,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:54,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:54,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 06:52:54,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:54,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-19 06:52:54,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:54,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-19 06:52:54,381 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-19 06:52:54,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-19 06:52:54,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-19 06:52:54,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:54,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:54,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:54,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2022-11-19 06:52:54,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:54,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:54,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 06:52:54,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:54,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:54,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-19 06:52:54,893 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 11 treesize of output 7 [2022-11-19 06:52:54,905 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 1 [2022-11-19 06:52:54,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 1 [2022-11-19 06:52:55,098 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 1 [2022-11-19 06:52:55,106 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 1 [2022-11-19 06:52:55,113 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 11 treesize of output 7 [2022-11-19 06:52:55,288 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 11 treesize of output 7 [2022-11-19 06:52:55,299 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 1 [2022-11-19 06:52:55,308 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 1 [2022-11-19 06:52:55,719 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-19 06:52:55,734 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-19 06:52:55,738 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:52:58,255 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1666#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= 0 |ULTIMATE.start_sll_update_at_#in~index#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_sll_update_at_~data#1|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_update_at_~index#1| 0) (< 2147483646 |ULTIMATE.start_main_#t~post13#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_update_at_~index#1|) (<= 2 |ULTIMATE.start_sll_update_at_#in~data#1|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 2 |ULTIMATE.start_main_~new_data~0#1|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-19 06:52:58,255 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:52:58,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:52:58,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-19 06:52:58,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187243030] [2022-11-19 06:52:58,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:52:58,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:52:58,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:52:58,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:52:58,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-11-19 06:52:58,258 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:58,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:52:58,322 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2022-11-19 06:52:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:52:58,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 20 [2022-11-19 06:52:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:52:58,324 INFO L225 Difference]: With dead ends: 88 [2022-11-19 06:52:58,324 INFO L226 Difference]: Without dead ends: 49 [2022-11-19 06:52:58,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-11-19 06:52:58,325 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:52:58,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 137 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:52:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-19 06:52:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-19 06:52:58,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-11-19 06:52:58,337 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 20 [2022-11-19 06:52:58,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:52:58,337 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-11-19 06:52:58,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:52:58,337 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-11-19 06:52:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 06:52:58,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:52:58,338 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:52:58,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 06:52:58,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:52:58,544 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 06:52:58,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:52:58,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1162581014, now seen corresponding path program 2 times [2022-11-19 06:52:58,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:52:58,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095993405] [2022-11-19 06:52:58,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:52:58,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:52:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:52:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 06:52:58,774 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:52:58,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095993405] [2022-11-19 06:52:58,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095993405] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:52:58,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541354352] [2022-11-19 06:52:58,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 06:52:58,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:52:58,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:52:58,776 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:52:58,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 06:52:58,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 06:52:58,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:52:58,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:52:58,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:52:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 06:52:58,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:52:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 06:52:59,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541354352] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:52:59,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [397063179] [2022-11-19 06:52:59,013 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-19 06:52:59,013 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:52:59,013 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:52:59,013 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:52:59,014 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:52:59,065 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-19 06:52:59,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-19 06:52:59,106 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:52:59,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-19 06:52:59,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:59,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:59,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 06:52:59,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:59,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:59,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:59,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-19 06:52:59,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:59,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:59,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 06:52:59,263 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-19 06:52:59,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-19 06:52:59,322 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 06:52:59,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 06:52:59,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:59,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:59,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:59,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-19 06:52:59,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:59,430 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:59,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 06:52:59,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:59,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-19 06:52:59,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:59,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-19 06:52:59,811 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-19 06:52:59,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 401 treesize of output 406 [2022-11-19 06:52:59,898 INFO L321 Elim1Store]: treesize reduction 196, result has 10.5 percent of original size [2022-11-19 06:52:59,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 406 [2022-11-19 06:52:59,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:59,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:59,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:52:59,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:52:59,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2022-11-19 06:53:00,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:00,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:00,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 06:53:00,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:00,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-19 06:53:00,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:00,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-19 06:53:00,346 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 11 treesize of output 7 [2022-11-19 06:53:00,358 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 1 [2022-11-19 06:53:00,376 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 1 [2022-11-19 06:53:00,549 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 1 [2022-11-19 06:53:00,567 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 11 treesize of output 7 [2022-11-19 06:53:00,577 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 1 [2022-11-19 06:53:00,759 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 06:53:00,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 141 [2022-11-19 06:53:00,798 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 06:53:00,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 135 [2022-11-19 06:53:00,867 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 11 treesize of output 7 [2022-11-19 06:53:01,068 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-19 06:53:01,080 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-19 06:53:01,084 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:53:03,240 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2001#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= 0 |ULTIMATE.start_sll_update_at_#in~index#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_sll_update_at_~data#1|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_update_at_~index#1| 0) (< 2147483646 |ULTIMATE.start_main_#t~post13#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_update_at_~index#1|) (<= 2 |ULTIMATE.start_sll_update_at_#in~data#1|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 2 |ULTIMATE.start_main_~new_data~0#1|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-19 06:53:03,240 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:53:03,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:53:03,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2022-11-19 06:53:03,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150044150] [2022-11-19 06:53:03,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:53:03,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-19 06:53:03,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:03,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-19 06:53:03,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-11-19 06:53:03,242 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:53:03,472 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-11-19 06:53:03,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 06:53:03,472 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 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 24 [2022-11-19 06:53:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:53:03,473 INFO L225 Difference]: With dead ends: 73 [2022-11-19 06:53:03,473 INFO L226 Difference]: Without dead ends: 70 [2022-11-19 06:53:03,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2022-11-19 06:53:03,474 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 148 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:53:03,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 60 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:53:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-19 06:53:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 46. [2022-11-19 06:53:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-11-19 06:53:03,485 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 24 [2022-11-19 06:53:03,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:53:03,486 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-11-19 06:53:03,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:03,486 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-11-19 06:53:03,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 06:53:03,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:53:03,487 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:53:03,493 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-19 06:53:03,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:03,694 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 06:53:03,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:53:03,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1162577654, now seen corresponding path program 1 times [2022-11-19 06:53:03,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:53:03,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229861016] [2022-11-19 06:53:03,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:03,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:53:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 06:53:03,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:53:03,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229861016] [2022-11-19 06:53:03,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229861016] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:53:03,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055013803] [2022-11-19 06:53:03,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:03,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:03,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:53:03,854 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:53:03,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 06:53:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:04,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 06:53:04,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:53:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 06:53:04,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:53:04,101 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 06:53:04,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055013803] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:53:04,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1087694110] [2022-11-19 06:53:04,106 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-19 06:53:04,106 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:53:04,107 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:53:04,107 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:53:04,107 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:53:04,157 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-19 06:53:04,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-19 06:53:04,195 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:53:04,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-19 06:53:04,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:04,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:04,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 06:53:04,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:04,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-19 06:53:04,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:04,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-19 06:53:04,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:04,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:04,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:04,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-19 06:53:04,380 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 06:53:04,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 06:53:04,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-19 06:53:04,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:04,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:04,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:04,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-19 06:53:04,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:04,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:04,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 06:53:04,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:04,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-19 06:53:04,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:04,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-19 06:53:04,913 INFO L321 Elim1Store]: treesize reduction 180, result has 17.8 percent of original size [2022-11-19 06:53:04,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 422 [2022-11-19 06:53:04,963 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-11-19 06:53:04,963 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 6 case distinctions, treesize of input 401 treesize of output 406 [2022-11-19 06:53:05,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:05,319 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-19 06:53:05,320 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 414 treesize of output 379 [2022-11-19 06:53:05,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:05,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:05,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:05,395 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-19 06:53:05,396 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 415 treesize of output 353 [2022-11-19 06:53:05,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:05,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:05,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:05,472 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-19 06:53:05,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 417 treesize of output 356 [2022-11-19 06:53:05,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:05,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:05,543 INFO L321 Elim1Store]: treesize reduction 86, result has 19.6 percent of original size [2022-11-19 06:53:05,544 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 7 case distinctions, treesize of input 442 treesize of output 398 [2022-11-19 06:53:05,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:05,576 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:05,577 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:05,607 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-19 06:53:05,607 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 3 case distinctions, treesize of input 427 treesize of output 416 [2022-11-19 06:53:05,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:05,628 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:05,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:05,657 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-19 06:53:05,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 429 treesize of output 419 [2022-11-19 06:53:05,989 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 1 [2022-11-19 06:53:05,998 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 1 [2022-11-19 06:53:06,011 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 11 treesize of output 7 [2022-11-19 06:53:06,153 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 1 [2022-11-19 06:53:06,166 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 11 treesize of output 7 [2022-11-19 06:53:06,176 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 1 [2022-11-19 06:53:06,350 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 11 treesize of output 7 [2022-11-19 06:53:06,366 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 1 [2022-11-19 06:53:06,374 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 1 [2022-11-19 06:53:06,589 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-19 06:53:06,601 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-19 06:53:06,605 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:53:08,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1087694110] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:53:08,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:53:08,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 8, 8] total 19 [2022-11-19 06:53:08,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531545867] [2022-11-19 06:53:08,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:53:08,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-19 06:53:08,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:08,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-19 06:53:08,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-11-19 06:53:08,675 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:09,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:53:09,210 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-11-19 06:53:09,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 06:53:09,211 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 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 24 [2022-11-19 06:53:09,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:53:09,213 INFO L225 Difference]: With dead ends: 60 [2022-11-19 06:53:09,213 INFO L226 Difference]: Without dead ends: 56 [2022-11-19 06:53:09,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-11-19 06:53:09,214 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 58 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:53:09,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 42 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:53:09,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-19 06:53:09,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2022-11-19 06:53:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-11-19 06:53:09,227 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 24 [2022-11-19 06:53:09,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:53:09,228 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-11-19 06:53:09,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-11-19 06:53:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-19 06:53:09,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:53:09,229 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:53:09,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 06:53:09,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:09,436 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 06:53:09,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:53:09,436 INFO L85 PathProgramCache]: Analyzing trace with hash 313166407, now seen corresponding path program 1 times [2022-11-19 06:53:09,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:53:09,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017152809] [2022-11-19 06:53:09,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:09,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:53:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-19 06:53:09,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:53:09,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017152809] [2022-11-19 06:53:09,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017152809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:53:09,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:53:09,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:53:09,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094902926] [2022-11-19 06:53:09,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:53:09,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:53:09,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:09,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:53:09,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:53:09,524 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-19 06:53:09,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:53:09,591 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2022-11-19 06:53:09,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:53:09,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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 31 [2022-11-19 06:53:09,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:53:09,592 INFO L225 Difference]: With dead ends: 71 [2022-11-19 06:53:09,593 INFO L226 Difference]: Without dead ends: 57 [2022-11-19 06:53:09,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:53:09,594 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:53:09,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 52 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:53:09,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-19 06:53:09,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2022-11-19 06:53:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:09,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-11-19 06:53:09,608 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 31 [2022-11-19 06:53:09,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:53:09,608 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-11-19 06:53:09,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-19 06:53:09,609 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-11-19 06:53:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-19 06:53:09,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:53:09,610 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:53:09,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 06:53:09,610 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 06:53:09,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:53:09,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1118286044, now seen corresponding path program 1 times [2022-11-19 06:53:09,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:53:09,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135044516] [2022-11-19 06:53:09,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:09,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:53:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-19 06:53:09,689 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:53:09,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135044516] [2022-11-19 06:53:09,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135044516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:53:09,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:53:09,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:53:09,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966740910] [2022-11-19 06:53:09,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:53:09,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:53:09,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:09,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:53:09,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:53:09,691 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:53:09,772 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-11-19 06:53:09,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:53:09,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 32 [2022-11-19 06:53:09,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:53:09,775 INFO L225 Difference]: With dead ends: 53 [2022-11-19 06:53:09,775 INFO L226 Difference]: Without dead ends: 51 [2022-11-19 06:53:09,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:53:09,776 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:53:09,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:53:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-19 06:53:09,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-11-19 06:53:09,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-11-19 06:53:09,816 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 32 [2022-11-19 06:53:09,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:53:09,817 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-11-19 06:53:09,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:09,817 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-11-19 06:53:09,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-19 06:53:09,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:53:09,823 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:53:09,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 06:53:09,823 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 06:53:09,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:53:09,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1404009340, now seen corresponding path program 1 times [2022-11-19 06:53:09,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:53:09,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460676066] [2022-11-19 06:53:09,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:09,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:53:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-19 06:53:10,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:53:10,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460676066] [2022-11-19 06:53:10,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460676066] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:53:10,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594315467] [2022-11-19 06:53:10,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:10,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:10,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:53:10,063 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:53:10,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 06:53:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:10,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:53:10,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:53:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-19 06:53:10,345 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:53:10,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594315467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:53:10,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:53:10,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-19 06:53:10,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799634188] [2022-11-19 06:53:10,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:53:10,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:53:10,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:10,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:53:10,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-19 06:53:10,348 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:10,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:53:10,457 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-11-19 06:53:10,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 06:53:10,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 36 [2022-11-19 06:53:10,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:53:10,459 INFO L225 Difference]: With dead ends: 51 [2022-11-19 06:53:10,459 INFO L226 Difference]: Without dead ends: 49 [2022-11-19 06:53:10,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-19 06:53:10,460 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:53:10,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 34 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:53:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-19 06:53:10,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2022-11-19 06:53:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 43 states have (on average 1.186046511627907) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:10,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-11-19 06:53:10,478 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 36 [2022-11-19 06:53:10,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:53:10,479 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-11-19 06:53:10,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-11-19 06:53:10,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-19 06:53:10,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:53:10,480 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:53:10,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 06:53:10,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:10,686 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 06:53:10,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:53:10,687 INFO L85 PathProgramCache]: Analyzing trace with hash 633248766, now seen corresponding path program 1 times [2022-11-19 06:53:10,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:53:10,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807923633] [2022-11-19 06:53:10,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:10,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:53:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-19 06:53:10,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:53:10,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807923633] [2022-11-19 06:53:10,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807923633] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:53:10,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486207130] [2022-11-19 06:53:10,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:10,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:10,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:53:10,860 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:53:10,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 06:53:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:11,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 06:53:11,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:53:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-19 06:53:11,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:53:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-19 06:53:11,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486207130] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:53:11,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [165873943] [2022-11-19 06:53:11,147 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-19 06:53:11,147 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:53:11,148 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:53:11,148 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:53:11,148 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:53:11,208 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:53:11,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-19 06:53:11,223 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-19 06:53:11,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:11,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:11,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 06:53:11,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:11,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:11,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:11,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-19 06:53:11,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:11,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:11,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 06:53:11,407 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 06:53:11,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 06:53:11,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-19 06:53:11,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:11,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:11,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:11,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-19 06:53:11,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:11,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:11,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 06:53:11,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:11,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-19 06:53:11,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:11,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-19 06:53:11,903 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-19 06:53:11,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 401 treesize of output 406 [2022-11-19 06:53:11,993 INFO L321 Elim1Store]: treesize reduction 196, result has 10.5 percent of original size [2022-11-19 06:53:11,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 406 [2022-11-19 06:53:12,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:12,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:12,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:12,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:12,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-19 06:53:12,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:12,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:12,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 06:53:12,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:12,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-19 06:53:12,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:12,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-19 06:53:12,430 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 11 treesize of output 7 [2022-11-19 06:53:12,444 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 1 [2022-11-19 06:53:12,461 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 1 [2022-11-19 06:53:12,635 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 1 [2022-11-19 06:53:12,642 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 11 treesize of output 7 [2022-11-19 06:53:12,653 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 1 [2022-11-19 06:53:12,846 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 06:53:12,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 141 [2022-11-19 06:53:12,878 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 06:53:12,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 135 [2022-11-19 06:53:12,967 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 11 treesize of output 7 [2022-11-19 06:53:13,381 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-19 06:53:13,388 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-19 06:53:13,392 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:53:17,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [165873943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:53:17,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:53:17,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [6, 6, 6] total 27 [2022-11-19 06:53:17,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528398638] [2022-11-19 06:53:17,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:53:17,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-19 06:53:17,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:17,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-19 06:53:17,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2022-11-19 06:53:17,379 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:18,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:53:18,455 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-11-19 06:53:18,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-19 06:53:18,456 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 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 38 [2022-11-19 06:53:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:53:18,457 INFO L225 Difference]: With dead ends: 67 [2022-11-19 06:53:18,457 INFO L226 Difference]: Without dead ends: 64 [2022-11-19 06:53:18,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 82 SyntacticMatches, 10 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2022-11-19 06:53:18,459 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 89 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:53:18,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 31 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:53:18,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-19 06:53:18,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2022-11-19 06:53:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.18) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-11-19 06:53:18,479 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 38 [2022-11-19 06:53:18,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:53:18,479 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-11-19 06:53:18,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-11-19 06:53:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-19 06:53:18,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:53:18,480 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:53:18,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 06:53:18,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-19 06:53:18,692 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 06:53:18,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:53:18,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1617750852, now seen corresponding path program 1 times [2022-11-19 06:53:18,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:53:18,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222927997] [2022-11-19 06:53:18,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:18,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:53:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-19 06:53:18,876 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:53:18,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222927997] [2022-11-19 06:53:18,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222927997] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:53:18,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787316679] [2022-11-19 06:53:18,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:18,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:18,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:53:18,881 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:53:18,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 06:53:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:19,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 06:53:19,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:53:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-19 06:53:19,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:53:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-19 06:53:19,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787316679] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:53:19,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1003986784] [2022-11-19 06:53:19,208 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-19 06:53:19,208 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:53:19,209 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:53:19,209 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:53:19,209 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:53:19,263 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-19 06:53:19,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-19 06:53:19,306 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:53:19,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-19 06:53:19,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:19,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:19,342 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:19,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-19 06:53:19,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:19,362 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:19,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 06:53:19,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:19,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-19 06:53:19,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:19,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-19 06:53:19,483 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 06:53:19,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 06:53:19,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-19 06:53:19,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:19,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:19,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:19,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-19 06:53:19,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:19,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:19,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 06:53:19,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:19,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-19 06:53:19,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:19,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-19 06:53:19,963 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-19 06:53:19,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-19 06:53:19,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-19 06:53:20,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:20,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:20,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:20,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2022-11-19 06:53:20,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:20,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:20,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 06:53:20,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:20,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-19 06:53:20,153 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:20,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-19 06:53:20,444 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 11 treesize of output 7 [2022-11-19 06:53:20,457 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 1 [2022-11-19 06:53:20,470 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 1 [2022-11-19 06:53:20,586 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 11 treesize of output 7 [2022-11-19 06:53:20,595 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 1 [2022-11-19 06:53:20,606 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 1 [2022-11-19 06:53:20,793 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 06:53:20,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 141 [2022-11-19 06:53:20,828 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 06:53:20,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 135 [2022-11-19 06:53:20,886 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 11 treesize of output 7 [2022-11-19 06:53:21,595 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-19 06:53:21,602 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-19 06:53:21,606 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:53:24,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1003986784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:53:24,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:53:24,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [8, 8, 8] total 25 [2022-11-19 06:53:24,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041505840] [2022-11-19 06:53:24,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:53:24,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-19 06:53:24,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:24,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-19 06:53:24,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-11-19 06:53:24,894 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:53:26,538 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-11-19 06:53:26,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-19 06:53:26,538 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 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 41 [2022-11-19 06:53:26,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:53:26,539 INFO L225 Difference]: With dead ends: 53 [2022-11-19 06:53:26,539 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 06:53:26,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 91 SyntacticMatches, 15 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2022-11-19 06:53:26,540 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 06:53:26,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 06:53:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 06:53:26,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 06:53:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 06:53:26,541 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-11-19 06:53:26,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:53:26,542 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 06:53:26,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:26,542 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 06:53:26,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 06:53:26,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-19 06:53:26,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-19 06:53:26,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-19 06:53:26,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-19 06:53:26,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-19 06:53:26,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-19 06:53:26,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-19 06:53:26,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-19 06:53:26,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-19 06:53:26,547 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-19 06:53:26,547 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-19 06:53:26,547 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-19 06:53:26,547 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-19 06:53:26,547 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-19 06:53:26,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-19 06:53:26,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-19 06:53:26,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 06:53:31,847 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 619) no Hoare annotation was computed. [2022-11-19 06:53:31,847 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-11-19 06:53:31,847 INFO L899 garLoopResultBuilder]: For program point L622-3(line 622) no Hoare annotation was computed. [2022-11-19 06:53:31,847 INFO L899 garLoopResultBuilder]: For program point L622-4(line 622) no Hoare annotation was computed. [2022-11-19 06:53:31,847 INFO L895 garLoopResultBuilder]: At program point L622-5(lines 622 627) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (<= 1 |ULTIMATE.start_node_create_~data#1|)) (.cse2 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse3 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse4 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse5 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse6 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse7 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse8 (<= 1 |ULTIMATE.start_node_create_#in~data#1|)) (.cse9 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse10 (<= |ULTIMATE.start_node_create_#in~data#1| 1)) (.cse11 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse12 (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse13 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse14 (<= 0 |ULTIMATE.start_sll_create_~len#1|)) (.cse15 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse16 (= |#NULL.offset| 0)) (.cse17 (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse18 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse19 (<= |ULTIMATE.start_node_create_~data#1| 1)) (.cse20 (<= 0 |#StackHeapBarrier|)) (.cse21 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse22 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse23 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse24 (<= |ULTIMATE.start_sll_create_~len#1| 2)) (.cse25 (= |#NULL.base| 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 (<= |ULTIMATE.start_main_~expected~0#1| 4) .cse1 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse2 (<= 0 (+ |ULTIMATE.start_sll_get_data_at_~index#1| 1)) .cse3 .cse4 (<= |ULTIMATE.start_main_~i~0#1| 2) .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 2) .cse9 .cse10 (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_get_data_at_~index#1| 2) .cse19 .cse20 .cse21 .cse22 (<= 0 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) .cse23 .cse24 .cse25))) [2022-11-19 06:53:31,848 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2022-11-19 06:53:31,848 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2022-11-19 06:53:31,848 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-19 06:53:31,848 INFO L902 garLoopResultBuilder]: At program point L631(lines 613 632) the Hoare annotation is: true [2022-11-19 06:53:31,848 INFO L899 garLoopResultBuilder]: For program point L623(line 623) no Hoare annotation was computed. [2022-11-19 06:53:31,848 INFO L899 garLoopResultBuilder]: For program point L623-1(line 623) no Hoare annotation was computed. [2022-11-19 06:53:31,849 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 623) no Hoare annotation was computed. [2022-11-19 06:53:31,849 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2022-11-19 06:53:31,849 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (and (<= 0 (+ |ULTIMATE.start_sll_update_at_~index#1| 1)) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_node_create_~data#1|) (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= 0 |ULTIMATE.start_sll_update_at_#in~index#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_sll_update_at_~data#1|) (<= |ULTIMATE.start_sll_update_at_~data#1| 4) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_node_create_#in~data#1|) (<= |ULTIMATE.start_sll_update_at_#in~data#1| 4) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~new_data~0#1| 4) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_node_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= |ULTIMATE.start_sll_update_at_~index#1| 2) (<= 2 |ULTIMATE.start_sll_update_at_#in~data#1|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 2 |ULTIMATE.start_main_~new_data~0#1|) (<= |ULTIMATE.start_node_create_~data#1| 1) (<= |ULTIMATE.start_sll_update_at_#in~index#1| 2) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-19 06:53:31,849 INFO L895 garLoopResultBuilder]: At program point L624(lines 624 626) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (<= 1 |ULTIMATE.start_node_create_~data#1|)) (.cse2 (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|)) (.cse3 (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_#t~ret15#1|)) (.cse4 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse5 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse6 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse7 (<= 0 (+ |ULTIMATE.start_main_#t~ret15#1| 2147483648))) (.cse8 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse9 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse10 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse11 (<= 1 |ULTIMATE.start_node_create_#in~data#1|)) (.cse12 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse13 (<= |ULTIMATE.start_main_#t~ret15#1| 2147483647)) (.cse14 (<= |ULTIMATE.start_node_create_#in~data#1| 1)) (.cse15 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse16 (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse17 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse18 (<= 0 |ULTIMATE.start_sll_create_~len#1|)) (.cse19 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse20 (= |#NULL.offset| 0)) (.cse21 (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse22 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse23 (<= |ULTIMATE.start_node_create_~data#1| 1)) (.cse24 (<= 0 |#StackHeapBarrier|)) (.cse25 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse26 (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0)) (.cse27 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse28 (<= |ULTIMATE.start_sll_create_~len#1| 2)) (.cse29 (= |#NULL.base| 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 0) .cse2 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_sll_get_data_at_~head#1.offset|) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) .cse3 .cse4 .cse5 .cse6 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse18 .cse19 .cse20 .cse21 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) .cse22 .cse23 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) .cse0 (<= |ULTIMATE.start_main_~expected~0#1| 4) .cse1 .cse2 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse3 .cse4 (<= 0 (+ |ULTIMATE.start_sll_get_data_at_~index#1| 1)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 2) .cse12 .cse13 .cse14 (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= 2 |ULTIMATE.start_main_~expected~0#1|) .cse23 (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|) .cse24 .cse25 (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~index#1|) .cse26 .cse27 .cse28 .cse29))) [2022-11-19 06:53:31,850 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 623) no Hoare annotation was computed. [2022-11-19 06:53:31,850 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_node_create_~data#1|)) (.cse1 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse2 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse3 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse4 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse5 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse6 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse7 (<= 1 |ULTIMATE.start_node_create_#in~data#1|)) (.cse8 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse9 (<= |ULTIMATE.start_node_create_#in~data#1| 1)) (.cse10 (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|)) (.cse11 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse12 (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse13 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse14 (<= 0 |ULTIMATE.start_sll_create_~len#1|)) (.cse15 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse16 (= |#NULL.offset| 0)) (.cse17 (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse18 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse19 (<= 2 |ULTIMATE.start_main_~expected~0#1|)) (.cse20 (<= |ULTIMATE.start_node_create_~data#1| 1)) (.cse21 (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) (.cse22 (<= 0 |#StackHeapBarrier|)) (.cse23 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse24 (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0)) (.cse25 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse26 (<= |ULTIMATE.start_sll_create_~len#1| 2)) (.cse27 (= |#NULL.base| 0))) (or (and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~expected~0#1| 4) .cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse1 (<= 0 (+ |ULTIMATE.start_sll_get_data_at_~index#1| 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 2) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= |ULTIMATE.start_sll_get_data_at_~index#1| 2) .cse20 .cse21 .cse22 .cse23 (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~index#1|) .cse24 .cse25 .cse26 .cse27) (and .cse0 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_sll_get_data_at_~head#1.offset|) .cse1 .cse2 .cse3 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) .cse18 .cse19 .cse20 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (= |ULTIMATE.start_sll_get_data_at_~index#1| 0) .cse27))) [2022-11-19 06:53:31,850 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2022-11-19 06:53:31,850 INFO L899 garLoopResultBuilder]: For program point L609(line 609) no Hoare annotation was computed. [2022-11-19 06:53:31,851 INFO L895 garLoopResultBuilder]: At program point L576(lines 576 578) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (let ((.cse0 (<= 1 |ULTIMATE.start_node_create_~data#1|))) (or (and .cse0 (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_~len#1|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 1)) (and .cse0 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.base| 0)))) (let ((.cse11 (select |#memory_int| 1))) (let ((.cse1 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse2 (= 2 (select |#length| 1))) (.cse3 (= (select |#valid| 1) 1)) (.cse4 (= 19 (select |#length| 2))) (.cse5 (= (select |#valid| 0) 0)) (.cse6 (= (select |#valid| 2) 1)) (.cse7 (= (select .cse11 0) 48)) (.cse8 (= (select .cse11 1) 0)) (.cse9 (< 0 |#StackHeapBarrier|))) (or (and .cse1 (= |ULTIMATE.start_sll_create_~len#1| |ULTIMATE.start_sll_create_#in~len#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (and .cse1 (= |ULTIMATE.start_sll_create_~data#1| (select (select |#memory_int| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0)) .cse2 (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10) 0) .cse3 .cse4 .cse5 .cse6 .cse7 (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) .cse8 (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |#StackHeapBarrier|) .cse9 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10) 0)))))) (<= 1 |ULTIMATE.start_node_create_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (< |ULTIMATE.start_node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_node_create_#in~data#1|) (<= |ULTIMATE.start_node_create_~data#1| 1) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-19 06:53:31,851 INFO L899 garLoopResultBuilder]: For program point L609-1(line 609) no Hoare annotation was computed. [2022-11-19 06:53:31,851 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2022-11-19 06:53:31,852 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2022-11-19 06:53:31,852 INFO L899 garLoopResultBuilder]: For program point L618-3(line 618) no Hoare annotation was computed. [2022-11-19 06:53:31,852 INFO L899 garLoopResultBuilder]: For program point L585-3(line 585) no Hoare annotation was computed. [2022-11-19 06:53:31,852 INFO L899 garLoopResultBuilder]: For program point L618-4(line 618) no Hoare annotation was computed. [2022-11-19 06:53:31,852 INFO L899 garLoopResultBuilder]: For program point L585-4(line 585) no Hoare annotation was computed. [2022-11-19 06:53:31,853 INFO L895 garLoopResultBuilder]: At program point L618-5(lines 618 621) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_node_create_~data#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (< |ULTIMATE.start_main_~i~0#1| 2147483647) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_node_create_#in~data#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_node_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_node_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-19 06:53:31,853 INFO L895 garLoopResultBuilder]: At program point L585-5(lines 585 589) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse1 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse2 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse3 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse5 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse6 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse8 (= |#NULL.offset| 0)) (.cse9 (<= 0 |#StackHeapBarrier|)) (.cse10 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse11 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse12 (= |#NULL.base| 0))) (or (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= 1 |ULTIMATE.start_node_create_~data#1|) .cse0 .cse1 .cse2 .cse3 (<= 1 |ULTIMATE.start_node_create_#in~data#1|) .cse4 (<= |ULTIMATE.start_node_create_#in~data#1| 1) .cse5 (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|) .cse6 (<= 0 |ULTIMATE.start_sll_create_~len#1|) .cse7 .cse8 (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= |ULTIMATE.start_node_create_~data#1| 1) .cse9 .cse10 .cse11 (<= |ULTIMATE.start_sll_create_~len#1| 2) .cse12))) [2022-11-19 06:53:31,853 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-11-19 06:53:31,853 INFO L899 garLoopResultBuilder]: For program point L602(line 602) no Hoare annotation was computed. [2022-11-19 06:53:31,854 INFO L899 garLoopResultBuilder]: For program point L602-1(line 602) no Hoare annotation was computed. [2022-11-19 06:53:31,854 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-19 06:53:31,854 INFO L899 garLoopResultBuilder]: For program point L619(line 619) no Hoare annotation was computed. [2022-11-19 06:53:31,854 INFO L899 garLoopResultBuilder]: For program point L619-1(line 619) no Hoare annotation was computed. [2022-11-19 06:53:31,854 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 06:53:31,854 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-11-19 06:53:31,854 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-19 06:53:31,855 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 619) no Hoare annotation was computed. [2022-11-19 06:53:31,855 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2022-11-19 06:53:31,858 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:53:31,860 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 06:53:31,878 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:53:31,879 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:53:31,882 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:53:31,883 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:53:31,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:53:31 BoogieIcfgContainer [2022-11-19 06:53:31,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 06:53:31,904 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 06:53:31,905 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 06:53:31,905 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 06:53:31,905 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:52:34" (3/4) ... [2022-11-19 06:53:31,909 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 06:53:31,920 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2022-11-19 06:53:31,921 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-19 06:53:31,921 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-19 06:53:31,922 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 06:53:31,948 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((2 == len && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && #NULL == 0) || ((((((((((((((((((((1 <= data && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && 1 <= \old(data)) && data == 1) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && #NULL == 0) && temp <= 0) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) [2022-11-19 06:53:31,948 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((1 <= \old(data) && 8 == unknown-#length-unknown[temp]) && temp == 0) && \old(data) <= 1) && head <= 0) && (((((1 <= data && 0 <= new_head) && 1 <= len) && new_head <= 0) && len <= 1) || ((1 <= data && 0 <= head) && head <= 0))) && ((((((((((\valid[temp] == 1 && len == \old(len)) && 2 == unknown-#length-unknown[1]) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((((((((((((\valid[temp] == 1 && data == unknown-#memory_int-unknown[new_head][0]) && 2 == unknown-#length-unknown[1]) && !(temp == new_head)) && head == new_head) && unknown-#length-unknown[new_head] == 8) && #memory_$Pointer$[new_head][4 + new_head] == 0) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && \valid[new_head] == 1) && unknown-#memory_int-unknown[1][1] == 0) && new_head < unknown-#StackHeapBarrier-unknown) && 0 < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[new_head][4 + new_head] == 0))) && 1 <= \old(data)) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && data == \old(data)) && data <= 1) && 2 <= \old(len)) && 0 <= head) && #NULL == 0 [2022-11-19 06:53:31,949 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((0 <= s && 1 <= data) && 1 <= \old(data)) && \old(data) <= 1) && i < 2147483647) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && 1 <= \old(data)) && 0 <= i) && data == 1) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && #NULL == 0) && temp <= 0) && 0 <= \result) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 [2022-11-19 06:53:31,949 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((0 <= s && 1 <= data) && i == 0) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && 1 <= \old(data)) && data == 1) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && #NULL == 0) && temp <= 0) && 0 <= \result) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((((((((((((((((((((((((0 <= s && expected <= 4) && 1 <= data) && 1 <= i) && 1 <= \old(data)) && 0 <= index + 1) && \old(data) <= 1) && head <= 0) && i <= 2) && len <= 0) && \result <= 0) && 1 <= data) && 1 <= \old(data)) && \old(index) <= 2) && data == 1) && \old(data) <= 1) && 0 <= head) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && #NULL == 0) && temp <= 0) && 0 <= \result) && 2 <= expected) && index <= 2) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= \old(index)) && head <= 0) && 0 <= head) && len <= 2) && #NULL == 0) [2022-11-19 06:53:31,949 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((0 <= index + 1 && 0 <= s) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 <= data) && data <= 4) && 1 <= data) && 1 <= \old(data)) && \old(data) <= 4) && 0 <= i) && new_data <= 4) && data == 1) && head <= 0) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && #NULL == 0) && temp <= 0) && index <= 2) && 2 <= \old(data)) && 0 <= \result) && 2 <= new_data) && data <= 1) && \old(index) <= 2) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 [2022-11-19 06:53:31,950 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((0 <= s && expected <= 4) && 1 <= data) && 1 <= i) && 1 <= \old(data)) && 0 <= index + 1) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && 1 <= \old(data)) && \old(index) <= 2) && data == 1) && \old(data) <= 1) && 0 <= head) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && #NULL == 0) && temp <= 0) && 0 <= \result) && 2 <= expected) && index <= 2) && data <= 1) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= \old(index)) && head <= 0) && 0 <= head) && len <= 2) && #NULL == 0) || ((((((((((((((((((((((((((((((((((1 <= data && head == head) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && len + i == expected) && len <= 0) && \result <= 0) && 1 <= data) && 1 <= \old(data)) && data == 1) && \old(data) <= 1) && 0 <= head) && data <= 1) && 0 <= temp) && \old(len) <= 2) && head == s) && 0 <= len) && len == 2) && #NULL == 0) && temp <= 0) && head == s) && \old(index) == index) && 0 <= \result) && 2 <= expected) && data <= 1) && head == head) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && head <= 0) && 0 <= head) && len <= 2) && index == 0) && #NULL == 0) [2022-11-19 06:53:31,951 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((0 <= s && 1 <= data) && i == 0) && unknown-#memory_int-unknown[head][head] == \result) && head == head) && \old(index) == i) && \result == aux-sll_get_data_at(s, i)-aux) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && len + i == expected) && 0 <= aux-sll_get_data_at(s, i)-aux + 2147483648) && len <= 0) && \result <= 0) && 1 <= data) && 1 <= \old(data)) && data == 1) && aux-sll_get_data_at(s, i)-aux <= 2147483647) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && head == s) && 0 <= len) && len == 2) && #NULL == 0) && temp <= 0) && head == s) && \old(index) == index) && 0 <= \result) && data <= 1) && head == head) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && head <= 0) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && expected <= 4) && 1 <= data) && unknown-#memory_int-unknown[head][head] == \result) && 1 <= i) && \result == aux-sll_get_data_at(s, i)-aux) && 1 <= \old(data)) && 0 <= index + 1) && \old(data) <= 1) && head <= 0) && 0 <= aux-sll_get_data_at(s, i)-aux + 2147483648) && len <= 0) && \result <= 0) && 1 <= data) && 1 <= \old(data)) && \old(index) <= 2) && data == 1) && aux-sll_get_data_at(s, i)-aux <= 2147483647) && \old(data) <= 1) && 0 <= head) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && #NULL == 0) && temp <= 0) && 0 <= \result) && 2 <= expected) && data <= 1) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= \old(index)) && head <= 0) && 0 <= head) && len <= 2) && #NULL == 0) [2022-11-19 06:53:31,966 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 06:53:31,966 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 06:53:31,967 INFO L158 Benchmark]: Toolchain (without parser) took 58652.77ms. Allocated memory was 157.3MB in the beginning and 490.7MB in the end (delta: 333.4MB). Free memory was 119.1MB in the beginning and 373.4MB in the end (delta: -254.3MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. [2022-11-19 06:53:31,967 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 157.3MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 06:53:31,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.23ms. Allocated memory is still 157.3MB. Free memory was 118.9MB in the beginning and 124.7MB in the end (delta: -5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-19 06:53:31,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.78ms. Allocated memory is still 157.3MB. Free memory was 124.7MB in the beginning and 122.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:53:31,968 INFO L158 Benchmark]: Boogie Preprocessor took 30.44ms. Allocated memory is still 157.3MB. Free memory was 122.4MB in the beginning and 120.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:53:31,968 INFO L158 Benchmark]: RCFGBuilder took 695.02ms. Allocated memory is still 157.3MB. Free memory was 120.7MB in the beginning and 100.4MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-19 06:53:31,968 INFO L158 Benchmark]: TraceAbstraction took 57315.47ms. Allocated memory was 157.3MB in the beginning and 490.7MB in the end (delta: 333.4MB). Free memory was 99.7MB in the beginning and 376.6MB in the end (delta: -276.8MB). Peak memory consumption was 266.4MB. Max. memory is 16.1GB. [2022-11-19 06:53:31,969 INFO L158 Benchmark]: Witness Printer took 62.15ms. Allocated memory is still 490.7MB. Free memory was 376.6MB in the beginning and 373.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:53:31,970 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.29ms. Allocated memory is still 157.3MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.23ms. Allocated memory is still 157.3MB. Free memory was 118.9MB in the beginning and 124.7MB in the end (delta: -5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.78ms. Allocated memory is still 157.3MB. Free memory was 124.7MB in the beginning and 122.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.44ms. Allocated memory is still 157.3MB. Free memory was 122.4MB in the beginning and 120.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 695.02ms. Allocated memory is still 157.3MB. Free memory was 120.7MB in the beginning and 100.4MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 57315.47ms. Allocated memory was 157.3MB in the beginning and 490.7MB in the end (delta: 333.4MB). Free memory was 99.7MB in the beginning and 376.6MB in the end (delta: -276.8MB). Peak memory consumption was 266.4MB. Max. memory is 16.1GB. * Witness Printer took 62.15ms. Allocated memory is still 490.7MB. Free memory was 376.6MB in the beginning and 373.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 623]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 623]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: 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 1 procedures, 40 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 57.2s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 732 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 732 mSDsluCounter, 1063 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8 IncrementalHoareTripleChecker+Unchecked, 736 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1346 IncrementalHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 327 mSDtfsCounter, 1346 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 680 GetRequests, 426 SyntacticMatches, 65 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 23.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=16, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 169 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 30 NumberOfFragments, 1206 HoareAnnotationTreeSize, 10 FomulaSimplifications, 593 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 10 FomulaSimplificationsInter, 57212 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 560 NumberOfCodeBlocks, 543 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 712 ConstructedInterpolants, 0 QuantifiedInterpolants, 1490 SizeOfPredicates, 28 NumberOfNonLiveVariables, 2032 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 34 InterpolantComputations, 9 PerfectInterpolantSequences, 258/335 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: 15.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 6, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 112, DAG_INTERPRETER_EARLY_EXITS: 3, TOOLS_POST_APPLICATIONS: 332, TOOLS_POST_TIME: 13.7s, 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: 332, TOOLS_QUANTIFIERELIM_TIME: 13.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.6s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 544, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 50, DOMAIN_JOIN_TIME: 0.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 15, DOMAIN_WIDEN_TIME: 0.3s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 43, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 112, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 28, LOOP_SUMMARIZER_CACHE_MISSES: 28, LOOP_SUMMARIZER_OVERALL_TIME: 10.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 10.2s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 43, 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.1s, DAG_COMPRESSION_PROCESSED_NODES: 3975, DAG_COMPRESSION_RETAINED_NODES: 379, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: (((((((((((((2 == len && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && #NULL == 0) || ((((((((((((((((((((1 <= data && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && 1 <= \old(data)) && data == 1) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && #NULL == 0) && temp <= 0) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) - InvariantResult [Line: 576]: Loop Invariant [2022-11-19 06:53:31,981 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:53:31,981 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:53:31,983 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:53:31,983 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((1 <= \old(data) && 8 == unknown-#length-unknown[temp]) && temp == 0) && \old(data) <= 1) && head <= 0) && (((((1 <= data && 0 <= new_head) && 1 <= len) && new_head <= 0) && len <= 1) || ((1 <= data && 0 <= head) && head <= 0))) && ((((((((((\valid[temp] == 1 && len == \old(len)) && 2 == unknown-#length-unknown[1]) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((((((((((((\valid[temp] == 1 && data == unknown-#memory_int-unknown[new_head][0]) && 2 == unknown-#length-unknown[1]) && !(temp == new_head)) && head == new_head) && unknown-#length-unknown[new_head] == 8) && #memory_$Pointer$[new_head][4 + new_head] == 0) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && \valid[new_head] == 1) && unknown-#memory_int-unknown[1][1] == 0) && new_head < unknown-#StackHeapBarrier-unknown) && 0 < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[new_head][4 + new_head] == 0))) && 1 <= \old(data)) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && data == \old(data)) && data <= 1) && 2 <= \old(len)) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((0 <= s && 1 <= data) && 1 <= \old(data)) && \old(data) <= 1) && i < 2147483647) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && 1 <= \old(data)) && 0 <= i) && data == 1) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && #NULL == 0) && temp <= 0) && 0 <= \result) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((0 <= s && expected <= 4) && 1 <= data) && 1 <= i) && 1 <= \old(data)) && 0 <= index + 1) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && 1 <= \old(data)) && \old(index) <= 2) && data == 1) && \old(data) <= 1) && 0 <= head) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && #NULL == 0) && temp <= 0) && 0 <= \result) && 2 <= expected) && index <= 2) && data <= 1) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= \old(index)) && head <= 0) && 0 <= head) && len <= 2) && #NULL == 0) || ((((((((((((((((((((((((((((((((((1 <= data && head == head) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && len + i == expected) && len <= 0) && \result <= 0) && 1 <= data) && 1 <= \old(data)) && data == 1) && \old(data) <= 1) && 0 <= head) && data <= 1) && 0 <= temp) && \old(len) <= 2) && head == s) && 0 <= len) && len == 2) && #NULL == 0) && temp <= 0) && head == s) && \old(index) == index) && 0 <= \result) && 2 <= expected) && data <= 1) && head == head) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && head <= 0) && 0 <= head) && len <= 2) && index == 0) && #NULL == 0) - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((0 <= s && 1 <= data) && i == 0) && unknown-#memory_int-unknown[head][head] == \result) && head == head) && \old(index) == i) && \result == aux-sll_get_data_at(s, i)-aux) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && len + i == expected) && 0 <= aux-sll_get_data_at(s, i)-aux + 2147483648) && len <= 0) && \result <= 0) && 1 <= data) && 1 <= \old(data)) && data == 1) && aux-sll_get_data_at(s, i)-aux <= 2147483647) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && head == s) && 0 <= len) && len == 2) && #NULL == 0) && temp <= 0) && head == s) && \old(index) == index) && 0 <= \result) && data <= 1) && head == head) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && head <= 0) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && expected <= 4) && 1 <= data) && unknown-#memory_int-unknown[head][head] == \result) && 1 <= i) && \result == aux-sll_get_data_at(s, i)-aux) && 1 <= \old(data)) && 0 <= index + 1) && \old(data) <= 1) && head <= 0) && 0 <= aux-sll_get_data_at(s, i)-aux + 2147483648) && len <= 0) && \result <= 0) && 1 <= data) && 1 <= \old(data)) && \old(index) <= 2) && data == 1) && aux-sll_get_data_at(s, i)-aux <= 2147483647) && \old(data) <= 1) && 0 <= head) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && #NULL == 0) && temp <= 0) && 0 <= \result) && 2 <= expected) && data <= 1) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= \old(index)) && head <= 0) && 0 <= head) && len <= 2) && #NULL == 0) - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((0 <= index + 1 && 0 <= s) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 <= data) && data <= 4) && 1 <= data) && 1 <= \old(data)) && \old(data) <= 4) && 0 <= i) && new_data <= 4) && data == 1) && head <= 0) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && #NULL == 0) && temp <= 0) && index <= 2) && 2 <= \old(data)) && 0 <= \result) && 2 <= new_data) && data <= 1) && \old(index) <= 2) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((0 <= s && 1 <= data) && i == 0) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && 1 <= \old(data)) && data == 1) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && #NULL == 0) && temp <= 0) && 0 <= \result) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((((((((((((((((((((((((0 <= s && expected <= 4) && 1 <= data) && 1 <= i) && 1 <= \old(data)) && 0 <= index + 1) && \old(data) <= 1) && head <= 0) && i <= 2) && len <= 0) && \result <= 0) && 1 <= data) && 1 <= \old(data)) && \old(index) <= 2) && data == 1) && \old(data) <= 1) && 0 <= head) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && len == 2) && #NULL == 0) && temp <= 0) && 0 <= \result) && 2 <= expected) && index <= 2) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= \old(index)) && head <= 0) && 0 <= head) && len <= 2) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-19 06:53:32,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59977101-502c-419d-a412-3b0dc35c4e12/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE