./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-38b53e6 [2022-11-25 23:46:20,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:46:20,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:46:20,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:46:20,784 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:46:20,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:46:20,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:46:20,795 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:46:20,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:46:20,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:46:20,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:46:20,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:46:20,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:46:20,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:46:20,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:46:20,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:46:20,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:46:20,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:46:20,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:46:20,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:46:20,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:46:20,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:46:20,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:46:20,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:46:20,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:46:20,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:46:20,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:46:20,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:46:20,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:46:20,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:46:20,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:46:20,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:46:20,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:46:20,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:46:20,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:46:20,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:46:20,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:46:20,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:46:20,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:46:20,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:46:20,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:46:20,872 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-25 23:46:20,926 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:46:20,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:46:20,927 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:46:20,927 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:46:20,928 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:46:20,928 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:46:20,928 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:46:20,929 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:46:20,929 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:46:20,929 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:46:20,929 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:46:20,929 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:46:20,929 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:46:20,930 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:46:20,930 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:46:20,930 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:46:20,930 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:46:20,930 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:46:20,931 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:46:20,931 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:46:20,931 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:46:20,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:46:20,932 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:46:20,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:46:20,932 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:46:20,932 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:46:20,932 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:46:20,933 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 23:46:20,933 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:46:20,933 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:46:20,933 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:46:20,933 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:46:20,933 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:46:20,934 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:46:20,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:46:20,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:46:20,934 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:46:20,934 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:46:20,935 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:46:20,935 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:46:20,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:46:20,935 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:46:20,935 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:46:20,935 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_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a [2022-11-25 23:46:21,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:46:21,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:46:21,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:46:21,254 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:46:21,254 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:46:21,256 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2022-11-25 23:46:24,336 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:46:24,629 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:46:24,636 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/sv-benchmarks/c/list-simple/sll2n_update_all.i [2022-11-25 23:46:24,653 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/data/3ae4dd331/f8e3c6d7bfaf4f33893c93ea7570cc9d/FLAGfdd2c6c7c [2022-11-25 23:46:24,675 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/data/3ae4dd331/f8e3c6d7bfaf4f33893c93ea7570cc9d [2022-11-25 23:46:24,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:46:24,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:46:24,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:46:24,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:46:24,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:46:24,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:46:24" (1/1) ... [2022-11-25 23:46:24,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@661d8fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:24, skipping insertion in model container [2022-11-25 23:46:24,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:46:24" (1/1) ... [2022-11-25 23:46:24,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:46:24,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:46:25,035 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2022-11-25 23:46:25,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:46:25,054 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:46:25,132 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2022-11-25 23:46:25,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:46:25,170 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:46:25,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:25 WrapperNode [2022-11-25 23:46:25,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:46:25,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:46:25,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:46:25,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:46:25,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:25" (1/1) ... [2022-11-25 23:46:25,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:25" (1/1) ... [2022-11-25 23:46:25,238 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2022-11-25 23:46:25,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:46:25,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:46:25,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:46:25,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:46:25,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:25" (1/1) ... [2022-11-25 23:46:25,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:25" (1/1) ... [2022-11-25 23:46:25,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:25" (1/1) ... [2022-11-25 23:46:25,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:25" (1/1) ... [2022-11-25 23:46:25,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:25" (1/1) ... [2022-11-25 23:46:25,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:25" (1/1) ... [2022-11-25 23:46:25,293 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:25" (1/1) ... [2022-11-25 23:46:25,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:25" (1/1) ... [2022-11-25 23:46:25,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:46:25,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:46:25,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:46:25,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:46:25,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:25" (1/1) ... [2022-11-25 23:46:25,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:46:25,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:25,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:46:25,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:46:25,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:46:25,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:46:25,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:46:25,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:46:25,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 23:46:25,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 23:46:25,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:46:25,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:46:25,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:46:25,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:46:25,504 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:46:25,506 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:46:25,764 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:46:25,911 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:46:25,911 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-25 23:46:25,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:46:25 BoogieIcfgContainer [2022-11-25 23:46:25,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:46:25,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:46:25,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:46:25,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:46:25,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:46:24" (1/3) ... [2022-11-25 23:46:25,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105b304d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:46:25, skipping insertion in model container [2022-11-25 23:46:25,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:25" (2/3) ... [2022-11-25 23:46:25,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105b304d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:46:25, skipping insertion in model container [2022-11-25 23:46:25,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:46:25" (3/3) ... [2022-11-25 23:46:25,925 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2022-11-25 23:46:25,945 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:46:25,945 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-25 23:46:25,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:46:26,002 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;@17ad236f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:46:26,002 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-25 23:46:26,006 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-25 23:46:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:46:26,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:26,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:46:26,012 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-25 23:46:26,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:26,017 INFO L85 PathProgramCache]: Analyzing trace with hash 5391530, now seen corresponding path program 1 times [2022-11-25 23:46:26,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:26,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330494673] [2022-11-25 23:46:26,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:26,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:26,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:26,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330494673] [2022-11-25 23:46:26,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330494673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:26,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:46:26,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:46:26,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395203008] [2022-11-25 23:46:26,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:26,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:46:26,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:26,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:46:26,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:46:26,340 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-25 23:46:26,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:26,402 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2022-11-25 23:46:26,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:46:26,405 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-25 23:46:26,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:26,414 INFO L225 Difference]: With dead ends: 79 [2022-11-25 23:46:26,414 INFO L226 Difference]: Without dead ends: 42 [2022-11-25 23:46:26,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:46:26,420 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:26,421 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.0s Time] [2022-11-25 23:46:26,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-25 23:46:26,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-11-25 23:46:26,452 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-25 23:46:26,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-11-25 23:46:26,455 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 4 [2022-11-25 23:46:26,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:26,455 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-11-25 23:46:26,455 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-25 23:46:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-11-25 23:46:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:46:26,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:26,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:46:26,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:46:26,457 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-25 23:46:26,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:26,457 INFO L85 PathProgramCache]: Analyzing trace with hash 5257468, now seen corresponding path program 1 times [2022-11-25 23:46:26,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:26,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822040019] [2022-11-25 23:46:26,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:26,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:26,624 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:26,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822040019] [2022-11-25 23:46:26,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822040019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:26,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:46:26,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:46:26,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307618099] [2022-11-25 23:46:26,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:26,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:46:26,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:26,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:46:26,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:46:26,628 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-25 23:46:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:26,711 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-11-25 23:46:26,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:46:26,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 23:46:26,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:26,715 INFO L225 Difference]: With dead ends: 42 [2022-11-25 23:46:26,715 INFO L226 Difference]: Without dead ends: 41 [2022-11-25 23:46:26,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:46:26,716 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:26,717 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.1s Time] [2022-11-25 23:46:26,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-25 23:46:26,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-11-25 23:46:26,721 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-25 23:46:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-25 23:46:26,722 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 4 [2022-11-25 23:46:26,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:26,723 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-25 23:46:26,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-25 23:46:26,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:46:26,724 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:26,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:46:26,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:46:26,724 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-25 23:46:26,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:26,725 INFO L85 PathProgramCache]: Analyzing trace with hash 162981564, now seen corresponding path program 1 times [2022-11-25 23:46:26,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:26,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058833701] [2022-11-25 23:46:26,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:26,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:26,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:26,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058833701] [2022-11-25 23:46:26,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058833701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:26,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:46:26,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:46:26,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052264349] [2022-11-25 23:46:26,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:26,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:46:26,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:26,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:46:26,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:46:26,886 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-25 23:46:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:26,948 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-11-25 23:46:26,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:46:26,949 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-25 23:46:26,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:26,950 INFO L225 Difference]: With dead ends: 41 [2022-11-25 23:46:26,950 INFO L226 Difference]: Without dead ends: 40 [2022-11-25 23:46:26,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:46:26,952 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-25 23:46:26,952 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-25 23:46:26,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-25 23:46:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-25 23:46:26,957 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-25 23:46:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-11-25 23:46:26,957 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 5 [2022-11-25 23:46:26,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:26,958 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-11-25 23:46:26,958 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-25 23:46:26,958 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-11-25 23:46:26,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:46:26,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:26,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:26,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:46:26,959 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-25 23:46:26,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:26,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2070906749, now seen corresponding path program 1 times [2022-11-25 23:46:26,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:26,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099145226] [2022-11-25 23:46:26,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:26,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:27,101 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-25 23:46:27,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:27,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099145226] [2022-11-25 23:46:27,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099145226] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:27,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691471237] [2022-11-25 23:46:27,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:27,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:27,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:27,107 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:27,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:46:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:27,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:46:27,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:27,311 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-25 23:46:27,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:27,357 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-25 23:46:27,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691471237] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:27,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1593407120] [2022-11-25 23:46:27,383 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-25 23:46:27,383 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:46:27,390 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:46:27,396 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:46:27,397 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:46:27,555 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:46:27,556 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-25 23:46:27,627 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:46:27,631 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-25 23:46:27,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:27,732 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-25 23:46:27,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:27,747 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-25 23:46:27,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:27,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:27,780 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-25 23:46:27,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:27,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:27,830 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:27,834 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-25 23:46:28,003 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:46:28,003 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-25 23:46:28,029 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-25 23:46:28,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:28,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:28,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:28,143 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-25 23:46:28,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:28,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:28,187 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-25 23:46:28,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:28,218 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-25 23:46:28,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:28,235 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-25 23:46:28,715 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-25 23:46:28,716 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-25 23:46:28,841 INFO L321 Elim1Store]: treesize reduction 196, result has 10.5 percent of original size [2022-11-25 23:46:28,841 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-25 23:46:28,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:28,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:28,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:28,974 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:28,976 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-25 23:46:29,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:29,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:29,020 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-25 23:46:29,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:29,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-25 23:46:29,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:29,078 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-25 23:46:29,564 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-25 23:46:29,565 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-25 23:46:29,613 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-25 23:46:29,669 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:46:31,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1593407120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:31,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:31,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4, 4] total 9 [2022-11-25 23:46:31,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338346785] [2022-11-25 23:46:31,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:31,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:46:31,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:31,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:46:31,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:46:31,726 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-25 23:46:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:32,002 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-11-25 23:46:32,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:46:32,004 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-25 23:46:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:32,005 INFO L225 Difference]: With dead ends: 69 [2022-11-25 23:46:32,005 INFO L226 Difference]: Without dead ends: 50 [2022-11-25 23:46:32,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:46:32,006 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 44 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:32,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 66 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:46:32,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-25 23:46:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2022-11-25 23:46:32,014 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-25 23:46:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-11-25 23:46:32,015 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 8 [2022-11-25 23:46:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:32,015 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-11-25 23:46:32,016 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-25 23:46:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-11-25 23:46:32,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:46:32,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:32,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:32,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:32,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:32,223 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-25 23:46:32,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:32,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1472796847, now seen corresponding path program 1 times [2022-11-25 23:46:32,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:32,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149650823] [2022-11-25 23:46:32,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:32,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:32,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:32,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149650823] [2022-11-25 23:46:32,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149650823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:32,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:46:32,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:46:32,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79219126] [2022-11-25 23:46:32,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:32,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:46:32,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:32,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:46:32,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:46:32,291 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-25 23:46:32,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:32,372 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2022-11-25 23:46:32,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:46:32,373 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-25 23:46:32,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:32,374 INFO L225 Difference]: With dead ends: 62 [2022-11-25 23:46:32,374 INFO L226 Difference]: Without dead ends: 60 [2022-11-25 23:46:32,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:46:32,375 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-25 23:46:32,376 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-25 23:46:32,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-25 23:46:32,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2022-11-25 23:46:32,385 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-25 23:46:32,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-11-25 23:46:32,386 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 11 [2022-11-25 23:46:32,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:32,387 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-11-25 23:46:32,387 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-25 23:46:32,387 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-11-25 23:46:32,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:46:32,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:32,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:32,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:46:32,388 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-25 23:46:32,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:32,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1472793487, now seen corresponding path program 1 times [2022-11-25 23:46:32,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:32,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594644235] [2022-11-25 23:46:32,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:32,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:46:32,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:32,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594644235] [2022-11-25 23:46:32,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594644235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:32,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:46:32,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:46:32,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001702237] [2022-11-25 23:46:32,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:32,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:46:32,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:32,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:46:32,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:46:32,452 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-25 23:46:32,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:32,537 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2022-11-25 23:46:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:46:32,538 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-25 23:46:32,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:32,539 INFO L225 Difference]: With dead ends: 125 [2022-11-25 23:46:32,539 INFO L226 Difference]: Without dead ends: 91 [2022-11-25 23:46:32,539 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-25 23:46:32,540 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-25 23:46:32,541 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-25 23:46:32,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-25 23:46:32,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 41. [2022-11-25 23:46:32,550 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-25 23:46:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-11-25 23:46:32,551 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2022-11-25 23:46:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:32,551 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-11-25 23:46:32,551 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-25 23:46:32,551 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-11-25 23:46:32,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:46:32,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:32,552 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:32,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:46:32,553 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-25 23:46:32,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:32,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1294929578, now seen corresponding path program 1 times [2022-11-25 23:46:32,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:32,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224427209] [2022-11-25 23:46:32,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:32,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:46:32,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:32,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224427209] [2022-11-25 23:46:32,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224427209] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:32,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750592740] [2022-11-25 23:46:32,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:32,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:32,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:32,645 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:32,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:46:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:32,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:46:32,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:46:32,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:32,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:46:32,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750592740] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:32,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [208757668] [2022-11-25 23:46:32,818 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-25 23:46:32,818 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:46:32,818 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:46:32,818 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:46:32,819 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:46:32,868 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:46:32,869 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-25 23:46:32,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:46:32,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:32,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:32,930 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:32,932 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-25 23:46:32,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:32,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:32,952 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-25 23:46:32,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:32,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:32,979 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-25 23:46:33,088 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:46:33,088 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-25 23:46:33,110 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-25 23:46:33,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:33,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:33,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:33,186 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-25 23:46:33,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:33,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:33,218 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-25 23:46:33,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:33,244 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-25 23:46:33,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:33,258 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-25 23:46:33,654 INFO L321 Elim1Store]: treesize reduction 180, result has 17.8 percent of original size [2022-11-25 23:46:33,654 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-25 23:46:33,711 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-11-25 23:46:33,711 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-25 23:46:34,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:34,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:34,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:34,170 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-25 23:46:34,171 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-25 23:46:34,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:34,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:34,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:34,251 INFO L321 Elim1Store]: treesize reduction 86, result has 19.6 percent of original size [2022-11-25 23:46:34,252 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-25 23:46:34,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:34,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:34,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:34,327 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-25 23:46:34,328 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-25 23:46:34,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:34,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:34,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:34,385 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-25 23:46:34,385 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-25 23:46:34,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:34,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:34,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:34,441 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-25 23:46:34,442 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-25 23:46:34,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:34,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:34,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:34,496 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-25 23:46:34,497 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-25 23:46:34,872 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-25 23:46:34,887 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-25 23:46:34,897 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-25 23:46:34,982 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-25 23:46:34,991 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-25 23:46:34,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 11 treesize of output 7 [2022-11-25 23:46:35,074 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-25 23:46:35,082 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-25 23:46:35,092 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-25 23:46:35,316 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-25 23:46:35,317 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-25 23:46:35,419 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-25 23:46:35,420 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-25 23:46:35,735 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:46:37,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [208757668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:37,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:37,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4, 4] total 13 [2022-11-25 23:46:37,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95953059] [2022-11-25 23:46:37,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:37,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:46:37,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:37,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:46:37,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:46:37,491 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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-25 23:46:38,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:38,570 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-11-25 23:46:38,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:46:38,572 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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-25 23:46:38,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:38,573 INFO L225 Difference]: With dead ends: 75 [2022-11-25 23:46:38,573 INFO L226 Difference]: Without dead ends: 69 [2022-11-25 23:46:38,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:46:38,574 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 134 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:38,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 70 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:46:38,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-25 23:46:38,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2022-11-25 23:46:38,589 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-25 23:46:38,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-11-25 23:46:38,590 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 14 [2022-11-25 23:46:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:38,590 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-11-25 23:46:38,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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-25 23:46:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-11-25 23:46:38,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:46:38,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:38,591 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:38,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:38,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:38,797 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-25 23:46:38,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:38,797 INFO L85 PathProgramCache]: Analyzing trace with hash 149268246, now seen corresponding path program 1 times [2022-11-25 23:46:38,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:38,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298729191] [2022-11-25 23:46:38,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:38,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:38,887 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-25 23:46:38,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:38,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298729191] [2022-11-25 23:46:38,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298729191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:38,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:46:38,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:46:38,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834634432] [2022-11-25 23:46:38,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:38,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:46:38,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:38,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:46:38,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:46:38,890 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:38,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:38,920 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-11-25 23:46:38,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:46:38,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 23:46:38,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:38,921 INFO L225 Difference]: With dead ends: 48 [2022-11-25 23:46:38,921 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 23:46:38,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:46:38,922 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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-25 23:46:38,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 52 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:46:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 23:46:38,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-25 23:46:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-11-25 23:46:38,933 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 17 [2022-11-25 23:46:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:38,934 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-11-25 23:46:38,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-11-25 23:46:38,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:46:38,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:38,935 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:38,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:46:38,935 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-25 23:46:38,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:38,936 INFO L85 PathProgramCache]: Analyzing trace with hash 332348417, now seen corresponding path program 1 times [2022-11-25 23:46:38,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:38,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945838512] [2022-11-25 23:46:38,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:38,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:39,012 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-25 23:46:39,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:39,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945838512] [2022-11-25 23:46:39,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945838512] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:39,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81610768] [2022-11-25 23:46:39,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:39,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:39,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:39,014 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:39,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:46:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:39,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:46:39,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:39,144 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-25 23:46:39,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:39,172 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-25 23:46:39,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81610768] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:39,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [603953625] [2022-11-25 23:46:39,175 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-25 23:46:39,175 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:46:39,176 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:46:39,176 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:46:39,176 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:46:39,228 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:46:39,228 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-25 23:46:39,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:46:39,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:39,307 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-25 23:46:39,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:39,335 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-25 23:46:39,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,352 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-25 23:46:39,363 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:39,365 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-25 23:46:39,473 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-25 23:46:39,473 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-25 23:46:39,546 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:46:39,547 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-25 23:46:39,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:39,615 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-25 23:46:39,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:39,647 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-25 23:46:39,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,670 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-25 23:46:39,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:39,688 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-25 23:46:40,073 INFO L321 Elim1Store]: treesize reduction 180, result has 17.8 percent of original size [2022-11-25 23:46:40,074 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-25 23:46:40,139 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-11-25 23:46:40,140 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-25 23:46:40,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:40,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:40,561 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-25 23:46:40,562 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-25 23:46:40,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:40,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:40,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:40,638 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-25 23:46:40,639 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-25 23:46:40,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,680 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-25 23:46:40,681 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-25 23:46:40,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,738 INFO L321 Elim1Store]: treesize reduction 86, result has 19.6 percent of original size [2022-11-25 23:46:40,739 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-25 23:46:40,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:40,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:40,800 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-25 23:46:40,801 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-25 23:46:40,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:40,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:40,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:40,853 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-25 23:46:40,853 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-25 23:46:41,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 15 treesize of output 1 [2022-11-25 23:46:41,234 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-25 23:46:41,246 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-25 23:46:41,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-25 23:46:41,377 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-25 23:46:41,396 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-25 23:46:41,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:46:41,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:46:41,638 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:46:43,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [603953625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:43,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:43,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4, 4] total 13 [2022-11-25 23:46:43,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276152712] [2022-11-25 23:46:43,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:43,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:46:43,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:43,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:46:43,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:46:43,666 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:43,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:43,985 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-11-25 23:46:43,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:46:43,985 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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-25 23:46:43,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:43,986 INFO L225 Difference]: With dead ends: 73 [2022-11-25 23:46:43,986 INFO L226 Difference]: Without dead ends: 54 [2022-11-25 23:46:43,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:46:43,988 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:43,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 76 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:46:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-25 23:46:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2022-11-25 23:46:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.457142857142857) 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-25 23:46:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-11-25 23:46:44,009 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 18 [2022-11-25 23:46:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:44,009 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-11-25 23:46:44,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:44,010 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-11-25 23:46:44,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:46:44,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:44,011 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:44,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:44,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:44,215 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-25 23:46:44,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:44,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1559254851, now seen corresponding path program 1 times [2022-11-25 23:46:44,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:44,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335165780] [2022-11-25 23:46:44,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:44,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:46:44,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:44,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335165780] [2022-11-25 23:46:44,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335165780] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:44,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352705507] [2022-11-25 23:46:44,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:44,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:44,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:44,304 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:44,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:46:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:44,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:46:44,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:44,445 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-25 23:46:44,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:44,482 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-25 23:46:44,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352705507] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:44,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [845277975] [2022-11-25 23:46:44,485 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-25 23:46:44,486 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:46:44,486 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:46:44,486 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:46:44,486 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:46:44,539 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:46:44,539 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-25 23:46:44,582 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:46:44,582 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-25 23:46:44,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:44,619 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-25 23:46:44,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:44,640 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-25 23:46:44,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:44,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:44,660 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-25 23:46:44,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:44,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:44,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:44,679 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-25 23:46:44,750 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-25 23:46:44,750 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-25 23:46:44,819 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:46:44,819 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-25 23:46:44,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:44,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:44,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:44,881 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-25 23:46:44,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:44,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:44,922 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-25 23:46:44,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:44,947 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-25 23:46:44,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:44,960 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-25 23:46:45,320 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-25 23:46:45,321 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-25 23:46:45,363 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-25 23:46:45,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:45,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:45,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:45,445 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-25 23:46:45,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:45,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:45,474 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-25 23:46:45,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:45,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:45,498 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-25 23:46:45,781 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-25 23:46:45,793 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-25 23:46:45,811 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-25 23:46:45,939 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-25 23:46:45,947 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-25 23:46:45,955 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-25 23:46:46,149 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-25 23:46:46,161 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-25 23:46:46,169 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-25 23:46:46,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:46:46,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:46:46,557 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:46:48,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [845277975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:48,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:48,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4, 4] total 16 [2022-11-25 23:46:48,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449870962] [2022-11-25 23:46:48,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:48,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:46:48,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:48,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:46:48,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:46:48,824 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-25 23:46:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:50,173 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-11-25 23:46:50,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:46:50,174 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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 20 [2022-11-25 23:46:50,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:50,175 INFO L225 Difference]: With dead ends: 61 [2022-11-25 23:46:50,175 INFO L226 Difference]: Without dead ends: 55 [2022-11-25 23:46:50,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:46:50,176 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 63 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:50,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 65 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:46:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-25 23:46:50,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2022-11-25 23:46:50,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-11-25 23:46:50,188 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 20 [2022-11-25 23:46:50,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:50,188 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-11-25 23:46:50,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-25 23:46:50,189 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-11-25 23:46:50,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:46:50,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:50,189 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:50,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:50,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 23:46:50,391 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-25 23:46:50,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:50,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1092260224, now seen corresponding path program 1 times [2022-11-25 23:46:50,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:50,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767171032] [2022-11-25 23:46:50,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:50,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:46:50,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:50,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767171032] [2022-11-25 23:46:50,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767171032] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:50,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812157985] [2022-11-25 23:46:50,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:50,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:50,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:50,516 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:50,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:46:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:50,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:46:50,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:46:50,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:46:50,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812157985] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:50,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1556244807] [2022-11-25 23:46:50,681 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-25 23:46:50,681 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:46:50,682 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:46:50,682 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:46:50,682 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:46:50,734 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:46:50,735 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-25 23:46:50,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:46:50,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:50,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:50,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:50,781 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-25 23:46:50,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:50,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:50,805 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-25 23:46:50,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:50,822 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-25 23:46:50,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:50,833 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-25 23:46:50,930 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:46:50,931 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-25 23:46:50,947 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-25 23:46:51,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:51,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:51,010 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:51,011 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-25 23:46:51,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:51,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:51,049 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-25 23:46:51,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:51,070 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-25 23:46:51,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:51,083 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-25 23:46:51,376 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-25 23:46:51,377 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-25 23:46:51,486 INFO L321 Elim1Store]: treesize reduction 196, result has 10.5 percent of original size [2022-11-25 23:46:51,486 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-25 23:46:51,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:51,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:51,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:51,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:51,575 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-25 23:46:51,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:51,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:51,611 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-25 23:46:51,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:51,633 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-25 23:46:51,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:51,644 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-25 23:46:51,948 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-25 23:46:51,960 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-25 23:46:51,968 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-25 23:46:52,120 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-25 23:46:52,128 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-25 23:46:52,137 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-25 23:46:52,312 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-25 23:46:52,348 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-25 23:46:52,348 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 250 treesize of output 248 [2022-11-25 23:46:52,382 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-25 23:46:52,383 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 244 treesize of output 242 [2022-11-25 23:46:52,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:46:52,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:46:52,653 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:46:54,549 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1962#(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-25 23:46:54,549 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:46:54,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:54,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-25 23:46:54,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332497368] [2022-11-25 23:46:54,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:54,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:46:54,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:54,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:46:54,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:46:54,552 INFO L87 Difference]: Start difference. First operand 43 states and 48 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-25 23:46:54,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:54,614 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2022-11-25 23:46:54,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:46:54,615 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 21 [2022-11-25 23:46:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:54,615 INFO L225 Difference]: With dead ends: 84 [2022-11-25 23:46:54,615 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 23:46:54,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:46:54,617 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:54,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 93 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:46:54,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 23:46:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-25 23:46:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.3) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-11-25 23:46:54,630 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 21 [2022-11-25 23:46:54,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:54,631 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-11-25 23:46:54,631 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-25 23:46:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-11-25 23:46:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:46:54,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:54,632 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:54,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:54,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:54,838 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-25 23:46:54,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:54,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1680273165, now seen corresponding path program 2 times [2022-11-25 23:46:54,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:54,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017078225] [2022-11-25 23:46:54,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:54,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:46:55,060 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:55,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017078225] [2022-11-25 23:46:55,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017078225] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:55,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929840390] [2022-11-25 23:46:55,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:46:55,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:55,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:55,063 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:55,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:46:55,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 23:46:55,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:46:55,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:46:55,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:46:55,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:46:55,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929840390] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:55,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [815031617] [2022-11-25 23:46:55,275 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-25 23:46:55,275 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:46:55,276 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:46:55,276 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:46:55,276 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:46:55,324 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:46:55,325 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-25 23:46:55,368 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:46:55,369 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-25 23:46:55,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:55,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:55,407 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-25 23:46:55,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:55,422 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-25 23:46:55,431 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:55,432 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-25 23:46:55,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:55,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:55,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:55,457 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-25 23:46:55,547 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:46:55,547 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-25 23:46:55,563 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-25 23:46:55,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:55,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:55,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:55,618 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-25 23:46:55,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:55,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:55,645 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-25 23:46:55,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:55,668 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-25 23:46:55,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:55,680 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-25 23:46:56,005 INFO L321 Elim1Store]: treesize reduction 180, result has 17.8 percent of original size [2022-11-25 23:46:56,006 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-25 23:46:56,050 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-11-25 23:46:56,050 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-25 23:46:56,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:56,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:56,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:56,387 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-25 23:46:56,387 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-25 23:46:56,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:56,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:56,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:56,471 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-25 23:46:56,471 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-25 23:46:56,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:56,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:56,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:56,540 INFO L321 Elim1Store]: treesize reduction 86, result has 19.6 percent of original size [2022-11-25 23:46:56,541 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-25 23:46:56,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:56,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:56,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:56,607 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-25 23:46:56,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 415 treesize of output 404 [2022-11-25 23:46:56,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:56,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:56,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:56,668 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-25 23:46:56,668 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-25 23:46:56,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:56,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:56,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:56,720 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-25 23:46:56,720 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-25 23:46:57,054 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-25 23:46:57,063 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-25 23:46:57,072 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-25 23:46:57,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-25 23:46:57,213 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-25 23:46:57,222 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-25 23:46:57,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 11 treesize of output 7 [2022-11-25 23:46:57,386 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-25 23:46:57,393 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-25 23:46:57,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:46:57,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:46:57,625 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:46:59,584 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2299#(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-25 23:46:59,584 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:46:59,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:59,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2022-11-25 23:46:59,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863437411] [2022-11-25 23:46:59,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:46:59,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 23:46:59,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:59,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 23:46:59,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-11-25 23:46:59,587 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:59,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:59,807 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-11-25 23:46:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:46:59,807 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 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 25 [2022-11-25 23:46:59,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:59,808 INFO L225 Difference]: With dead ends: 65 [2022-11-25 23:46:59,808 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 23:46:59,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2022-11-25 23:46:59,809 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 125 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:59,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 67 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:46:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 23:46:59,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2022-11-25 23:46:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-11-25 23:46:59,824 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 25 [2022-11-25 23:46:59,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:59,825 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-11-25 23:46:59,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:59,825 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-11-25 23:46:59,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 23:46:59,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:59,826 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-25 23:46:59,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:47:00,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:47:00,033 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-25 23:47:00,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:00,033 INFO L85 PathProgramCache]: Analyzing trace with hash 313166407, now seen corresponding path program 1 times [2022-11-25 23:47:00,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:00,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104807744] [2022-11-25 23:47:00,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:00,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:00,123 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-25 23:47:00,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:00,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104807744] [2022-11-25 23:47:00,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104807744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:00,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:47:00,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:47:00,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810611825] [2022-11-25 23:47:00,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:00,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:47:00,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:00,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:47:00,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:47:00,126 INFO L87 Difference]: Start difference. First operand 44 states and 49 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-25 23:47:00,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:00,194 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2022-11-25 23:47:00,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:47:00,195 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-25 23:47:00,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:00,196 INFO L225 Difference]: With dead ends: 71 [2022-11-25 23:47:00,196 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 23:47:00,196 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-25 23:47:00,197 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-25 23:47:00,197 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-25 23:47:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 23:47:00,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2022-11-25 23:47:00,212 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-25 23:47:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-11-25 23:47:00,213 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 31 [2022-11-25 23:47:00,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:00,213 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-11-25 23:47:00,213 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-25 23:47:00,213 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-11-25 23:47:00,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 23:47:00,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:00,214 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-25 23:47:00,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 23:47:00,215 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-25 23:47:00,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:00,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1118286044, now seen corresponding path program 1 times [2022-11-25 23:47:00,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:00,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769524396] [2022-11-25 23:47:00,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:00,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:00,291 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-25 23:47:00,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:00,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769524396] [2022-11-25 23:47:00,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769524396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:00,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:47:00,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:47:00,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999163419] [2022-11-25 23:47:00,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:00,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:47:00,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:00,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:47:00,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:47:00,294 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-25 23:47:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:00,383 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-11-25 23:47:00,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:47:00,388 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-25 23:47:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:00,389 INFO L225 Difference]: With dead ends: 53 [2022-11-25 23:47:00,389 INFO L226 Difference]: Without dead ends: 51 [2022-11-25 23:47:00,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:47:00,390 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-25 23:47:00,390 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-25 23:47:00,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-25 23:47:00,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-11-25 23:47:00,410 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-25 23:47:00,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-11-25 23:47:00,411 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 32 [2022-11-25 23:47:00,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:00,413 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-11-25 23:47:00,413 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-25 23:47:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-11-25 23:47:00,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 23:47:00,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:00,419 INFO L195 NwaCegarLoop]: trace histogram [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-25 23:47:00,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 23:47:00,419 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-25 23:47:00,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:00,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1201635369, now seen corresponding path program 1 times [2022-11-25 23:47:00,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:00,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384579009] [2022-11-25 23:47:00,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:00,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:47:00,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:00,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384579009] [2022-11-25 23:47:00,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384579009] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:47:00,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237773839] [2022-11-25 23:47:00,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:00,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:47:00,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:47:00,670 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:47:00,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:47:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:00,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:47:00,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:47:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 23:47:00,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:47:00,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237773839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:00,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:47:00,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-25 23:47:00,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518668540] [2022-11-25 23:47:00,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:00,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:47:00,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:00,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:47:00,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:47:00,919 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 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-25 23:47:01,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:01,006 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-11-25 23:47:01,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:47:01,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 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 35 [2022-11-25 23:47:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:01,007 INFO L225 Difference]: With dead ends: 51 [2022-11-25 23:47:01,007 INFO L226 Difference]: Without dead ends: 49 [2022-11-25 23:47:01,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 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-25 23:47:01,008 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:47:01,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 40 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:47:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-25 23:47:01,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-11-25 23:47:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:47:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-11-25 23:47:01,033 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 35 [2022-11-25 23:47:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:01,033 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-11-25 23:47:01,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 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-25 23:47:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-11-25 23:47:01,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 23:47:01,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:01,035 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-25 23:47:01,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:47:01,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 23:47:01,239 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-25 23:47:01,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:01,240 INFO L85 PathProgramCache]: Analyzing trace with hash 633248766, now seen corresponding path program 1 times [2022-11-25 23:47:01,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:01,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348377463] [2022-11-25 23:47:01,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:01,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-25 23:47:01,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:01,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348377463] [2022-11-25 23:47:01,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348377463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:01,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:47:01,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:47:01,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283589124] [2022-11-25 23:47:01,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:01,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:47:01,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:01,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:47:01,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:47:01,327 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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-25 23:47:01,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:01,361 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-11-25 23:47:01,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:47:01,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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-25 23:47:01,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:01,363 INFO L225 Difference]: With dead ends: 47 [2022-11-25 23:47:01,363 INFO L226 Difference]: Without dead ends: 46 [2022-11-25 23:47:01,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:47:01,364 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 34 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-25 23:47:01,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 34 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:47:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-25 23:47:01,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-25 23:47:01,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.1590909090909092) 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-25 23:47:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-11-25 23:47:01,380 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 38 [2022-11-25 23:47:01,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:01,381 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-11-25 23:47:01,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:47:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-11-25 23:47:01,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 23:47:01,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:01,384 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, 1] [2022-11-25 23:47:01,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 23:47:01,385 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-25 23:47:01,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:01,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1844124606, now seen corresponding path program 1 times [2022-11-25 23:47:01,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:01,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124538211] [2022-11-25 23:47:01,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:01,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:01,552 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-25 23:47:01,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:01,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124538211] [2022-11-25 23:47:01,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124538211] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:47:01,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482514724] [2022-11-25 23:47:01,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:01,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:47:01,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:47:01,555 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:47:01,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 23:47:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:01,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 23:47:01,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:47:01,753 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-25 23:47:01,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:47:01,811 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-25 23:47:01,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482514724] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:47:01,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [70281151] [2022-11-25 23:47:01,813 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-25 23:47:01,813 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:47:01,813 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:47:01,814 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:47:01,814 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:47:01,866 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:47:01,866 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-25 23:47:01,902 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:47:01,902 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-25 23:47:01,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:01,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:01,938 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-25 23:47:01,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:01,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:01,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:01,957 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-25 23:47:01,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:01,973 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-25 23:47:01,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:01,983 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-25 23:47:02,069 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-25 23:47:02,070 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-25 23:47:02,152 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:47:02,152 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-25 23:47:02,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:02,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:02,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:02,215 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-25 23:47:02,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:02,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:02,246 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-25 23:47:02,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:02,270 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-25 23:47:02,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:02,282 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-25 23:47:02,568 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-25 23:47:02,569 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-25 23:47:02,655 INFO L321 Elim1Store]: treesize reduction 196, result has 10.5 percent of original size [2022-11-25 23:47:02,655 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-25 23:47:02,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:02,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:02,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:02,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:02,745 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-25 23:47:02,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:02,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:02,793 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-25 23:47:02,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:02,815 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-25 23:47:02,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:02,826 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-25 23:47:03,061 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-25 23:47:03,072 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-25 23:47:03,082 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-25 23:47:03,231 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-25 23:47:03,240 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-25 23:47:03,247 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-25 23:47:03,442 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-25 23:47:03,442 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-25 23:47:03,475 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-25 23:47:03,475 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-25 23:47:03,541 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-25 23:47:04,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:47:04,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:47:04,095 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:47:07,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [70281151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:07,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:47:07,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6, 6, 6] total 26 [2022-11-25 23:47:07,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577529863] [2022-11-25 23:47:07,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:07,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 23:47:07,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:07,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 23:47:07,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2022-11-25 23:47:07,875 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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-25 23:47:08,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:08,725 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-11-25 23:47:08,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 23:47:08,726 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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 39 [2022-11-25 23:47:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:08,727 INFO L225 Difference]: With dead ends: 65 [2022-11-25 23:47:08,727 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 23:47:08,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 85 SyntacticMatches, 11 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2022-11-25 23:47:08,728 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 40 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:47:08,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 29 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:47:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 23:47:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2022-11-25 23:47:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:47:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2022-11-25 23:47:08,748 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 39 [2022-11-25 23:47:08,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:08,749 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2022-11-25 23:47:08,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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-25 23:47:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-11-25 23:47:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 23:47:08,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:08,750 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2022-11-25 23:47:08,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 23:47:08,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 23:47:08,955 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-25 23:47:08,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:08,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1389331012, now seen corresponding path program 1 times [2022-11-25 23:47:08,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:08,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109696622] [2022-11-25 23:47:08,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:08,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:09,141 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 23:47:09,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:09,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109696622] [2022-11-25 23:47:09,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109696622] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:47:09,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754297359] [2022-11-25 23:47:09,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:09,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:47:09,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:47:09,144 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:47:09,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 23:47:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:09,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 23:47:09,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:47:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 23:47:09,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:47:09,424 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 23:47:09,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754297359] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:47:09,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [465850505] [2022-11-25 23:47:09,429 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-25 23:47:09,429 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:47:09,429 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:47:09,429 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:47:09,430 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:47:09,487 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:47:09,488 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-25 23:47:09,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:47:09,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:09,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:09,543 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-25 23:47:09,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:09,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:09,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:09,561 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-25 23:47:09,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:09,578 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-25 23:47:09,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:09,587 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-25 23:47:09,667 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-25 23:47:09,668 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-25 23:47:09,731 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:47:09,732 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-25 23:47:09,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:09,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:09,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:09,794 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-25 23:47:09,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:09,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:09,820 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-25 23:47:09,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:09,841 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-25 23:47:09,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:09,852 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-25 23:47:10,207 INFO L321 Elim1Store]: treesize reduction 180, result has 17.8 percent of original size [2022-11-25 23:47:10,207 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-25 23:47:10,255 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-11-25 23:47:10,255 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-25 23:47:10,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:10,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:10,607 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:10,617 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-25 23:47:10,617 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-25 23:47:10,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:10,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:10,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:10,686 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-25 23:47:10,687 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-25 23:47:10,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:10,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:10,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:10,752 INFO L321 Elim1Store]: treesize reduction 86, result has 19.6 percent of original size [2022-11-25 23:47:10,752 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-25 23:47:10,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:10,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:10,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:10,814 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-25 23:47:10,814 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-25 23:47:10,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:10,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:10,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:10,868 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-25 23:47:10,869 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 417 treesize of output 407 [2022-11-25 23:47:10,893 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:10,893 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:10,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:10,922 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-25 23:47:10,923 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 429 treesize of output 368 [2022-11-25 23:47:11,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-25 23:47:11,325 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-25 23:47:11,340 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-25 23:47:11,464 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-25 23:47:11,471 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-25 23:47:11,477 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-25 23:47:11,630 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-25 23:47:11,664 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-25 23:47:11,664 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-25 23:47:11,700 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-25 23:47:11,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 1 case distinctions, treesize of input 137 treesize of output 135 [2022-11-25 23:47:12,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:47:12,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:47:12,372 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:47:15,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [465850505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:15,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:47:15,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [8, 8, 8] total 24 [2022-11-25 23:47:15,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130706570] [2022-11-25 23:47:15,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:15,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 23:47:15,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:15,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 23:47:15,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2022-11-25 23:47:15,415 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 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-25 23:47:16,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:16,758 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-11-25 23:47:16,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:47:16,759 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 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 42 [2022-11-25 23:47:16,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:16,759 INFO L225 Difference]: With dead ends: 52 [2022-11-25 23:47:16,759 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 23:47:16,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 94 SyntacticMatches, 16 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:47:16,760 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:47:16,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:47:16,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 23:47:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 23:47:16,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:47:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 23:47:16,762 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2022-11-25 23:47:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:16,762 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 23:47:16,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 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-25 23:47:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 23:47:16,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 23:47:16,765 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-25 23:47:16,766 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-25 23:47:16,766 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-25 23:47:16,766 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-25 23:47:16,766 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-25 23:47:16,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-25 23:47:16,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-25 23:47:16,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-25 23:47:16,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-25 23:47:16,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-25 23:47:16,768 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-25 23:47:16,768 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-25 23:47:16,768 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-25 23:47:16,768 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-25 23:47:16,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 23:47:16,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:47:16,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 23:47:23,327 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 619) no Hoare annotation was computed. [2022-11-25 23:47:23,328 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-11-25 23:47:23,328 INFO L899 garLoopResultBuilder]: For program point L622-3(line 622) no Hoare annotation was computed. [2022-11-25 23:47:23,328 INFO L899 garLoopResultBuilder]: For program point L622-4(line 622) no Hoare annotation was computed. [2022-11-25 23:47:23,328 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-25 23:47:23,328 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2022-11-25 23:47:23,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2022-11-25 23:47:23,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 23:47:23,329 INFO L902 garLoopResultBuilder]: At program point L631(lines 613 632) the Hoare annotation is: true [2022-11-25 23:47:23,329 INFO L899 garLoopResultBuilder]: For program point L623(line 623) no Hoare annotation was computed. [2022-11-25 23:47:23,329 INFO L899 garLoopResultBuilder]: For program point L623-1(line 623) no Hoare annotation was computed. [2022-11-25 23:47:23,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 623) no Hoare annotation was computed. [2022-11-25 23:47:23,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2022-11-25 23:47:23,329 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-25 23:47:23,330 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 (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|)) (.cse16 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse17 (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse18 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse19 (<= 0 |ULTIMATE.start_sll_create_~len#1|)) (.cse20 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse21 (= |#NULL.offset| 0)) (.cse22 (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse23 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse24 (<= |ULTIMATE.start_node_create_~data#1| 1)) (.cse25 (<= 0 |#StackHeapBarrier|)) (.cse26 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse27 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse28 (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0)) (.cse29 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse30 (<= |ULTIMATE.start_sll_create_~len#1| 2)) (.cse31 (= |#NULL.base| 0))) (or (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 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= 2 |ULTIMATE.start_main_~expected~0#1|) .cse24 (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|) .cse25 .cse26 .cse27 (<= 0 |ULTIMATE.start_sll_get_data_at_#in~index#1|) .cse28 .cse29 .cse30 .cse31) (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 .cse18 .cse19 .cse20 .cse21 .cse22 (= |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|) .cse23 .cse24 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31))) [2022-11-25 23:47:23,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 623) no Hoare annotation was computed. [2022-11-25 23:47:23,330 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-25 23:47:23,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2022-11-25 23:47:23,331 INFO L899 garLoopResultBuilder]: For program point L609(line 609) no Hoare annotation was computed. [2022-11-25 23:47:23,331 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-25 23:47:23,331 INFO L899 garLoopResultBuilder]: For program point L609-1(line 609) no Hoare annotation was computed. [2022-11-25 23:47:23,332 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2022-11-25 23:47:23,332 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2022-11-25 23:47:23,332 INFO L899 garLoopResultBuilder]: For program point L618-3(line 618) no Hoare annotation was computed. [2022-11-25 23:47:23,332 INFO L899 garLoopResultBuilder]: For program point L585-3(line 585) no Hoare annotation was computed. [2022-11-25 23:47:23,332 INFO L899 garLoopResultBuilder]: For program point L618-4(line 618) no Hoare annotation was computed. [2022-11-25 23:47:23,334 INFO L899 garLoopResultBuilder]: For program point L585-4(line 585) no Hoare annotation was computed. [2022-11-25 23:47:23,335 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-25 23:47:23,335 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 (let ((.cse11 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse12 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse13 (= |#NULL.offset| 0))) (or (and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) .cse11 .cse12 .cse13) (and (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse11 .cse12 .cse13)))) (.cse4 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse5 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse6 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse7 (<= 0 |#StackHeapBarrier|)) (.cse8 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse9 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse10 (= |#NULL.base| 0))) (or (and (<= 1 |ULTIMATE.start_node_create_~data#1|) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 |ULTIMATE.start_node_create_#in~data#1|) (<= |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|) (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= |ULTIMATE.start_node_create_~data#1| 1) .cse7 .cse8 .cse9 (<= |ULTIMATE.start_sll_create_~len#1| 2) .cse10) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-25 23:47:23,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-11-25 23:47:23,336 INFO L899 garLoopResultBuilder]: For program point L602(line 602) no Hoare annotation was computed. [2022-11-25 23:47:23,336 INFO L899 garLoopResultBuilder]: For program point L602-1(line 602) no Hoare annotation was computed. [2022-11-25 23:47:23,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-25 23:47:23,336 INFO L899 garLoopResultBuilder]: For program point L619(line 619) no Hoare annotation was computed. [2022-11-25 23:47:23,336 INFO L899 garLoopResultBuilder]: For program point L619-1(line 619) no Hoare annotation was computed. [2022-11-25 23:47:23,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 23:47:23,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-11-25 23:47:23,337 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-25 23:47:23,337 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 619) no Hoare annotation was computed. [2022-11-25 23:47:23,337 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2022-11-25 23:47:23,343 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:47:23,346 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:47:23,372 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:47:23,373 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:47:23,375 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:47:23,376 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:47:23,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:47:23 BoogieIcfgContainer [2022-11-25 23:47:23,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:47:23,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:47:23,408 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:47:23,408 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:47:23,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:46:25" (3/4) ... [2022-11-25 23:47:23,412 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 23:47:23,426 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2022-11-25 23:47:23,427 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-25 23:47:23,427 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 23:47:23,428 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:47:23,456 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((1 <= data && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) || (((head == 0 && data == 1) && len == 2) && #NULL == 0))) && 1 <= data) && 1 <= \old(data)) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && temp <= 0) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((2 == len && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) || (((head == 0 && data == 1) && len == 2) && #NULL == 0))) && 1 <= data) && data <= 1) && \old(len) <= 2) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && #NULL == 0) [2022-11-25 23:47:23,457 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-25 23:47:23,457 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-25 23:47:23,457 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-25 23:47:23,457 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-25 23:47:23,458 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-25 23:47:23,459 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((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) || ((((((((((((((((((((((((((((((((((((((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) && 0 <= head) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 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)) && s <= 0) && head <= 0) && 0 <= head) && len <= 2) && #NULL == 0) [2022-11-25 23:47:23,477 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:47:23,477 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:47:23,477 INFO L158 Benchmark]: Toolchain (without parser) took 58797.38ms. Allocated memory was 155.2MB in the beginning and 469.8MB in the end (delta: 314.6MB). Free memory was 126.4MB in the beginning and 331.3MB in the end (delta: -204.9MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. [2022-11-25 23:47:23,478 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 123.7MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:47:23,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.41ms. Allocated memory is still 155.2MB. Free memory was 126.2MB in the beginning and 110.3MB in the end (delta: 15.9MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2022-11-25 23:47:23,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.61ms. Allocated memory is still 155.2MB. Free memory was 110.3MB in the beginning and 108.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:47:23,478 INFO L158 Benchmark]: Boogie Preprocessor took 64.32ms. Allocated memory is still 155.2MB. Free memory was 108.2MB in the beginning and 106.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:47:23,479 INFO L158 Benchmark]: RCFGBuilder took 609.81ms. Allocated memory is still 155.2MB. Free memory was 106.9MB in the beginning and 123.0MB in the end (delta: -16.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-25 23:47:23,479 INFO L158 Benchmark]: TraceAbstraction took 57490.95ms. Allocated memory was 155.2MB in the beginning and 469.8MB in the end (delta: 314.6MB). Free memory was 122.0MB in the beginning and 335.5MB in the end (delta: -213.5MB). Peak memory consumption was 283.6MB. Max. memory is 16.1GB. [2022-11-25 23:47:23,479 INFO L158 Benchmark]: Witness Printer took 69.50ms. Allocated memory is still 469.8MB. Free memory was 335.5MB in the beginning and 331.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 23:47:23,480 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.31ms. Allocated memory is still 123.7MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.41ms. Allocated memory is still 155.2MB. Free memory was 126.2MB in the beginning and 110.3MB in the end (delta: 15.9MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.61ms. Allocated memory is still 155.2MB. Free memory was 110.3MB in the beginning and 108.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.32ms. Allocated memory is still 155.2MB. Free memory was 108.2MB in the beginning and 106.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 609.81ms. Allocated memory is still 155.2MB. Free memory was 106.9MB in the beginning and 123.0MB in the end (delta: -16.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 57490.95ms. Allocated memory was 155.2MB in the beginning and 469.8MB in the end (delta: 314.6MB). Free memory was 122.0MB in the beginning and 335.5MB in the end (delta: -213.5MB). Peak memory consumption was 283.6MB. Max. memory is 16.1GB. * Witness Printer took 69.50ms. Allocated memory is still 469.8MB. Free memory was 335.5MB in the beginning and 331.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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.4s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 634 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 634 mSDsluCounter, 1060 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 731 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1406 IncrementalHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 329 mSDtfsCounter, 1406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 682 GetRequests, 436 SyntacticMatches, 65 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 22.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=17, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 172 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 30 NumberOfFragments, 1245 HoareAnnotationTreeSize, 10 FomulaSimplifications, 692 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 10 FomulaSimplificationsInter, 58773 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 597 NumberOfCodeBlocks, 580 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 749 ConstructedInterpolants, 0 QuantifiedInterpolants, 1461 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1974 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 35 InterpolantComputations, 10 PerfectInterpolantSequences, 280/347 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: 114, DAG_INTERPRETER_EARLY_EXITS: 3, TOOLS_POST_APPLICATIONS: 334, 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: 334, TOOLS_QUANTIFIERELIM_TIME: 13.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.6s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 548, 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.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 43, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 114, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 28, LOOP_SUMMARIZER_CACHE_MISSES: 28, LOOP_SUMMARIZER_OVERALL_TIME: 10.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 10.1s, 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: 4061, DAG_COMPRESSION_RETAINED_NODES: 383, 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: ((((((((((((((((((1 <= data && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) || (((head == 0 && data == 1) && len == 2) && #NULL == 0))) && 1 <= data) && 1 <= \old(data)) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && temp <= 0) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((2 == len && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) || (((head == 0 && data == 1) && len == 2) && #NULL == 0))) && 1 <= data) && data <= 1) && \old(len) <= 2) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && #NULL == 0) - InvariantResult [Line: 576]: Loop Invariant [2022-11-25 23:47:23,507 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:47:23,509 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:47:23,511 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:47:23,513 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: (((((((((((((((((((((((((((((((((((((((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) || ((((((((((((((((((((((((((((((((((((((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) && 0 <= head) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 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)) && s <= 0) && 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-25 23:47:23,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c87a52a3-c3b9-4934-ac86-42f503889151/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE