./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/array-tiling/nr2.c --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_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/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_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-tiling/nr2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/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_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/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 2a5d4c3d8db636946363c81d25b5c2e381fc236cdcde6b4765d7ce6e059d8a21 --- 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:48:04,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:48:04,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:48:04,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:48:04,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:48:04,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:48:04,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:48:04,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:48:04,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:48:04,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:48:04,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:48:04,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:48:04,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:48:04,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:48:04,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:48:04,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:48:04,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:48:04,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:48:04,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:48:04,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:48:04,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:48:04,751 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:48:04,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:48:04,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:48:04,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:48:04,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:48:04,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:48:04,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:48:04,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:48:04,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:48:04,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:48:04,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:48:04,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:48:04,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:48:04,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:48:04,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:48:04,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:48:04,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:48:04,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:48:04,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:48:04,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:48:04,789 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-25 23:48:04,812 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:48:04,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:48:04,813 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:48:04,813 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:48:04,814 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:48:04,814 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:48:04,815 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:48:04,815 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:48:04,815 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:48:04,815 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:48:04,816 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:48:04,816 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:48:04,816 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:48:04,816 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:48:04,817 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:48:04,817 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:48:04,817 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:48:04,817 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:48:04,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:48:04,818 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:48:04,819 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:48:04,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:48:04,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:48:04,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:48:04,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:48:04,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:48:04,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:48:04,820 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 23:48:04,821 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:48:04,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:48:04,821 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:48:04,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:48:04,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:48:04,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:48:04,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:48:04,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:48:04,823 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:48:04,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:48:04,823 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:48:04,823 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:48:04,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:48:04,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:48:04,824 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:48:04,824 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_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/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_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/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 -> 2a5d4c3d8db636946363c81d25b5c2e381fc236cdcde6b4765d7ce6e059d8a21 [2022-11-25 23:48:05,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:48:05,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:48:05,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:48:05,132 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:48:05,132 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:48:05,133 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/array-tiling/nr2.c [2022-11-25 23:48:08,235 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:48:08,450 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:48:08,451 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/sv-benchmarks/c/array-tiling/nr2.c [2022-11-25 23:48:08,457 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/data/f57fc39ec/ed0c88d4f96b4d48a615770e109ba3e4/FLAG974034734 [2022-11-25 23:48:08,472 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/data/f57fc39ec/ed0c88d4f96b4d48a615770e109ba3e4 [2022-11-25 23:48:08,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:48:08,476 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:48:08,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:48:08,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:48:08,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:48:08,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:48:08" (1/1) ... [2022-11-25 23:48:08,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3012d145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:08, skipping insertion in model container [2022-11-25 23:48:08,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:48:08" (1/1) ... [2022-11-25 23:48:08,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:48:08,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:48:08,673 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_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/sv-benchmarks/c/array-tiling/nr2.c[394,407] [2022-11-25 23:48:08,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:48:08,699 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:48:08,713 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_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/sv-benchmarks/c/array-tiling/nr2.c[394,407] [2022-11-25 23:48:08,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:48:08,737 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:48:08,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:08 WrapperNode [2022-11-25 23:48:08,738 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:48:08,739 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:48:08,739 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:48:08,739 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:48:08,746 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:48:08" (1/1) ... [2022-11-25 23:48:08,752 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:48:08" (1/1) ... [2022-11-25 23:48:08,774 INFO L138 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2022-11-25 23:48:08,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:48:08,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:48:08,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:48:08,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:48:08,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:08" (1/1) ... [2022-11-25 23:48:08,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:08" (1/1) ... [2022-11-25 23:48:08,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:08" (1/1) ... [2022-11-25 23:48:08,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:08" (1/1) ... [2022-11-25 23:48:08,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:08" (1/1) ... [2022-11-25 23:48:08,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:08" (1/1) ... [2022-11-25 23:48:08,798 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:08" (1/1) ... [2022-11-25 23:48:08,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:08" (1/1) ... [2022-11-25 23:48:08,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:48:08,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:48:08,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:48:08,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:48:08,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:08" (1/1) ... [2022-11-25 23:48:08,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:48:08,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:08,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:48:08,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:48:08,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:48:08,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:48:08,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:48:08,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:48:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:48:08,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:48:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:48:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:48:08,940 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:48:08,942 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:48:09,188 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:48:09,298 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:48:09,305 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-25 23:48:09,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:48:09 BoogieIcfgContainer [2022-11-25 23:48:09,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:48:09,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:48:09,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:48:09,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:48:09,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:48:08" (1/3) ... [2022-11-25 23:48:09,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539cd6fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:48:09, skipping insertion in model container [2022-11-25 23:48:09,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:08" (2/3) ... [2022-11-25 23:48:09,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539cd6fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:48:09, skipping insertion in model container [2022-11-25 23:48:09,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:48:09" (3/3) ... [2022-11-25 23:48:09,334 INFO L112 eAbstractionObserver]: Analyzing ICFG nr2.c [2022-11-25 23:48:09,350 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:48:09,351 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-25 23:48:09,397 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:48:09,404 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;@24665f70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:48:09,404 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 23:48:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 43 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:48:09,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:48:09,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:09,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:48:09,417 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:09,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:09,423 INFO L85 PathProgramCache]: Analyzing trace with hash 4507173, now seen corresponding path program 1 times [2022-11-25 23:48:09,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:09,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991454513] [2022-11-25 23:48:09,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:09,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:09,901 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:48:09,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:09,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991454513] [2022-11-25 23:48:09,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991454513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:09,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:09,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:48:09,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129102762] [2022-11-25 23:48:09,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:09,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:48:09,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:09,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:48:09,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:09,967 INFO L87 Difference]: Start difference. First operand has 44 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 43 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) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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:48:10,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:10,031 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-11-25 23:48:10,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:48:10,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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:48:10,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:10,042 INFO L225 Difference]: With dead ends: 58 [2022-11-25 23:48:10,042 INFO L226 Difference]: Without dead ends: 40 [2022-11-25 23:48:10,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:10,048 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 87 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:10,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 38 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:48:10,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-25 23:48:10,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-25 23:48:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.72) internal successors, (43), 39 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:48:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-11-25 23:48:10,085 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 4 [2022-11-25 23:48:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:10,086 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-11-25 23:48:10,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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:48:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-11-25 23:48:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:48:10,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:10,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:48:10,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:48:10,088 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:10,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:10,089 INFO L85 PathProgramCache]: Analyzing trace with hash 139722417, now seen corresponding path program 1 times [2022-11-25 23:48:10,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:10,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590217287] [2022-11-25 23:48:10,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:10,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:10,400 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:48:10,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:10,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590217287] [2022-11-25 23:48:10,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590217287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:10,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:10,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:48:10,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678249590] [2022-11-25 23:48:10,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:10,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:48:10,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:10,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:48:10,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:48:10,405 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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:48:10,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:10,475 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-11-25 23:48:10,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:48:10,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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:48:10,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:10,478 INFO L225 Difference]: With dead ends: 40 [2022-11-25 23:48:10,479 INFO L226 Difference]: Without dead ends: 39 [2022-11-25 23:48:10,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:48:10,485 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 116 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:10,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 33 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:48:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-25 23:48:10,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-25 23:48:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.68) internal successors, (42), 38 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:48:10,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-11-25 23:48:10,500 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 5 [2022-11-25 23:48:10,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:10,500 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-11-25 23:48:10,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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:48:10,501 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-11-25 23:48:10,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:48:10,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:10,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:10,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:48:10,504 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:10,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:10,507 INFO L85 PathProgramCache]: Analyzing trace with hash 647276565, now seen corresponding path program 1 times [2022-11-25 23:48:10,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:10,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207885209] [2022-11-25 23:48:10,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:10,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:10,592 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:48:10,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:10,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207885209] [2022-11-25 23:48:10,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207885209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:10,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:10,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:48:10,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549460042] [2022-11-25 23:48:10,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:10,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:48:10,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:10,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:48:10,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:48:10,595 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:48:10,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:10,673 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2022-11-25 23:48:10,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:48:10,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:48:10,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:10,676 INFO L225 Difference]: With dead ends: 98 [2022-11-25 23:48:10,676 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 23:48:10,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:48:10,678 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:10,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 49 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:48:10,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 23:48:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2022-11-25 23:48:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 39 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:48:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-11-25 23:48:10,685 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 8 [2022-11-25 23:48:10,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:10,687 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-11-25 23:48:10,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:48:10,688 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-11-25 23:48:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:48:10,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:10,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:10,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:48:10,690 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:10,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1409365658, now seen corresponding path program 1 times [2022-11-25 23:48:10,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:10,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017305960] [2022-11-25 23:48:10,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:10,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:10,835 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:48:10,836 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:10,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017305960] [2022-11-25 23:48:10,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017305960] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:10,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:10,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:48:10,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507781294] [2022-11-25 23:48:10,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:10,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:48:10,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:10,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:48:10,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:10,838 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:48:10,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:10,927 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-11-25 23:48:10,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:48:10,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-11-25 23:48:10,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:10,929 INFO L225 Difference]: With dead ends: 45 [2022-11-25 23:48:10,929 INFO L226 Difference]: Without dead ends: 43 [2022-11-25 23:48:10,930 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:48:10,933 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:10,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 86 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:48:10,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-25 23:48:10,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-25 23:48:10,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 42 states have internal predecessors, (46), 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:48:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-11-25 23:48:10,940 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 9 [2022-11-25 23:48:10,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:10,940 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-11-25 23:48:10,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:48:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-11-25 23:48:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:48:10,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:10,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:10,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:48:10,942 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:10,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:10,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1409346149, now seen corresponding path program 1 times [2022-11-25 23:48:10,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:10,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422046264] [2022-11-25 23:48:10,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:10,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:11,029 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:48:11,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:11,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422046264] [2022-11-25 23:48:11,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422046264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:11,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:11,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:48:11,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300415344] [2022-11-25 23:48:11,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:11,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:48:11,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:11,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:48:11,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:11,035 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:48:11,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:11,093 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2022-11-25 23:48:11,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:48:11,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-11-25 23:48:11,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:11,101 INFO L225 Difference]: With dead ends: 97 [2022-11-25 23:48:11,101 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 23:48:11,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:11,107 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 50 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:11,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 53 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:48:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 23:48:11,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2022-11-25 23:48:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 43 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:48:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-11-25 23:48:11,120 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 9 [2022-11-25 23:48:11,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:11,121 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-11-25 23:48:11,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:48:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-11-25 23:48:11,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:48:11,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:11,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:11,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:48:11,122 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:11,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:11,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1409346469, now seen corresponding path program 1 times [2022-11-25 23:48:11,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:11,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749516971] [2022-11-25 23:48:11,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:11,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:11,176 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:48:11,176 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:11,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749516971] [2022-11-25 23:48:11,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749516971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:11,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:11,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:48:11,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222336755] [2022-11-25 23:48:11,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:11,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:48:11,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:11,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:48:11,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:48:11,178 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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:48:11,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:11,255 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-11-25 23:48:11,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:48:11,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-11-25 23:48:11,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:11,256 INFO L225 Difference]: With dead ends: 77 [2022-11-25 23:48:11,256 INFO L226 Difference]: Without dead ends: 73 [2022-11-25 23:48:11,256 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:48:11,257 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:11,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 40 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:48:11,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-25 23:48:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2022-11-25 23:48:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 61 states have internal predecessors, (74), 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:48:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2022-11-25 23:48:11,266 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 9 [2022-11-25 23:48:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:11,267 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2022-11-25 23:48:11,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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:48:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2022-11-25 23:48:11,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:48:11,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:11,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:11,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:48:11,268 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:11,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:11,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1467256099, now seen corresponding path program 1 times [2022-11-25 23:48:11,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:11,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591225889] [2022-11-25 23:48:11,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:11,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:11,315 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:48:11,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:11,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591225889] [2022-11-25 23:48:11,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591225889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:11,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:11,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:48:11,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991819059] [2022-11-25 23:48:11,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:11,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:48:11,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:11,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:48:11,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:11,318 INFO L87 Difference]: Start difference. First operand 62 states and 74 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:48:11,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:11,403 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-11-25 23:48:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:48:11,404 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:48:11,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:11,405 INFO L225 Difference]: With dead ends: 84 [2022-11-25 23:48:11,405 INFO L226 Difference]: Without dead ends: 82 [2022-11-25 23:48:11,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:11,406 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:11,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 48 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:48:11,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-25 23:48:11,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2022-11-25 23:48:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.5) internal successors, (78), 65 states have internal predecessors, (78), 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:48:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2022-11-25 23:48:11,414 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 11 [2022-11-25 23:48:11,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:11,415 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2022-11-25 23:48:11,415 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:48:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2022-11-25 23:48:11,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 23:48:11,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:11,416 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:11,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:48:11,416 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:11,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:11,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1188104070, now seen corresponding path program 1 times [2022-11-25 23:48:11,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:11,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60860150] [2022-11-25 23:48:11,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:11,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:48:11,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:11,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60860150] [2022-11-25 23:48:11,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60860150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:11,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:11,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:48:11,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656385296] [2022-11-25 23:48:11,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:11,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:48:11,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:11,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:48:11,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:11,568 INFO L87 Difference]: Start difference. First operand 66 states and 78 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:48:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:11,649 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2022-11-25 23:48:11,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:48:11,650 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 12 [2022-11-25 23:48:11,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:11,651 INFO L225 Difference]: With dead ends: 85 [2022-11-25 23:48:11,651 INFO L226 Difference]: Without dead ends: 76 [2022-11-25 23:48:11,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:11,652 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 65 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:11,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 36 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:48:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-25 23:48:11,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-11-25 23:48:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 65 states have internal predecessors, (77), 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:48:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-11-25 23:48:11,661 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 12 [2022-11-25 23:48:11,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:11,661 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-11-25 23:48:11,661 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:48:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-11-25 23:48:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:48:11,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:11,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:11,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:48:11,663 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:11,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:11,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1144196077, now seen corresponding path program 1 times [2022-11-25 23:48:11,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:11,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145293329] [2022-11-25 23:48:11,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:11,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:11,714 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:48:11,715 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:11,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145293329] [2022-11-25 23:48:11,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145293329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:11,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:11,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:48:11,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080310223] [2022-11-25 23:48:11,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:11,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:48:11,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:11,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:48:11,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:11,717 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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:48:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:11,772 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2022-11-25 23:48:11,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:48:11,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 23:48:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:11,773 INFO L225 Difference]: With dead ends: 82 [2022-11-25 23:48:11,773 INFO L226 Difference]: Without dead ends: 80 [2022-11-25 23:48:11,774 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:48:11,774 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:11,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:48:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-25 23:48:11,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2022-11-25 23:48:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.467741935483871) internal successors, (91), 75 states have internal predecessors, (91), 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:48:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2022-11-25 23:48:11,783 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 14 [2022-11-25 23:48:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:11,783 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2022-11-25 23:48:11,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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:48:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-11-25 23:48:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:48:11,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:11,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:11,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:48:11,785 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:11,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:11,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1884773674, now seen corresponding path program 1 times [2022-11-25 23:48:11,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:11,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076028241] [2022-11-25 23:48:11,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:11,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:11,850 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:48:11,850 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:11,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076028241] [2022-11-25 23:48:11,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076028241] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:48:11,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835922862] [2022-11-25 23:48:11,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:11,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:11,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:11,857 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:48:11,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:48:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:11,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:48:11,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:48:12,038 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:48:12,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:48:12,080 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:48:12,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835922862] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:48:12,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1591240511] [2022-11-25 23:48:12,102 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-25 23:48:12,102 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:48:12,106 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:48:12,112 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:48:12,112 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:48:12,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:12,308 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:48:12,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-25 23:48:12,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:12,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-25 23:48:12,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:12,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 95 [2022-11-25 23:48:12,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:12,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 95 [2022-11-25 23:48:13,001 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:48:15,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1591240511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:15,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:48:15,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 5, 5] total 14 [2022-11-25 23:48:15,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580956691] [2022-11-25 23:48:15,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:15,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:48:15,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:15,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:48:15,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:48:15,707 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:16,080 INFO L93 Difference]: Finished difference Result 152 states and 176 transitions. [2022-11-25 23:48:16,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:48:16,081 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 23:48:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:16,081 INFO L225 Difference]: With dead ends: 152 [2022-11-25 23:48:16,081 INFO L226 Difference]: Without dead ends: 104 [2022-11-25 23:48:16,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:48:16,082 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 109 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:16,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 39 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:48:16,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-25 23:48:16,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 82. [2022-11-25 23:48:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 81 states have internal predecessors, (98), 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:48:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2022-11-25 23:48:16,098 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 17 [2022-11-25 23:48:16,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:16,099 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2022-11-25 23:48:16,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:16,099 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2022-11-25 23:48:16,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:48:16,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:16,100 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:16,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 23:48:16,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 23:48:16,305 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:16,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:16,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1531937506, now seen corresponding path program 1 times [2022-11-25 23:48:16,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:16,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275067392] [2022-11-25 23:48:16,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:16,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:16,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:48:16,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:16,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275067392] [2022-11-25 23:48:16,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275067392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:16,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:16,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:48:16,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685927877] [2022-11-25 23:48:16,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:16,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:48:16,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:16,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:48:16,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:16,364 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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:48:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:16,417 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2022-11-25 23:48:16,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:48:16,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2022-11-25 23:48:16,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:16,419 INFO L225 Difference]: With dead ends: 82 [2022-11-25 23:48:16,419 INFO L226 Difference]: Without dead ends: 81 [2022-11-25 23:48:16,419 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:48:16,420 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:16,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 56 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:48:16,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-25 23:48:16,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-25 23:48:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 68 states have (on average 1.411764705882353) internal successors, (96), 80 states have internal predecessors, (96), 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:48:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2022-11-25 23:48:16,435 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 23 [2022-11-25 23:48:16,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:16,436 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2022-11-25 23:48:16,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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:48:16,436 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2022-11-25 23:48:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 23:48:16,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:16,437 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:16,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 23:48:16,437 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:16,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:16,438 INFO L85 PathProgramCache]: Analyzing trace with hash -245422336, now seen corresponding path program 1 times [2022-11-25 23:48:16,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:16,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878635402] [2022-11-25 23:48:16,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:16,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:48:16,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:16,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878635402] [2022-11-25 23:48:16,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878635402] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:48:16,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571297135] [2022-11-25 23:48:16,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:16,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:16,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:16,534 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:48:16,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:48:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:16,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:48:16,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:48:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:48:16,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:48:16,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571297135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:16,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:48:16,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-25 23:48:16,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122725242] [2022-11-25 23:48:16,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:16,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:48:16,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:16,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:48:16,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:48:16,657 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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:48:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:16,737 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-11-25 23:48:16,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:48:16,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 23:48:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:16,738 INFO L225 Difference]: With dead ends: 92 [2022-11-25 23:48:16,739 INFO L226 Difference]: Without dead ends: 91 [2022-11-25 23:48:16,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:48:16,740 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 55 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:16,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 64 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:48:16,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-25 23:48:16,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 73. [2022-11-25 23:48:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.360655737704918) internal successors, (83), 72 states have internal predecessors, (83), 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:48:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-11-25 23:48:16,752 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 24 [2022-11-25 23:48:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:16,752 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-11-25 23:48:16,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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:48:16,753 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-11-25 23:48:16,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 23:48:16,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:16,754 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:16,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:48:16,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 23:48:16,959 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:16,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:16,959 INFO L85 PathProgramCache]: Analyzing trace with hash 372341227, now seen corresponding path program 1 times [2022-11-25 23:48:16,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:16,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875836283] [2022-11-25 23:48:16,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:16,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:48:17,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:17,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875836283] [2022-11-25 23:48:17,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875836283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:17,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:17,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:48:17,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602395304] [2022-11-25 23:48:17,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:17,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:48:17,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:17,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:48:17,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:17,017 INFO L87 Difference]: Start difference. First operand 73 states and 83 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:48:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:17,091 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-11-25 23:48:17,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:48:17,092 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 26 [2022-11-25 23:48:17,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:17,092 INFO L225 Difference]: With dead ends: 81 [2022-11-25 23:48:17,092 INFO L226 Difference]: Without dead ends: 79 [2022-11-25 23:48:17,093 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:48:17,094 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:17,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 54 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:48:17,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-25 23:48:17,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2022-11-25 23:48:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 74 states have internal predecessors, (85), 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:48:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2022-11-25 23:48:17,109 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 26 [2022-11-25 23:48:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:17,110 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-11-25 23:48:17,110 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:48:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-11-25 23:48:17,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 23:48:17,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:17,113 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:17,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 23:48:17,114 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:17,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:17,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1562969145, now seen corresponding path program 1 times [2022-11-25 23:48:17,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:17,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663472830] [2022-11-25 23:48:17,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:17,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:48:17,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:17,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663472830] [2022-11-25 23:48:17,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663472830] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:48:17,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349172351] [2022-11-25 23:48:17,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:17,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:17,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:17,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:48:17,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:48:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:17,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:48:17,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:48:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:48:17,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:48:17,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349172351] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:17,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:48:17,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2022-11-25 23:48:17,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242745805] [2022-11-25 23:48:17,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:17,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:48:17,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:17,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:48:17,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:48:17,358 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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:48:17,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:17,447 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2022-11-25 23:48:17,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:48:17,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 29 [2022-11-25 23:48:17,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:17,448 INFO L225 Difference]: With dead ends: 153 [2022-11-25 23:48:17,448 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 23:48:17,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:48:17,449 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 69 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:17,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 72 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:48:17,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 23:48:17,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2022-11-25 23:48:17,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 73 states have internal predecessors, (81), 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:48:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-11-25 23:48:17,478 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 29 [2022-11-25 23:48:17,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:17,478 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-11-25 23:48:17,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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:48:17,479 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-11-25 23:48:17,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 23:48:17,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:17,480 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:17,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:48:17,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:17,686 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:17,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:17,687 INFO L85 PathProgramCache]: Analyzing trace with hash -98238649, now seen corresponding path program 1 times [2022-11-25 23:48:17,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:17,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716017521] [2022-11-25 23:48:17,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:17,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:48:17,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:17,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716017521] [2022-11-25 23:48:17,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716017521] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:48:17,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799936844] [2022-11-25 23:48:17,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:17,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:17,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:17,768 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:48:17,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:48:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:17,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:48:17,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:48:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:48:17,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:48:17,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799936844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:17,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:48:17,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-25 23:48:17,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740778165] [2022-11-25 23:48:17,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:17,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:48:17,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:17,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:48:17,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:48:17,906 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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:48:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:18,006 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-11-25 23:48:18,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:48:18,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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 33 [2022-11-25 23:48:18,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:18,009 INFO L225 Difference]: With dead ends: 74 [2022-11-25 23:48:18,010 INFO L226 Difference]: Without dead ends: 71 [2022-11-25 23:48:18,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:48:18,013 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:18,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 58 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:48:18,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-25 23:48:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-25 23:48:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 70 states have internal predecessors, (77), 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:48:18,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-11-25 23:48:18,029 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 33 [2022-11-25 23:48:18,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:18,029 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-11-25 23:48:18,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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:48:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-11-25 23:48:18,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 23:48:18,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:18,032 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:18,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:48:18,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 23:48:18,239 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:18,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:18,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1249569251, now seen corresponding path program 1 times [2022-11-25 23:48:18,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:18,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316508439] [2022-11-25 23:48:18,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:18,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:48:18,355 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:18,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316508439] [2022-11-25 23:48:18,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316508439] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:48:18,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108745807] [2022-11-25 23:48:18,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:18,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:18,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:18,358 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:48:18,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:48:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:18,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:48:18,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:48:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:48:18,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:48:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:48:18,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108745807] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:48:18,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [635793202] [2022-11-25 23:48:18,572 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-25 23:48:18,572 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:48:18,572 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:48:18,572 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:48:18,573 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:48:18,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:18,650 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:48:18,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-25 23:48:18,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:18,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-25 23:48:18,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:18,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 95 [2022-11-25 23:48:18,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:18,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:18,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 20 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 110 [2022-11-25 23:48:19,504 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 18 treesize of output 14 [2022-11-25 23:48:19,718 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 18 treesize of output 14 [2022-11-25 23:48:20,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:20,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:20,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:20,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:20,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:20,060 INFO L321 Elim1Store]: treesize reduction 44, result has 49.4 percent of original size [2022-11-25 23:48:20,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 347 treesize of output 395 [2022-11-25 23:48:20,454 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 18 treesize of output 14 [2022-11-25 23:48:20,610 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 18 treesize of output 14 [2022-11-25 23:48:20,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:20,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:20,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:20,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:20,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:20,841 INFO L321 Elim1Store]: treesize reduction 44, result has 49.4 percent of original size [2022-11-25 23:48:20,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 347 treesize of output 395 [2022-11-25 23:48:21,160 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 18 treesize of output 14 [2022-11-25 23:48:21,316 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 18 treesize of output 14 [2022-11-25 23:48:21,449 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 18 treesize of output 14 [2022-11-25 23:48:21,568 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:48:23,182 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3180#(and (not (<= (* 2 |ULTIMATE.start_main_~i~0#1|) 2147483647)) (= 2 |ULTIMATE.start_main_~MINVAL~0#1|) (<= ~CELLCOUNT~0 2147483647) (<= 1 ~CELLCOUNT~0) (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start_main_~j~0#1| 2) (<= |ULTIMATE.start_main_~MINVAL~0#1| |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1073741824) (= |#NULL.offset| 0) (= 1 |ULTIMATE.start_main_~DEFAULTVALUE~0#1|) (<= 0 |ULTIMATE.start_main_~#volArray~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-25 23:48:23,182 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:48:23,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:48:23,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-11-25 23:48:23,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765267782] [2022-11-25 23:48:23,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:48:23,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:48:23,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:23,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:48:23,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2022-11-25 23:48:23,184 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 10 states have internal predecessors, (79), 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:48:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:23,341 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-11-25 23:48:23,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:48:23,341 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 10 states have internal predecessors, (79), 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 34 [2022-11-25 23:48:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:23,343 INFO L225 Difference]: With dead ends: 114 [2022-11-25 23:48:23,343 INFO L226 Difference]: Without dead ends: 111 [2022-11-25 23:48:23,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 74 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2022-11-25 23:48:23,344 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:23,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 83 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:48:23,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-25 23:48:23,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2022-11-25 23:48:23,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 97 states have (on average 1.2371134020618557) internal successors, (120), 104 states have internal predecessors, (120), 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:48:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2022-11-25 23:48:23,361 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 34 [2022-11-25 23:48:23,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:23,361 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2022-11-25 23:48:23,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 10 states have internal predecessors, (79), 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:48:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2022-11-25 23:48:23,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 23:48:23,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:23,363 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:23,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:48:23,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 23:48:23,566 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:23,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:23,567 INFO L85 PathProgramCache]: Analyzing trace with hash 81941193, now seen corresponding path program 1 times [2022-11-25 23:48:23,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:23,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163844489] [2022-11-25 23:48:23,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:23,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:48:23,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:23,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163844489] [2022-11-25 23:48:23,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163844489] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:48:23,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885945448] [2022-11-25 23:48:23,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:23,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:23,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:23,674 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:48:23,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:48:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:23,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:48:23,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:48:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:48:23,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:48:23,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885945448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:23,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:48:23,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-11-25 23:48:23,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605139780] [2022-11-25 23:48:23,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:23,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:48:23,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:23,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:48:23,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:48:23,821 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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:48:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:23,940 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2022-11-25 23:48:23,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:48:23,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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:48:23,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:23,941 INFO L225 Difference]: With dead ends: 108 [2022-11-25 23:48:23,941 INFO L226 Difference]: Without dead ends: 107 [2022-11-25 23:48:23,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:48:23,942 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:23,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 61 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:48:23,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-25 23:48:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2022-11-25 23:48:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 104 states have internal predecessors, (118), 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:48:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2022-11-25 23:48:23,957 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 35 [2022-11-25 23:48:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:23,958 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2022-11-25 23:48:23,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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:48:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2022-11-25 23:48:23,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 23:48:23,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:23,961 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:23,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:48:24,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:24,169 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:24,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:24,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1968579866, now seen corresponding path program 1 times [2022-11-25 23:48:24,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:24,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504656193] [2022-11-25 23:48:24,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:24,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 23:48:24,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:24,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504656193] [2022-11-25 23:48:24,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504656193] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:48:24,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553389994] [2022-11-25 23:48:24,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:24,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:24,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:24,361 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:48:24,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:48:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:24,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:48:24,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:48:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 23:48:24,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:48:24,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553389994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:24,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:48:24,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-25 23:48:24,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155608743] [2022-11-25 23:48:24,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:24,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:48:24,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:24,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:48:24,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:48:24,463 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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:48:24,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:24,550 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2022-11-25 23:48:24,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:48:24,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-25 23:48:24,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:24,552 INFO L225 Difference]: With dead ends: 105 [2022-11-25 23:48:24,553 INFO L226 Difference]: Without dead ends: 104 [2022-11-25 23:48:24,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:48:24,554 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 47 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:24,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 48 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:48:24,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-25 23:48:24,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-11-25 23:48:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 97 states have (on average 1.2061855670103092) internal successors, (117), 103 states have internal predecessors, (117), 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:48:24,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2022-11-25 23:48:24,569 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 36 [2022-11-25 23:48:24,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:24,570 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2022-11-25 23:48:24,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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:48:24,570 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2022-11-25 23:48:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 23:48:24,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:24,571 INFO L195 NwaCegarLoop]: trace histogram [3, 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:48:24,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:48:24,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 23:48:24,776 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:24,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:24,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1754790235, now seen corresponding path program 1 times [2022-11-25 23:48:24,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:24,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462491950] [2022-11-25 23:48:24,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:24,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 23:48:24,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:24,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462491950] [2022-11-25 23:48:24,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462491950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:24,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:24,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:48:24,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93085475] [2022-11-25 23:48:24,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:24,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:48:24,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:24,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:48:24,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:24,841 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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:48:24,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:24,918 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2022-11-25 23:48:24,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:48:24,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-25 23:48:24,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:24,921 INFO L225 Difference]: With dead ends: 105 [2022-11-25 23:48:24,921 INFO L226 Difference]: Without dead ends: 104 [2022-11-25 23:48:24,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:24,926 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:24,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 41 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:48:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-25 23:48:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-11-25 23:48:24,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 97 states have (on average 1.1855670103092784) internal successors, (115), 103 states have internal predecessors, (115), 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:48:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2022-11-25 23:48:24,941 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 36 [2022-11-25 23:48:24,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:24,941 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2022-11-25 23:48:24,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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:48:24,941 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2022-11-25 23:48:24,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 23:48:24,942 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:24,943 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:24,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 23:48:24,943 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:24,944 INFO L85 PathProgramCache]: Analyzing trace with hash 896433838, now seen corresponding path program 1 times [2022-11-25 23:48:24,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:24,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60715830] [2022-11-25 23:48:24,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:24,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 23:48:25,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:25,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60715830] [2022-11-25 23:48:25,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60715830] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:48:25,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872570153] [2022-11-25 23:48:25,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:25,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:25,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:25,037 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:48:25,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 23:48:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:25,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:48:25,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:48:25,149 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 23:48:25,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:48:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 23:48:25,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872570153] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:48:25,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [469425857] [2022-11-25 23:48:25,212 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-25 23:48:25,212 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:48:25,213 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:48:25,214 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:48:25,214 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:48:25,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:25,333 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:48:25,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-25 23:48:25,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:25,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-25 23:48:25,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:25,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 95 [2022-11-25 23:48:25,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:25,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 95 [2022-11-25 23:48:25,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:25,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:25,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:25,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:25,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:25,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:25,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:25,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:25,993 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-25 23:48:25,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 594 treesize of output 585 [2022-11-25 23:48:26,417 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 18 treesize of output 14 [2022-11-25 23:48:26,618 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 18 treesize of output 14 [2022-11-25 23:48:26,655 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 18 treesize of output 14 [2022-11-25 23:48:26,726 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 18 treesize of output 14 [2022-11-25 23:48:26,929 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 18 treesize of output 14 [2022-11-25 23:48:27,174 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 18 treesize of output 14 [2022-11-25 23:48:27,365 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 18 treesize of output 14 [2022-11-25 23:48:27,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-25 23:48:27,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:27,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:27,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:27,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:27,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:27,908 INFO L321 Elim1Store]: treesize reduction 44, result has 49.4 percent of original size [2022-11-25 23:48:27,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 348 treesize of output 396 [2022-11-25 23:48:28,714 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:48:31,441 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4640#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|) (= 2 |ULTIMATE.start_main_~MINVAL~0#1|) (<= ~CELLCOUNT~0 2147483647) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 1 ~CELLCOUNT~0) (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< 2147483646 |ULTIMATE.start_main_#t~post7#1|) (<= |ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 1) (= |#NULL.offset| 0) (= 1 |ULTIMATE.start_main_~DEFAULTVALUE~0#1|) (<= 0 |ULTIMATE.start_main_~#volArray~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-25 23:48:31,441 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:48:31,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:48:31,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-25 23:48:31,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22204342] [2022-11-25 23:48:31,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:48:31,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 23:48:31,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:31,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 23:48:31,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2022-11-25 23:48:31,444 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 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:48:31,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:31,651 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2022-11-25 23:48:31,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:48:31,652 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 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) Word has length 37 [2022-11-25 23:48:31,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:31,653 INFO L225 Difference]: With dead ends: 114 [2022-11-25 23:48:31,653 INFO L226 Difference]: Without dead ends: 113 [2022-11-25 23:48:31,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 80 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2022-11-25 23:48:31,655 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 68 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:31,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 87 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:48:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-25 23:48:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-11-25 23:48:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 106 states have (on average 1.169811320754717) internal successors, (124), 112 states have internal predecessors, (124), 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:48:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2022-11-25 23:48:31,674 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 37 [2022-11-25 23:48:31,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:31,675 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2022-11-25 23:48:31,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 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:48:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2022-11-25 23:48:31,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-25 23:48:31,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:31,676 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:31,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 23:48:31,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:31,881 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:31,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:31,882 INFO L85 PathProgramCache]: Analyzing trace with hash 104984720, now seen corresponding path program 1 times [2022-11-25 23:48:31,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:31,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566988915] [2022-11-25 23:48:31,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:31,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 23:48:32,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:32,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566988915] [2022-11-25 23:48:32,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566988915] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:48:32,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498489226] [2022-11-25 23:48:32,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:32,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:32,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:32,085 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:48:32,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 23:48:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:32,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 23:48:32,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:48:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:48:32,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:48:32,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498489226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:32,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:48:32,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2022-11-25 23:48:32,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765006824] [2022-11-25 23:48:32,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:32,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:48:32,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:32,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:48:32,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:48:32,334 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 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:48:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:32,517 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2022-11-25 23:48:32,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:48:32,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 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 44 [2022-11-25 23:48:32,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:32,519 INFO L225 Difference]: With dead ends: 114 [2022-11-25 23:48:32,519 INFO L226 Difference]: Without dead ends: 112 [2022-11-25 23:48:32,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:48:32,522 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 39 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:32,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 55 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:48:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-25 23:48:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2022-11-25 23:48:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.1320754716981132) internal successors, (120), 110 states have internal predecessors, (120), 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:48:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2022-11-25 23:48:32,538 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 44 [2022-11-25 23:48:32,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:32,539 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2022-11-25 23:48:32,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 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:48:32,539 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2022-11-25 23:48:32,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 23:48:32,540 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:32,540 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:32,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 23:48:32,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:32,750 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:32,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:32,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1040440888, now seen corresponding path program 1 times [2022-11-25 23:48:32,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:32,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929953168] [2022-11-25 23:48:32,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:32,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 23:48:32,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:32,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929953168] [2022-11-25 23:48:32,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929953168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:32,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:32,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:48:32,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876500384] [2022-11-25 23:48:32,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:32,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:48:32,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:32,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:48:32,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:32,805 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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:48:32,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:32,869 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-11-25 23:48:32,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:48:32,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 45 [2022-11-25 23:48:32,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:32,873 INFO L225 Difference]: With dead ends: 111 [2022-11-25 23:48:32,873 INFO L226 Difference]: Without dead ends: 109 [2022-11-25 23:48:32,873 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:48:32,874 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:32,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 27 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:48:32,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-25 23:48:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-11-25 23:48:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 106 states have (on average 1.0943396226415094) internal successors, (116), 108 states have internal predecessors, (116), 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:48:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2022-11-25 23:48:32,890 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 45 [2022-11-25 23:48:32,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:32,890 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2022-11-25 23:48:32,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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:48:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2022-11-25 23:48:32,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 23:48:32,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:32,891 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:32,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 23:48:32,892 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:32,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:32,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1619591050, now seen corresponding path program 2 times [2022-11-25 23:48:32,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:32,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091479597] [2022-11-25 23:48:32,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:32,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:33,536 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:48:33,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:33,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091479597] [2022-11-25 23:48:33,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091479597] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:48:33,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909296191] [2022-11-25 23:48:33,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:48:33,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:33,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:33,542 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:48:33,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 23:48:33,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 23:48:33,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:48:33,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:48:33,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:48:33,701 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-25 23:48:33,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:48:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-25 23:48:33,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909296191] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:48:33,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1662680038] [2022-11-25 23:48:33,782 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-25 23:48:33,783 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:48:33,784 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:48:33,784 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:48:33,784 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:48:33,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:33,897 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:48:33,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-25 23:48:33,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:33,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-25 23:48:34,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:34,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 95 [2022-11-25 23:48:34,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:34,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 95 [2022-11-25 23:48:34,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:34,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:34,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:34,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:34,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:34,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:34,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:34,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:34,488 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-25 23:48:34,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 594 treesize of output 585 [2022-11-25 23:48:34,860 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 18 treesize of output 14 [2022-11-25 23:48:35,060 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 18 treesize of output 14 [2022-11-25 23:48:35,097 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 18 treesize of output 14 [2022-11-25 23:48:35,186 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 18 treesize of output 14 [2022-11-25 23:48:35,349 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 18 treesize of output 14 [2022-11-25 23:48:35,570 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 18 treesize of output 14 [2022-11-25 23:48:35,795 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 18 treesize of output 14 [2022-11-25 23:48:35,971 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 18 treesize of output 14 [2022-11-25 23:48:36,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:36,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:36,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:36,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:36,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:36,402 INFO L321 Elim1Store]: treesize reduction 44, result has 49.4 percent of original size [2022-11-25 23:48:36,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 348 treesize of output 396 [2022-11-25 23:48:37,086 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:48:40,405 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5892#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|) (= 2 |ULTIMATE.start_main_~MINVAL~0#1|) (<= ~CELLCOUNT~0 2147483647) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 1 ~CELLCOUNT~0) (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< 2147483646 |ULTIMATE.start_main_#t~post7#1|) (<= |ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 1) (= |#NULL.offset| 0) (= 1 |ULTIMATE.start_main_~DEFAULTVALUE~0#1|) (<= 0 |ULTIMATE.start_main_~#volArray~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-25 23:48:40,405 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:48:40,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:48:40,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 2, 2] total 18 [2022-11-25 23:48:40,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309084009] [2022-11-25 23:48:40,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:48:40,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 23:48:40,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:40,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 23:48:40,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 23:48:40,408 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 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:48:40,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:40,946 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2022-11-25 23:48:40,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:48:40,946 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 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 46 [2022-11-25 23:48:40,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:40,947 INFO L225 Difference]: With dead ends: 125 [2022-11-25 23:48:40,947 INFO L226 Difference]: Without dead ends: 92 [2022-11-25 23:48:40,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 111 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=218, Invalid=1674, Unknown=0, NotChecked=0, Total=1892 [2022-11-25 23:48:40,949 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 114 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:40,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 84 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:48:40,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-25 23:48:40,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-25 23:48:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 90 states have (on average 1.0666666666666667) internal successors, (96), 91 states have internal predecessors, (96), 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:48:40,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-11-25 23:48:40,963 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 46 [2022-11-25 23:48:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:40,964 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-11-25 23:48:40,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 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:48:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-11-25 23:48:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 23:48:40,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:40,964 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:40,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 23:48:41,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:41,165 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:41,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:41,165 INFO L85 PathProgramCache]: Analyzing trace with hash 975581371, now seen corresponding path program 1 times [2022-11-25 23:48:41,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:41,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881462450] [2022-11-25 23:48:41,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:41,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:48:41,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:41,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881462450] [2022-11-25 23:48:41,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881462450] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:48:41,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347200233] [2022-11-25 23:48:41,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:41,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:41,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:41,277 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:48:41,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 23:48:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:41,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:48:41,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:48:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:48:41,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:48:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:48:41,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347200233] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:48:41,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [725685793] [2022-11-25 23:48:41,418 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-25 23:48:41,419 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:48:41,419 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:48:41,419 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:48:41,419 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:48:41,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:41,485 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-25 23:48:41,486 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 2 case distinctions, treesize of input 26 treesize of output 42 [2022-11-25 23:48:41,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:41,534 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:48:41,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-25 23:48:41,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:41,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 95 [2022-11-25 23:48:41,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:41,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:41,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 20 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 110 [2022-11-25 23:48:42,049 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 18 treesize of output 14 [2022-11-25 23:48:42,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 18 treesize of output 14 [2022-11-25 23:48:42,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:42,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:42,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:42,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:42,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:42,367 INFO L321 Elim1Store]: treesize reduction 44, result has 49.4 percent of original size [2022-11-25 23:48:42,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 347 treesize of output 395 [2022-11-25 23:48:42,570 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 18 treesize of output 14 [2022-11-25 23:48:42,703 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 18 treesize of output 14 [2022-11-25 23:48:42,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:42,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:42,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:42,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:42,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:42,892 INFO L321 Elim1Store]: treesize reduction 44, result has 49.4 percent of original size [2022-11-25 23:48:42,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 347 treesize of output 395 [2022-11-25 23:48:43,164 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 18 treesize of output 14 [2022-11-25 23:48:43,252 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 18 treesize of output 14 [2022-11-25 23:48:43,351 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 18 treesize of output 14 [2022-11-25 23:48:43,437 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:48:44,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [725685793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:44,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:48:44,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [5, 5, 5] total 20 [2022-11-25 23:48:44,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029469360] [2022-11-25 23:48:44,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:44,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 23:48:44,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:44,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 23:48:44,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-11-25 23:48:44,906 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 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:48:47,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:47,593 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-11-25 23:48:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:48:47,594 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 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 57 [2022-11-25 23:48:47,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:47,594 INFO L225 Difference]: With dead ends: 98 [2022-11-25 23:48:47,594 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 23:48:47,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 140 SyntacticMatches, 16 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:48:47,596 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:47,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:48:47,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 23:48:47,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 23:48:47,597 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:48:47,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 23:48:47,597 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2022-11-25 23:48:47,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:47,597 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 23:48:47,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 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:48:47,598 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 23:48:47,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 23:48:47,600 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2022-11-25 23:48:47,601 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2022-11-25 23:48:47,601 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2022-11-25 23:48:47,602 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2022-11-25 23:48:47,602 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2022-11-25 23:48:47,602 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2022-11-25 23:48:47,602 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2022-11-25 23:48:47,602 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2022-11-25 23:48:47,602 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2022-11-25 23:48:47,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2022-11-25 23:48:47,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2022-11-25 23:48:47,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2022-11-25 23:48:47,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2022-11-25 23:48:47,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2022-11-25 23:48:47,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2022-11-25 23:48:47,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2022-11-25 23:48:47,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 23:48:47,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-25 23:48:47,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 23:48:50,900 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) no Hoare annotation was computed. [2022-11-25 23:48:50,900 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2022-11-25 23:48:50,900 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2022-11-25 23:48:50,901 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2022-11-25 23:48:50,901 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 23:48:50,901 INFO L899 garLoopResultBuilder]: For program point L28-1(line 28) no Hoare annotation was computed. [2022-11-25 23:48:50,901 INFO L899 garLoopResultBuilder]: For program point L28-2(lines 28 41) no Hoare annotation was computed. [2022-11-25 23:48:50,901 INFO L899 garLoopResultBuilder]: For program point L28-5(line 28) no Hoare annotation was computed. [2022-11-25 23:48:50,901 INFO L899 garLoopResultBuilder]: For program point L28-6(line 28) no Hoare annotation was computed. [2022-11-25 23:48:50,902 INFO L895 garLoopResultBuilder]: At program point L28-7(lines 28 41) the Hoare annotation is: (let ((.cse31 (select |#memory_int| 1)) (.cse30 (select |#memory_int| 2))) (let ((.cse0 (= (select |#length| 3) 12)) (.cse1 (= (* (mod ~CELLCOUNT~0 1073741824) 4) (select |#length| |ULTIMATE.start_main_~#volArray~0#1.base|))) (.cse2 (= (select |#valid| |ULTIMATE.start_main_~#volArray~0#1.base|) 1)) (.cse3 (= (select .cse30 5) 0)) (.cse4 (= 114 (select .cse30 1))) (.cse5 (<= 2 ~CELLCOUNT~0)) (.cse6 (= 2 (select |#length| 1))) (.cse7 (= (select |#valid| 3) 1)) (.cse8 (= 2 |ULTIMATE.start_main_~MINVAL~0#1|)) (.cse9 (<= ~CELLCOUNT~0 2147483647)) (.cse10 (= (select .cse30 2) 50)) (.cse11 (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0)) (.cse12 (= ~CELLCOUNT~0 (* (div ~CELLCOUNT~0 2) 2))) (.cse13 (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse14 (= (select |#valid| 1) 1)) (.cse15 (= (select .cse30 4) 99)) (.cse16 (= (select .cse30 0) 110)) (.cse17 (= (select |#valid| 0) 0)) (.cse18 (= (select |#valid| 2) 1)) (.cse19 (= |#NULL.offset| 0)) (.cse20 (= 1 |ULTIMATE.start_main_~DEFAULTVALUE~0#1|)) (.cse21 (= (select .cse31 0) 48)) (.cse22 (= (select .cse31 1) 0)) (.cse23 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse24 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse25 (= 46 (select .cse30 3))) (.cse26 (= 6 (select |#length| 2))) (.cse27 (< 0 |#StackHeapBarrier|)) (.cse28 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) .cse12 .cse13 .cse14 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse15 (<= |ULTIMATE.start_main_~i~0#1| 1073741824) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (<= |ULTIMATE.start_main_~j~0#1| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_main_~i~0#1| 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) .cse18 .cse19 .cse20 .cse21 (= (ite (= (let ((.cse29 (mod ~CELLCOUNT~0 2))) (ite (and (not (= .cse29 0)) (< ~CELLCOUNT~0 0)) (+ (- 2) .cse29) .cse29)) 0) 1 0) |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28)))) [2022-11-25 23:48:50,902 INFO L899 garLoopResultBuilder]: For program point L28-8(lines 28 41) no Hoare annotation was computed. [2022-11-25 23:48:50,902 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2022-11-25 23:48:50,902 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2022-11-25 23:48:50,902 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2022-11-25 23:48:50,902 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-11-25 23:48:50,903 INFO L899 garLoopResultBuilder]: For program point L38-1(line 38) no Hoare annotation was computed. [2022-11-25 23:48:50,903 INFO L899 garLoopResultBuilder]: For program point L38-2(line 38) no Hoare annotation was computed. [2022-11-25 23:48:50,903 INFO L899 garLoopResultBuilder]: For program point L38-3(line 38) no Hoare annotation was computed. [2022-11-25 23:48:50,903 INFO L899 garLoopResultBuilder]: For program point L30-2(lines 30 40) no Hoare annotation was computed. [2022-11-25 23:48:50,903 INFO L899 garLoopResultBuilder]: For program point L30-3(line 30) no Hoare annotation was computed. [2022-11-25 23:48:50,903 INFO L899 garLoopResultBuilder]: For program point L30-4(line 30) no Hoare annotation was computed. [2022-11-25 23:48:50,903 INFO L895 garLoopResultBuilder]: At program point L30-5(lines 30 40) the Hoare annotation is: (let ((.cse41 (mod ~CELLCOUNT~0 2))) (let ((.cse36 (and (not (= .cse41 0)) (< ~CELLCOUNT~0 0))) (.cse40 (select |#memory_int| 1)) (.cse37 (div ~CELLCOUNT~0 2)) (.cse39 (select |#memory_int| 2))) (let ((.cse0 (<= |ULTIMATE.start_main_~j~0#1| 1)) (.cse26 (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse28 (<= 2 |ULTIMATE.start_main_~i~0#1|)) (.cse31 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse34 (= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse1 (= (select |#length| 3) 12)) (.cse2 (= (* (mod ~CELLCOUNT~0 1073741824) 4) (select |#length| |ULTIMATE.start_main_~#volArray~0#1.base|))) (.cse3 (= (select |#valid| |ULTIMATE.start_main_~#volArray~0#1.base|) 1)) (.cse4 (= (select .cse39 5) 0)) (.cse5 (= 114 (select .cse39 1))) (.cse23 (<= 2 ~CELLCOUNT~0)) (.cse6 (= 2 (select |#length| 1))) (.cse35 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse7 (= (select |#valid| 3) 1)) (.cse24 (= 2 |ULTIMATE.start_main_~MINVAL~0#1|)) (.cse8 (<= ~CELLCOUNT~0 2147483647)) (.cse9 (= (select .cse39 2) 50)) (.cse25 (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0)) (.cse10 (= ~CELLCOUNT~0 (* .cse37 2))) (.cse27 (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse11 (= (select |#valid| 1) 1)) (.cse12 (= (select .cse39 4) 99)) (.cse13 (= (select .cse39 0) 110)) (.cse14 (= (select |#valid| 0) 0)) (.cse38 (not (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (.cse15 (= (select |#valid| 2) 1)) (.cse29 (= |#NULL.offset| 0)) (.cse30 (= 1 |ULTIMATE.start_main_~DEFAULTVALUE~0#1|)) (.cse16 (= (select .cse40 0) 48)) (.cse17 (= (ite (= (ite .cse36 (+ (- 2) .cse41) .cse41) 0) 1 0) |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse18 (= (select .cse40 1) 0)) (.cse19 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse32 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse20 (= 46 (select .cse39 3))) (.cse21 (= 6 (select |#length| 2))) (.cse22 (< 0 |#StackHeapBarrier|)) (.cse33 (= |#NULL.base| 0))) (or (and .cse0 .cse1 (<= 0 |#NULL.base|) .cse2 .cse3 (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~#volArray~0#1.base|) (+ |ULTIMATE.start_main_~#volArray~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) (- 8)))) .cse4 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse5 .cse6 .cse7 (<= 0 |ULTIMATE.start_main_~#volArray~0#1.offset|) (<= |#NULL.offset| 0) .cse8 .cse9 (<= 1 ~CELLCOUNT~0) (<= |ULTIMATE.start_main_~MINVAL~0#1| 2) (<= |ULTIMATE.start_main_~DEFAULTVALUE~0#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| |ULTIMATE.start_assume_abort_if_not_~cond#1|) .cse10 .cse11 .cse12 (<= 1 |ULTIMATE.start_main_~DEFAULTVALUE~0#1|) (<= |#NULL.base| 0) .cse13 .cse14 (<= |ULTIMATE.start_main_~#volArray~0#1.offset| 0) .cse15 .cse16 .cse17 (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) .cse18 (<= 2 |ULTIMATE.start_main_~MINVAL~0#1|) .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse24 .cse8 .cse9 .cse25 .cse26 .cse10 .cse27 .cse11 .cse28 .cse12 .cse13 (<= |ULTIMATE.start_main_~i~0#1| 1073741823) .cse14 .cse15 .cse29 .cse30 .cse16 .cse31 .cse18 .cse19 .cse32 .cse20 .cse21 .cse22 .cse33) (and .cse34 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse24 .cse8 .cse9 .cse25 .cse26 .cse10 .cse27 .cse11 .cse28 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) 2147483647) .cse12 .cse13 .cse14 .cse15 .cse29 .cse30 .cse16 .cse31 .cse18 .cse19 .cse32 .cse20 .cse21 .cse22 .cse33) (and .cse34 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse35 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse27 .cse11 .cse12 .cse13 .cse14 (<= |ULTIMATE.start_main_~i~0#1| (ite .cse36 (+ .cse37 1) .cse37)) .cse38 .cse15 .cse29 .cse30 .cse16 .cse17 .cse18 .cse19 .cse32 .cse20 .cse21 .cse22 .cse33) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse35 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse27 .cse11 .cse12 .cse13 .cse14 .cse38 .cse15 .cse29 .cse30 .cse16 .cse17 .cse18 .cse19 .cse32 .cse20 .cse21 .cse22 .cse33 (<= |ULTIMATE.start_main_~j~0#1| 0)))))) [2022-11-25 23:48:50,904 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2022-11-25 23:48:50,904 INFO L902 garLoopResultBuilder]: At program point L48(lines 13 49) the Hoare annotation is: true [2022-11-25 23:48:50,904 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2022-11-25 23:48:50,904 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 39) no Hoare annotation was computed. [2022-11-25 23:48:50,904 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) no Hoare annotation was computed. [2022-11-25 23:48:50,904 INFO L899 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2022-11-25 23:48:50,904 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 47) no Hoare annotation was computed. [2022-11-25 23:48:50,904 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2022-11-25 23:48:50,904 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 16 47) no Hoare annotation was computed. [2022-11-25 23:48:50,905 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 23:48:50,905 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) no Hoare annotation was computed. [2022-11-25 23:48:50,905 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2022-11-25 23:48:50,905 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-11-25 23:48:50,905 INFO L899 garLoopResultBuilder]: For program point L34-1(line 34) no Hoare annotation was computed. [2022-11-25 23:48:50,905 INFO L899 garLoopResultBuilder]: For program point L34-2(line 34) no Hoare annotation was computed. [2022-11-25 23:48:50,905 INFO L899 garLoopResultBuilder]: For program point L34-3(line 34) no Hoare annotation was computed. [2022-11-25 23:48:50,906 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) no Hoare annotation was computed. [2022-11-25 23:48:50,906 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2022-11-25 23:48:50,906 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2022-11-25 23:48:50,906 INFO L899 garLoopResultBuilder]: For program point L43-3(line 43) no Hoare annotation was computed. [2022-11-25 23:48:50,906 INFO L899 garLoopResultBuilder]: For program point L43-4(line 43) no Hoare annotation was computed. [2022-11-25 23:48:50,907 INFO L895 garLoopResultBuilder]: At program point L43-5(lines 43 46) the Hoare annotation is: (let ((.cse29 (select |#memory_int| 1)) (.cse28 (select |#memory_int| 2))) (let ((.cse0 (= (select |#length| 3) 12)) (.cse1 (= (* (mod ~CELLCOUNT~0 1073741824) 4) (select |#length| |ULTIMATE.start_main_~#volArray~0#1.base|))) (.cse2 (= (select |#valid| |ULTIMATE.start_main_~#volArray~0#1.base|) 1)) (.cse3 (= (select .cse28 5) 0)) (.cse4 (= 114 (select .cse28 1))) (.cse5 (<= 2 ~CELLCOUNT~0)) (.cse6 (= 2 (select |#length| 1))) (.cse7 (= (select |#valid| 3) 1)) (.cse8 (= 2 |ULTIMATE.start_main_~MINVAL~0#1|)) (.cse9 (<= ~CELLCOUNT~0 2147483647)) (.cse10 (= (select .cse28 2) 50)) (.cse11 (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0)) (.cse12 (= ~CELLCOUNT~0 (* (div ~CELLCOUNT~0 2) 2))) (.cse13 (= (select |#valid| 1) 1)) (.cse14 (= (select .cse28 4) 99)) (.cse15 (= (select .cse28 0) 110)) (.cse16 (= (select |#valid| 0) 0)) (.cse17 (= (select |#valid| 2) 1)) (.cse18 (= |#NULL.offset| 0)) (.cse19 (= 1 |ULTIMATE.start_main_~DEFAULTVALUE~0#1|)) (.cse20 (= (select .cse29 0) 48)) (.cse21 (= (select .cse29 1) 0)) (.cse22 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse23 (= 46 (select .cse28 3))) (.cse24 (= 6 (select |#length| 2))) (.cse25 (< 0 |#StackHeapBarrier|)) (.cse26 (= |#NULL.base| 0)) (.cse27 (<= |ULTIMATE.start_main_~j~0#1| 0))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~i~0#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27)))) [2022-11-25 23:48:50,910 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:50,912 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:48:50,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:48:50 BoogieIcfgContainer [2022-11-25 23:48:50,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:48:50,953 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:48:50,953 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:48:50,953 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:48:50,953 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:48:09" (3/4) ... [2022-11-25 23:48:50,956 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 23:48:50,966 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-11-25 23:48:50,966 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-25 23:48:50,967 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-25 23:48:50,967 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:48:50,967 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:48:50,992 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && unknown-#memory_int-unknown[2][2] == 50) && volArray == 0) && 0 <= \old(cond)) && CELLCOUNT == CELLCOUNT / 2 * 2) && 0 <= cond) && \valid[1] == 1) && 2 <= i) && unknown-#memory_int-unknown[2][4] == 99) && i <= 1073741824) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && 1 == DEFAULTVALUE) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && j <= 0) || (((((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && unknown-#memory_int-unknown[2][2] == 50) && volArray == 0) && CELLCOUNT == CELLCOUNT / 2 * 2) && 0 <= cond) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && !(cond == 0)) && \valid[2] == 1) && #NULL == 0) && 1 == DEFAULTVALUE) && unknown-#memory_int-unknown[1][0] == 48) && (if (if !(CELLCOUNT % 2 == 0) && CELLCOUNT < 0 then -2 + CELLCOUNT % 2 else CELLCOUNT % 2) == 0 then 1 else 0) == \old(cond)) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-25 23:48:50,993 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((j <= 1 && unknown-#length-unknown[3] == 12) && 0 <= #NULL) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 2 == unknown-#memory_int-unknown[volArray][volArray + i * 8 + -8]) && unknown-#memory_int-unknown[2][5] == 0) && 1 <= i) && 114 == unknown-#memory_int-unknown[2][1]) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 0 <= volArray) && #NULL <= 0) && CELLCOUNT <= 2147483647) && unknown-#memory_int-unknown[2][2] == 50) && 1 <= CELLCOUNT) && MINVAL <= 2) && DEFAULTVALUE <= 1) && \old(cond) == cond) && CELLCOUNT == CELLCOUNT / 2 * 2) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && 1 <= DEFAULTVALUE) && #NULL <= 0) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && volArray <= 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && (if (if !(CELLCOUNT % 2 == 0) && CELLCOUNT < 0 then -2 + CELLCOUNT % 2 else CELLCOUNT % 2) == 0 then 1 else 0) == \old(cond)) && 0 <= #NULL) && i <= 1) && unknown-#memory_int-unknown[1][1] == 0) && 2 <= MINVAL) && unknown-#StackHeapBarrier-unknown < volArray) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) || (((((((((((((((((((((((((((((((((j <= 1 && unknown-#length-unknown[3] == 12) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && unknown-#memory_int-unknown[2][2] == 50) && volArray == 0) && 0 <= \old(cond)) && CELLCOUNT == CELLCOUNT / 2 * 2) && 0 <= cond) && \valid[1] == 1) && 2 <= i) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && i <= 1073741823) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && 1 == DEFAULTVALUE) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((((((((((((((2 == j && unknown-#length-unknown[3] == 12) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && unknown-#memory_int-unknown[2][2] == 50) && volArray == 0) && 0 <= \old(cond)) && CELLCOUNT == CELLCOUNT / 2 * 2) && 0 <= cond) && \valid[1] == 1) && 2 <= i) && 2 * i <= 2147483647) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && 1 == DEFAULTVALUE) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((((((((2 == j && unknown-#length-unknown[3] == 12) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && 114 == unknown-#memory_int-unknown[2][1]) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && unknown-#memory_int-unknown[2][2] == 50) && volArray == 0) && CELLCOUNT == CELLCOUNT / 2 * 2) && 0 <= cond) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && i <= (if !(CELLCOUNT % 2 == 0) && CELLCOUNT < 0 then CELLCOUNT / 2 + 1 else CELLCOUNT / 2)) && !(cond == 0)) && \valid[2] == 1) && #NULL == 0) && 1 == DEFAULTVALUE) && unknown-#memory_int-unknown[1][0] == 48) && (if (if !(CELLCOUNT % 2 == 0) && CELLCOUNT < 0 then -2 + CELLCOUNT % 2 else CELLCOUNT % 2) == 0 then 1 else 0) == \old(cond)) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && unknown-#memory_int-unknown[2][2] == 50) && volArray == 0) && CELLCOUNT == CELLCOUNT / 2 * 2) && 0 <= cond) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && !(cond == 0)) && \valid[2] == 1) && #NULL == 0) && 1 == DEFAULTVALUE) && unknown-#memory_int-unknown[1][0] == 48) && (if (if !(CELLCOUNT % 2 == 0) && CELLCOUNT < 0 then -2 + CELLCOUNT % 2 else CELLCOUNT % 2) == 0 then 1 else 0) == \old(cond)) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && j <= 0) [2022-11-25 23:48:51,005 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:48:51,005 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:48:51,006 INFO L158 Benchmark]: Toolchain (without parser) took 42530.05ms. Allocated memory was 138.4MB in the beginning and 469.8MB in the end (delta: 331.4MB). Free memory was 96.4MB in the beginning and 324.4MB in the end (delta: -228.0MB). Peak memory consumption was 104.1MB. Max. memory is 16.1GB. [2022-11-25 23:48:51,006 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 138.4MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:48:51,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.79ms. Allocated memory is still 138.4MB. Free memory was 96.1MB in the beginning and 85.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 23:48:51,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.26ms. Allocated memory is still 138.4MB. Free memory was 85.6MB in the beginning and 83.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:48:51,007 INFO L158 Benchmark]: Boogie Preprocessor took 26.76ms. Allocated memory is still 138.4MB. Free memory was 83.9MB in the beginning and 82.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:48:51,007 INFO L158 Benchmark]: RCFGBuilder took 507.63ms. Allocated memory is still 138.4MB. Free memory was 82.5MB in the beginning and 65.3MB in the end (delta: 17.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 23:48:51,007 INFO L158 Benchmark]: TraceAbstraction took 41630.42ms. Allocated memory was 138.4MB in the beginning and 469.8MB in the end (delta: 331.4MB). Free memory was 65.0MB in the beginning and 327.6MB in the end (delta: -262.6MB). Peak memory consumption was 238.8MB. Max. memory is 16.1GB. [2022-11-25 23:48:51,008 INFO L158 Benchmark]: Witness Printer took 52.84ms. Allocated memory is still 469.8MB. Free memory was 327.6MB in the beginning and 324.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:48:51,009 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.28ms. Allocated memory is still 138.4MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.79ms. Allocated memory is still 138.4MB. Free memory was 96.1MB in the beginning and 85.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.26ms. Allocated memory is still 138.4MB. Free memory was 85.6MB in the beginning and 83.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.76ms. Allocated memory is still 138.4MB. Free memory was 83.9MB in the beginning and 82.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 507.63ms. Allocated memory is still 138.4MB. Free memory was 82.5MB in the beginning and 65.3MB in the end (delta: 17.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 41630.42ms. Allocated memory was 138.4MB in the beginning and 469.8MB in the end (delta: 331.4MB). Free memory was 65.0MB in the beginning and 327.6MB in the end (delta: -262.6MB). Peak memory consumption was 238.8MB. Max. memory is 16.1GB. * Witness Printer took 52.84ms. Allocated memory is still 469.8MB. Free memory was 327.6MB in the beginning and 324.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.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: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: 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, 44 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 41.5s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1157 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1157 mSDsluCounter, 1295 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 757 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1889 IncrementalHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 538 mSDtfsCounter, 1889 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 914 GetRequests, 642 SyntacticMatches, 51 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1733 ImplicationChecksByTransitivity, 15.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=20, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 133 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 29 NumberOfFragments, 1547 HoareAnnotationTreeSize, 4 FomulaSimplifications, 287 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 2840 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 995 NumberOfCodeBlocks, 959 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1146 ConstructedInterpolants, 0 QuantifiedInterpolants, 3169 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1310 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 40 InterpolantComputations, 19 PerfectInterpolantSequences, 584/693 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: 2.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 54, DAG_INTERPRETER_EARLY_EXITS: 4, TOOLS_POST_APPLICATIONS: 265, TOOLS_POST_TIME: 2.4s, 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: 208, TOOLS_QUANTIFIERELIM_TIME: 2.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 362, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 20, DOMAIN_JOIN_TIME: 0.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 5, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 21, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 54, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 16, LOOP_SUMMARIZER_CACHE_MISSES: 16, LOOP_SUMMARIZER_OVERALL_TIME: 1.5s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.5s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 21, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 2819, DAG_COMPRESSION_RETAINED_NODES: 177, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((j <= 1 && unknown-#length-unknown[3] == 12) && 0 <= #NULL) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && 2 == unknown-#memory_int-unknown[volArray][volArray + i * 8 + -8]) && unknown-#memory_int-unknown[2][5] == 0) && 1 <= i) && 114 == unknown-#memory_int-unknown[2][1]) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 0 <= volArray) && #NULL <= 0) && CELLCOUNT <= 2147483647) && unknown-#memory_int-unknown[2][2] == 50) && 1 <= CELLCOUNT) && MINVAL <= 2) && DEFAULTVALUE <= 1) && \old(cond) == cond) && CELLCOUNT == CELLCOUNT / 2 * 2) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && 1 <= DEFAULTVALUE) && #NULL <= 0) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && volArray <= 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && (if (if !(CELLCOUNT % 2 == 0) && CELLCOUNT < 0 then -2 + CELLCOUNT % 2 else CELLCOUNT % 2) == 0 then 1 else 0) == \old(cond)) && 0 <= #NULL) && i <= 1) && unknown-#memory_int-unknown[1][1] == 0) && 2 <= MINVAL) && unknown-#StackHeapBarrier-unknown < volArray) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) || (((((((((((((((((((((((((((((((((j <= 1 && unknown-#length-unknown[3] == 12) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && unknown-#memory_int-unknown[2][2] == 50) && volArray == 0) && 0 <= \old(cond)) && CELLCOUNT == CELLCOUNT / 2 * 2) && 0 <= cond) && \valid[1] == 1) && 2 <= i) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && i <= 1073741823) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && 1 == DEFAULTVALUE) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((((((((((((((2 == j && unknown-#length-unknown[3] == 12) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && unknown-#memory_int-unknown[2][2] == 50) && volArray == 0) && 0 <= \old(cond)) && CELLCOUNT == CELLCOUNT / 2 * 2) && 0 <= cond) && \valid[1] == 1) && 2 <= i) && 2 * i <= 2147483647) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && 1 == DEFAULTVALUE) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((((((((2 == j && unknown-#length-unknown[3] == 12) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && 114 == unknown-#memory_int-unknown[2][1]) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && unknown-#memory_int-unknown[2][2] == 50) && volArray == 0) && CELLCOUNT == CELLCOUNT / 2 * 2) && 0 <= cond) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && i <= (if !(CELLCOUNT % 2 == 0) && CELLCOUNT < 0 then CELLCOUNT / 2 + 1 else CELLCOUNT / 2)) && !(cond == 0)) && \valid[2] == 1) && #NULL == 0) && 1 == DEFAULTVALUE) && unknown-#memory_int-unknown[1][0] == 48) && (if (if !(CELLCOUNT % 2 == 0) && CELLCOUNT < 0 then -2 + CELLCOUNT % 2 else CELLCOUNT % 2) == 0 then 1 else 0) == \old(cond)) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && unknown-#memory_int-unknown[2][2] == 50) && volArray == 0) && CELLCOUNT == CELLCOUNT / 2 * 2) && 0 <= cond) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && !(cond == 0)) && \valid[2] == 1) && #NULL == 0) && 1 == DEFAULTVALUE) && unknown-#memory_int-unknown[1][0] == 48) && (if (if !(CELLCOUNT % 2 == 0) && CELLCOUNT < 0 then -2 + CELLCOUNT % 2 else CELLCOUNT % 2) == 0 then 1 else 0) == \old(cond)) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && j <= 0) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && unknown-#memory_int-unknown[2][2] == 50) && volArray == 0) && 0 <= \old(cond)) && CELLCOUNT == CELLCOUNT / 2 * 2) && 0 <= cond) && \valid[1] == 1) && 2 <= i) && unknown-#memory_int-unknown[2][4] == 99) && i <= 1073741824) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && 1 == DEFAULTVALUE) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && j <= 0) || (((((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && unknown-#memory_int-unknown[2][2] == 50) && volArray == 0) && CELLCOUNT == CELLCOUNT / 2 * 2) && 0 <= cond) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && !(cond == 0)) && \valid[2] == 1) && #NULL == 0) && 1 == DEFAULTVALUE) && unknown-#memory_int-unknown[1][0] == 48) && (if (if !(CELLCOUNT % 2 == 0) && CELLCOUNT < 0 then -2 + CELLCOUNT % 2 else CELLCOUNT % 2) == 0 then 1 else 0) == \old(cond)) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && i == 0) && unknown-#memory_int-unknown[2][5] == 0) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && unknown-#memory_int-unknown[2][2] == 50) && volArray == 0) && CELLCOUNT == CELLCOUNT / 2 * 2) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && 1 == DEFAULTVALUE) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && j <= 0) || ((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && 1 <= i) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && unknown-#memory_int-unknown[2][2] == 50) && volArray == 0) && CELLCOUNT == CELLCOUNT / 2 * 2) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && 1 == DEFAULTVALUE) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && j <= 0) RESULT: Ultimate proved your program to be correct! [2022-11-25 23:48:51,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6bd512-d409-4da2-8ab8-30ecf3fa81aa/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