./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 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_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh --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 17c1b3adab900925d0968acf284c9fae9bc7d0ec39197e53dc7bd6b93c5a8558 --- 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-2329fc7 [2022-12-14 13:00:01,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 13:00:01,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 13:00:01,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 13:00:01,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 13:00:01,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 13:00:01,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 13:00:01,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 13:00:01,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 13:00:01,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 13:00:01,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 13:00:01,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 13:00:01,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 13:00:01,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 13:00:01,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 13:00:01,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 13:00:01,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 13:00:01,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 13:00:01,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 13:00:01,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 13:00:01,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 13:00:01,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 13:00:01,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 13:00:01,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 13:00:01,867 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 13:00:01,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 13:00:01,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 13:00:01,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 13:00:01,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 13:00:01,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 13:00:01,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 13:00:01,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 13:00:01,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 13:00:01,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 13:00:01,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 13:00:01,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 13:00:01,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 13:00:01,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 13:00:01,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 13:00:01,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 13:00:01,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 13:00:01,876 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 13:00:01,894 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 13:00:01,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 13:00:01,895 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 13:00:01,895 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 13:00:01,896 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 13:00:01,896 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 13:00:01,896 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 13:00:01,896 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 13:00:01,896 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 13:00:01,897 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 13:00:01,897 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 13:00:01,897 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 13:00:01,897 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 13:00:01,897 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 13:00:01,897 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 13:00:01,897 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 13:00:01,898 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 13:00:01,898 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 13:00:01,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 13:00:01,899 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 13:00:01,899 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 13:00:01,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 13:00:01,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 13:00:01,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 13:00:01,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 13:00:01,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 13:00:01,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 13:00:01,900 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 13:00:01,900 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 13:00:01,900 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 13:00:01,900 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 13:00:01,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 13:00:01,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 13:00:01,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 13:00:01,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:00:01,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 13:00:01,901 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 13:00:01,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 13:00:01,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 13:00:01,902 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 13:00:01,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 13:00:01,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 13:00:01,902 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 13:00:01,902 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_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/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_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh 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 -> 17c1b3adab900925d0968acf284c9fae9bc7d0ec39197e53dc7bd6b93c5a8558 [2022-12-14 13:00:02,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 13:00:02,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 13:00:02,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 13:00:02,117 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 13:00:02,118 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 13:00:02,119 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-12-14 13:00:04,720 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 13:00:04,895 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 13:00:04,896 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-12-14 13:00:04,903 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/data/841693680/f98f339e62774e4faf6a0cfb8beef50e/FLAGa15a7a7e8 [2022-12-14 13:00:04,916 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/data/841693680/f98f339e62774e4faf6a0cfb8beef50e [2022-12-14 13:00:04,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 13:00:04,920 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 13:00:04,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 13:00:04,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 13:00:04,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 13:00:04,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:00:04" (1/1) ... [2022-12-14 13:00:04,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f5cb8cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:00:04, skipping insertion in model container [2022-12-14 13:00:04,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:00:04" (1/1) ... [2022-12-14 13:00:04,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 13:00:04,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 13:00:05,087 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_cad91eae-c115-4b45-b9c6-adcc3002cfcf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4105,4118] [2022-12-14 13:00:05,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:00:05,114 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 13:00:05,143 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_cad91eae-c115-4b45-b9c6-adcc3002cfcf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4105,4118] [2022-12-14 13:00:05,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:00:05,170 INFO L208 MainTranslator]: Completed translation [2022-12-14 13:00:05,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:00:05 WrapperNode [2022-12-14 13:00:05,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 13:00:05,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 13:00:05,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 13:00:05,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 13:00:05,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:00:05" (1/1) ... [2022-12-14 13:00:05,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:00:05" (1/1) ... [2022-12-14 13:00:05,207 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 280 [2022-12-14 13:00:05,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 13:00:05,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 13:00:05,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 13:00:05,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 13:00:05,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:00:05" (1/1) ... [2022-12-14 13:00:05,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:00:05" (1/1) ... [2022-12-14 13:00:05,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:00:05" (1/1) ... [2022-12-14 13:00:05,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:00:05" (1/1) ... [2022-12-14 13:00:05,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:00:05" (1/1) ... [2022-12-14 13:00:05,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:00:05" (1/1) ... [2022-12-14 13:00:05,224 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:00:05" (1/1) ... [2022-12-14 13:00:05,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:00:05" (1/1) ... [2022-12-14 13:00:05,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 13:00:05,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 13:00:05,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 13:00:05,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 13:00:05,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:00:05" (1/1) ... [2022-12-14 13:00:05,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:00:05,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:00:05,257 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 13:00:05,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 13:00:05,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 13:00:05,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 13:00:05,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 13:00:05,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 13:00:05,379 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 13:00:05,381 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 13:00:05,647 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 13:00:05,717 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 13:00:05,717 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 13:00:05,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:00:05 BoogieIcfgContainer [2022-12-14 13:00:05,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 13:00:05,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 13:00:05,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 13:00:05,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 13:00:05,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:00:04" (1/3) ... [2022-12-14 13:00:05,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66750dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:00:05, skipping insertion in model container [2022-12-14 13:00:05,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:00:05" (2/3) ... [2022-12-14 13:00:05,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66750dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:00:05, skipping insertion in model container [2022-12-14 13:00:05,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:00:05" (3/3) ... [2022-12-14 13:00:05,726 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-12-14 13:00:05,740 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 13:00:05,740 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-12-14 13:00:05,774 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 13:00:05,779 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;@7f4a62ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 13:00:05,779 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-12-14 13:00:05,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 73 states have internal predecessors, (103), 0 states have call successors, (0), 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-12-14 13:00:05,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 13:00:05,789 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:05,789 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:05,790 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:05,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:05,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1190146159, now seen corresponding path program 1 times [2022-12-14 13:00:05,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:05,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107962009] [2022-12-14 13:00:05,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:05,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:00:05,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:05,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107962009] [2022-12-14 13:00:05,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107962009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:05,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:05,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 13:00:05,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446903904] [2022-12-14 13:00:05,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:05,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 13:00:05,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:05,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 13:00:05,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 13:00:05,981 INFO L87 Difference]: Start difference. First operand has 74 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 73 states have internal predecessors, (103), 0 states have call successors, (0), 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 2 states, 1 states have (on average 21.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:00:06,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:06,013 INFO L93 Difference]: Finished difference Result 76 states and 104 transitions. [2022-12-14 13:00:06,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 13:00:06,015 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 21.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 13:00:06,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:06,021 INFO L225 Difference]: With dead ends: 76 [2022-12-14 13:00:06,021 INFO L226 Difference]: Without dead ends: 69 [2022-12-14 13:00:06,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 13:00:06,025 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:06,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:00:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-14 13:00:06,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-12-14 13:00:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 68 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-12-14 13:00:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2022-12-14 13:00:06,050 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 21 [2022-12-14 13:00:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:06,050 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2022-12-14 13:00:06,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 21.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:00:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-12-14 13:00:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 13:00:06,051 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:06,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:06,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 13:00:06,052 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:06,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:06,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1628803833, now seen corresponding path program 1 times [2022-12-14 13:00:06,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:06,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078491259] [2022-12-14 13:00:06,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:06,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:06,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:00:06,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:06,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078491259] [2022-12-14 13:00:06,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078491259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:06,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:06,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:00:06,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482460184] [2022-12-14 13:00:06,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:06,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:00:06,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:06,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:00:06,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:00:06,156 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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-12-14 13:00:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:06,193 INFO L93 Difference]: Finished difference Result 165 states and 199 transitions. [2022-12-14 13:00:06,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:00:06,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-12-14 13:00:06,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:06,194 INFO L225 Difference]: With dead ends: 165 [2022-12-14 13:00:06,194 INFO L226 Difference]: Without dead ends: 114 [2022-12-14 13:00:06,194 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-12-14 13:00:06,195 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 58 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:06,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 181 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:00:06,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-14 13:00:06,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2022-12-14 13:00:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 97 states have internal predecessors, (128), 0 states have call successors, (0), 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-12-14 13:00:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2022-12-14 13:00:06,205 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 28 [2022-12-14 13:00:06,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:06,205 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2022-12-14 13:00:06,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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-12-14 13:00:06,206 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2022-12-14 13:00:06,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 13:00:06,206 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:06,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:06,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 13:00:06,207 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:06,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:06,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1333674629, now seen corresponding path program 1 times [2022-12-14 13:00:06,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:06,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189333528] [2022-12-14 13:00:06,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:06,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:00:06,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:06,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189333528] [2022-12-14 13:00:06,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189333528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:06,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:06,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:00:06,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007740970] [2022-12-14 13:00:06,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:06,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:00:06,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:06,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:00:06,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:00:06,266 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-12-14 13:00:06,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:06,318 INFO L93 Difference]: Finished difference Result 250 states and 336 transitions. [2022-12-14 13:00:06,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:00:06,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-12-14 13:00:06,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:06,320 INFO L225 Difference]: With dead ends: 250 [2022-12-14 13:00:06,321 INFO L226 Difference]: Without dead ends: 170 [2022-12-14 13:00:06,321 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-12-14 13:00:06,323 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 55 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:06,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 178 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:00:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-12-14 13:00:06,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 154. [2022-12-14 13:00:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 142 states have (on average 1.528169014084507) internal successors, (217), 153 states have internal predecessors, (217), 0 states have call successors, (0), 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-12-14 13:00:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 217 transitions. [2022-12-14 13:00:06,339 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 217 transitions. Word has length 29 [2022-12-14 13:00:06,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:06,340 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 217 transitions. [2022-12-14 13:00:06,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-12-14 13:00:06,340 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 217 transitions. [2022-12-14 13:00:06,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 13:00:06,340 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:06,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:06,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 13:00:06,341 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:06,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:06,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2007586470, now seen corresponding path program 1 times [2022-12-14 13:00:06,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:06,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880046499] [2022-12-14 13:00:06,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:06,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:00:06,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:06,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880046499] [2022-12-14 13:00:06,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880046499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:06,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:06,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:00:06,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236534848] [2022-12-14 13:00:06,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:06,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:00:06,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:06,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:00:06,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:00:06,391 INFO L87 Difference]: Start difference. First operand 154 states and 217 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-12-14 13:00:06,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:06,445 INFO L93 Difference]: Finished difference Result 410 states and 591 transitions. [2022-12-14 13:00:06,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:00:06,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 13:00:06,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:06,448 INFO L225 Difference]: With dead ends: 410 [2022-12-14 13:00:06,448 INFO L226 Difference]: Without dead ends: 274 [2022-12-14 13:00:06,449 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-12-14 13:00:06,450 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 50 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:06,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 174 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:00:06,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-12-14 13:00:06,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 258. [2022-12-14 13:00:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 246 states have (on average 1.548780487804878) internal successors, (381), 257 states have internal predecessors, (381), 0 states have call successors, (0), 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-12-14 13:00:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 381 transitions. [2022-12-14 13:00:06,474 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 381 transitions. Word has length 32 [2022-12-14 13:00:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:06,474 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 381 transitions. [2022-12-14 13:00:06,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-12-14 13:00:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 381 transitions. [2022-12-14 13:00:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 13:00:06,475 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:06,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:06,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 13:00:06,475 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:06,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:06,476 INFO L85 PathProgramCache]: Analyzing trace with hash 62503230, now seen corresponding path program 1 times [2022-12-14 13:00:06,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:06,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224933979] [2022-12-14 13:00:06,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:06,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:00:06,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:06,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224933979] [2022-12-14 13:00:06,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224933979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:06,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:06,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:00:06,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151896067] [2022-12-14 13:00:06,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:06,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:00:06,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:06,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:00:06,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:00:06,537 INFO L87 Difference]: Start difference. First operand 258 states and 381 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-12-14 13:00:06,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:06,646 INFO L93 Difference]: Finished difference Result 397 states and 586 transitions. [2022-12-14 13:00:06,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:00:06,647 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 35 [2022-12-14 13:00:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:06,648 INFO L225 Difference]: With dead ends: 397 [2022-12-14 13:00:06,648 INFO L226 Difference]: Without dead ends: 394 [2022-12-14 13:00:06,649 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-12-14 13:00:06,650 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 172 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:06,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 88 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:00:06,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-12-14 13:00:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 377. [2022-12-14 13:00:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 365 states have (on average 1.5452054794520549) internal successors, (564), 376 states have internal predecessors, (564), 0 states have call successors, (0), 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-12-14 13:00:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 564 transitions. [2022-12-14 13:00:06,679 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 564 transitions. Word has length 35 [2022-12-14 13:00:06,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:06,679 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 564 transitions. [2022-12-14 13:00:06,679 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-12-14 13:00:06,679 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 564 transitions. [2022-12-14 13:00:06,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 13:00:06,680 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:06,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:06,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 13:00:06,680 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:06,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1937600266, now seen corresponding path program 1 times [2022-12-14 13:00:06,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:06,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322113569] [2022-12-14 13:00:06,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:06,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:00:06,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:06,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322113569] [2022-12-14 13:00:06,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322113569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:06,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:06,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:00:06,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065856157] [2022-12-14 13:00:06,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:06,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:00:06,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:06,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:00:06,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:00:06,748 INFO L87 Difference]: Start difference. First operand 377 states and 564 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-12-14 13:00:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:06,880 INFO L93 Difference]: Finished difference Result 482 states and 692 transitions. [2022-12-14 13:00:06,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:00:06,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-12-14 13:00:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:06,882 INFO L225 Difference]: With dead ends: 482 [2022-12-14 13:00:06,882 INFO L226 Difference]: Without dead ends: 479 [2022-12-14 13:00:06,882 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-12-14 13:00:06,883 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 163 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:06,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 157 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:00:06,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-12-14 13:00:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 447. [2022-12-14 13:00:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 435 states have (on average 1.5333333333333334) internal successors, (667), 446 states have internal predecessors, (667), 0 states have call successors, (0), 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-12-14 13:00:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 667 transitions. [2022-12-14 13:00:06,935 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 667 transitions. Word has length 36 [2022-12-14 13:00:06,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:06,936 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 667 transitions. [2022-12-14 13:00:06,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-12-14 13:00:06,936 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 667 transitions. [2022-12-14 13:00:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 13:00:06,937 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:06,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:06,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 13:00:06,938 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash -63933760, now seen corresponding path program 1 times [2022-12-14 13:00:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:06,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581573189] [2022-12-14 13:00:06,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:06,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:00:06,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:06,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581573189] [2022-12-14 13:00:06,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581573189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:06,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:06,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:00:06,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406137383] [2022-12-14 13:00:06,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:06,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:00:07,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:07,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:00:07,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:00:07,000 INFO L87 Difference]: Start difference. First operand 447 states and 667 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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-12-14 13:00:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:07,226 INFO L93 Difference]: Finished difference Result 673 states and 968 transitions. [2022-12-14 13:00:07,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 13:00:07,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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-12-14 13:00:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:07,228 INFO L225 Difference]: With dead ends: 673 [2022-12-14 13:00:07,229 INFO L226 Difference]: Without dead ends: 670 [2022-12-14 13:00:07,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 13:00:07,229 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 318 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:07,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 180 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:00:07,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-12-14 13:00:07,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 627. [2022-12-14 13:00:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 615 states have (on average 1.4991869918699188) internal successors, (922), 626 states have internal predecessors, (922), 0 states have call successors, (0), 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-12-14 13:00:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 922 transitions. [2022-12-14 13:00:07,270 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 922 transitions. Word has length 37 [2022-12-14 13:00:07,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:07,270 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 922 transitions. [2022-12-14 13:00:07,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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-12-14 13:00:07,271 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 922 transitions. [2022-12-14 13:00:07,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 13:00:07,271 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:07,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:07,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 13:00:07,271 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:07,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:07,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1981946420, now seen corresponding path program 1 times [2022-12-14 13:00:07,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:07,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904827637] [2022-12-14 13:00:07,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:07,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:00:07,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:07,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904827637] [2022-12-14 13:00:07,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904827637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:07,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:07,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:00:07,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086039222] [2022-12-14 13:00:07,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:07,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:00:07,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:07,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:00:07,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:00:07,325 INFO L87 Difference]: Start difference. First operand 627 states and 922 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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-12-14 13:00:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:07,592 INFO L93 Difference]: Finished difference Result 1505 states and 2161 transitions. [2022-12-14 13:00:07,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 13:00:07,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-12-14 13:00:07,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:07,595 INFO L225 Difference]: With dead ends: 1505 [2022-12-14 13:00:07,595 INFO L226 Difference]: Without dead ends: 896 [2022-12-14 13:00:07,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-14 13:00:07,596 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 289 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:07,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 362 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:00:07,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-12-14 13:00:07,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 835. [2022-12-14 13:00:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 823 states have (on average 1.4617253948967193) internal successors, (1203), 834 states have internal predecessors, (1203), 0 states have call successors, (0), 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-12-14 13:00:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1203 transitions. [2022-12-14 13:00:07,648 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1203 transitions. Word has length 38 [2022-12-14 13:00:07,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:07,648 INFO L495 AbstractCegarLoop]: Abstraction has 835 states and 1203 transitions. [2022-12-14 13:00:07,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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-12-14 13:00:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1203 transitions. [2022-12-14 13:00:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-14 13:00:07,649 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:07,649 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:07,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 13:00:07,649 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:07,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:07,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1551716282, now seen corresponding path program 1 times [2022-12-14 13:00:07,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:07,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759142692] [2022-12-14 13:00:07,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:07,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:00:07,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:07,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759142692] [2022-12-14 13:00:07,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759142692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:07,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:07,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:00:07,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814136491] [2022-12-14 13:00:07,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:07,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:00:07,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:07,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:00:07,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:00:07,699 INFO L87 Difference]: Start difference. First operand 835 states and 1203 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:00:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:07,784 INFO L93 Difference]: Finished difference Result 1645 states and 2365 transitions. [2022-12-14 13:00:07,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:00:07,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-12-14 13:00:07,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:07,787 INFO L225 Difference]: With dead ends: 1645 [2022-12-14 13:00:07,787 INFO L226 Difference]: Without dead ends: 836 [2022-12-14 13:00:07,788 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-12-14 13:00:07,788 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 29 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:07,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 136 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:00:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-12-14 13:00:07,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 822. [2022-12-14 13:00:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 810 states have (on average 1.4419753086419753) internal successors, (1168), 821 states have internal predecessors, (1168), 0 states have call successors, (0), 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-12-14 13:00:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1168 transitions. [2022-12-14 13:00:07,835 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1168 transitions. Word has length 53 [2022-12-14 13:00:07,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:07,835 INFO L495 AbstractCegarLoop]: Abstraction has 822 states and 1168 transitions. [2022-12-14 13:00:07,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:00:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1168 transitions. [2022-12-14 13:00:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-14 13:00:07,836 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:07,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:07,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 13:00:07,836 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:07,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:07,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2090750529, now seen corresponding path program 1 times [2022-12-14 13:00:07,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:07,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384947158] [2022-12-14 13:00:07,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:07,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:00:07,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:07,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384947158] [2022-12-14 13:00:07,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384947158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:07,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:07,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:00:07,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133595874] [2022-12-14 13:00:07,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:07,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:00:07,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:07,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:00:07,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:00:07,972 INFO L87 Difference]: Start difference. First operand 822 states and 1168 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:00:08,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:08,151 INFO L93 Difference]: Finished difference Result 1632 states and 2316 transitions. [2022-12-14 13:00:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:00:08,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-12-14 13:00:08,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:08,154 INFO L225 Difference]: With dead ends: 1632 [2022-12-14 13:00:08,155 INFO L226 Difference]: Without dead ends: 836 [2022-12-14 13:00:08,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:00:08,157 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 76 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:08,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 140 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:00:08,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-12-14 13:00:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 822. [2022-12-14 13:00:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 810 states have (on average 1.4382716049382716) internal successors, (1165), 821 states have internal predecessors, (1165), 0 states have call successors, (0), 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-12-14 13:00:08,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1165 transitions. [2022-12-14 13:00:08,232 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1165 transitions. Word has length 57 [2022-12-14 13:00:08,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:08,233 INFO L495 AbstractCegarLoop]: Abstraction has 822 states and 1165 transitions. [2022-12-14 13:00:08,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:00:08,233 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1165 transitions. [2022-12-14 13:00:08,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 13:00:08,233 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:08,234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:08,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 13:00:08,234 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:08,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:08,234 INFO L85 PathProgramCache]: Analyzing trace with hash 847640831, now seen corresponding path program 1 times [2022-12-14 13:00:08,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:08,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119437431] [2022-12-14 13:00:08,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:08,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:08,313 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 13:00:08,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:08,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119437431] [2022-12-14 13:00:08,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119437431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:08,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:08,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:00:08,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713529391] [2022-12-14 13:00:08,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:08,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:00:08,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:08,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:00:08,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:00:08,316 INFO L87 Difference]: Start difference. First operand 822 states and 1165 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:00:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:08,435 INFO L93 Difference]: Finished difference Result 1618 states and 2302 transitions. [2022-12-14 13:00:08,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:00:08,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-12-14 13:00:08,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:08,438 INFO L225 Difference]: With dead ends: 1618 [2022-12-14 13:00:08,438 INFO L226 Difference]: Without dead ends: 822 [2022-12-14 13:00:08,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:00:08,439 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 187 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:08,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 76 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:00:08,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-12-14 13:00:08,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 822. [2022-12-14 13:00:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 810 states have (on average 1.4234567901234567) internal successors, (1153), 821 states have internal predecessors, (1153), 0 states have call successors, (0), 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-12-14 13:00:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1153 transitions. [2022-12-14 13:00:08,496 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1153 transitions. Word has length 58 [2022-12-14 13:00:08,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:08,496 INFO L495 AbstractCegarLoop]: Abstraction has 822 states and 1153 transitions. [2022-12-14 13:00:08,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:00:08,496 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1153 transitions. [2022-12-14 13:00:08,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 13:00:08,497 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:08,497 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:08,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 13:00:08,497 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:08,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:08,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2119941276, now seen corresponding path program 1 times [2022-12-14 13:00:08,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:08,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920472944] [2022-12-14 13:00:08,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:08,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:08,588 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:00:08,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:08,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920472944] [2022-12-14 13:00:08,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920472944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:08,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:08,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:00:08,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124480096] [2022-12-14 13:00:08,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:08,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:00:08,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:08,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:00:08,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:00:08,590 INFO L87 Difference]: Start difference. First operand 822 states and 1153 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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-12-14 13:00:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:08,687 INFO L93 Difference]: Finished difference Result 1618 states and 2278 transitions. [2022-12-14 13:00:08,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:00:08,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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 58 [2022-12-14 13:00:08,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:08,693 INFO L225 Difference]: With dead ends: 1618 [2022-12-14 13:00:08,693 INFO L226 Difference]: Without dead ends: 822 [2022-12-14 13:00:08,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:00:08,695 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 197 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:08,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 68 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:00:08,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-12-14 13:00:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 822. [2022-12-14 13:00:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 810 states have (on average 1.4012345679012346) internal successors, (1135), 821 states have internal predecessors, (1135), 0 states have call successors, (0), 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-12-14 13:00:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1135 transitions. [2022-12-14 13:00:08,776 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1135 transitions. Word has length 58 [2022-12-14 13:00:08,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:08,776 INFO L495 AbstractCegarLoop]: Abstraction has 822 states and 1135 transitions. [2022-12-14 13:00:08,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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-12-14 13:00:08,776 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1135 transitions. [2022-12-14 13:00:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 13:00:08,777 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:08,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:08,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 13:00:08,777 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:08,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:08,777 INFO L85 PathProgramCache]: Analyzing trace with hash -398610401, now seen corresponding path program 1 times [2022-12-14 13:00:08,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:08,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614696919] [2022-12-14 13:00:08,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:08,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 13:00:09,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:09,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614696919] [2022-12-14 13:00:09,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614696919] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:00:09,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40740245] [2022-12-14 13:00:09,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:09,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:00:09,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:00:09,015 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:00:09,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 13:00:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:09,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 13:00:09,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:00:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:00:09,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:00:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 13:00:09,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40740245] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:00:09,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1837431693] [2022-12-14 13:00:09,746 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2022-12-14 13:00:09,746 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 13:00:09,749 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 13:00:09,753 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 13:00:09,753 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 13:00:09,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 13:00:09,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 13:00:09,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-12-14 13:00:09,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:00:09,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:00:09,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:00:09,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-12-14 13:00:14,482 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 13:00:27,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1837431693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:27,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:00:27,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [5, 4, 5] total 52 [2022-12-14 13:00:27,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133177024] [2022-12-14 13:00:27,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:27,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 13:00:27,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:27,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 13:00:27,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=2085, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 13:00:27,309 INFO L87 Difference]: Start difference. First operand 822 states and 1135 transitions. Second operand has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:00:34,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:34,110 INFO L93 Difference]: Finished difference Result 2035 states and 2849 transitions. [2022-12-14 13:00:34,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-14 13:00:34,111 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-12-14 13:00:34,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:34,114 INFO L225 Difference]: With dead ends: 2035 [2022-12-14 13:00:34,114 INFO L226 Difference]: Without dead ends: 1229 [2022-12-14 13:00:34,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 118 SyntacticMatches, 9 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2457 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=1160, Invalid=4390, Unknown=0, NotChecked=0, Total=5550 [2022-12-14 13:00:34,115 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 77 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:34,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 126 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 13:00:34,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2022-12-14 13:00:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1206. [2022-12-14 13:00:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1194 states have (on average 1.3165829145728642) internal successors, (1572), 1205 states have internal predecessors, (1572), 0 states have call successors, (0), 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-12-14 13:00:34,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1572 transitions. [2022-12-14 13:00:34,267 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1572 transitions. Word has length 58 [2022-12-14 13:00:34,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:34,268 INFO L495 AbstractCegarLoop]: Abstraction has 1206 states and 1572 transitions. [2022-12-14 13:00:34,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:00:34,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1572 transitions. [2022-12-14 13:00:34,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-14 13:00:34,269 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:34,269 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:34,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 13:00:34,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 13:00:34,470 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:34,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:34,470 INFO L85 PathProgramCache]: Analyzing trace with hash -545673620, now seen corresponding path program 1 times [2022-12-14 13:00:34,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:34,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945922833] [2022-12-14 13:00:34,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:34,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:00:34,542 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:34,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945922833] [2022-12-14 13:00:34,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945922833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:34,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:34,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:00:34,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411827852] [2022-12-14 13:00:34,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:34,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:00:34,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:34,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:00:34,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:00:34,544 INFO L87 Difference]: Start difference. First operand 1206 states and 1572 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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-12-14 13:00:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:34,710 INFO L93 Difference]: Finished difference Result 2268 states and 2955 transitions. [2022-12-14 13:00:34,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:00:34,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 81 [2022-12-14 13:00:34,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:34,713 INFO L225 Difference]: With dead ends: 2268 [2022-12-14 13:00:34,713 INFO L226 Difference]: Without dead ends: 1087 [2022-12-14 13:00:34,714 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-12-14 13:00:34,714 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 29 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:34,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 157 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:00:34,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2022-12-14 13:00:34,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 932. [2022-12-14 13:00:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 920 states have (on average 1.3141304347826086) internal successors, (1209), 931 states have internal predecessors, (1209), 0 states have call successors, (0), 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-12-14 13:00:34,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1209 transitions. [2022-12-14 13:00:34,832 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1209 transitions. Word has length 81 [2022-12-14 13:00:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:34,832 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 1209 transitions. [2022-12-14 13:00:34,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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-12-14 13:00:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1209 transitions. [2022-12-14 13:00:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-14 13:00:34,833 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:34,833 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:34,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 13:00:34,833 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:34,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:34,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1816895466, now seen corresponding path program 2 times [2022-12-14 13:00:34,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:34,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095066848] [2022-12-14 13:00:34,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:34,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 13:00:34,871 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:34,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095066848] [2022-12-14 13:00:34,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095066848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:34,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:34,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:00:34,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969668862] [2022-12-14 13:00:34,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:34,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:00:34,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:34,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:00:34,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:00:34,873 INFO L87 Difference]: Start difference. First operand 932 states and 1209 transitions. Second operand has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 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-12-14 13:00:35,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:35,069 INFO L93 Difference]: Finished difference Result 933 states and 1209 transitions. [2022-12-14 13:00:35,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:00:35,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 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 81 [2022-12-14 13:00:35,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:35,071 INFO L225 Difference]: With dead ends: 933 [2022-12-14 13:00:35,071 INFO L226 Difference]: Without dead ends: 930 [2022-12-14 13:00:35,072 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-12-14 13:00:35,072 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 53 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:35,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 61 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:00:35,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2022-12-14 13:00:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2022-12-14 13:00:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 920 states have (on average 1.2956521739130435) internal successors, (1192), 929 states have internal predecessors, (1192), 0 states have call successors, (0), 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-12-14 13:00:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1192 transitions. [2022-12-14 13:00:35,196 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1192 transitions. Word has length 81 [2022-12-14 13:00:35,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:35,196 INFO L495 AbstractCegarLoop]: Abstraction has 930 states and 1192 transitions. [2022-12-14 13:00:35,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 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-12-14 13:00:35,196 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1192 transitions. [2022-12-14 13:00:35,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-14 13:00:35,197 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:35,197 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:35,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 13:00:35,197 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:35,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:35,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1325175212, now seen corresponding path program 3 times [2022-12-14 13:00:35,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:35,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887428052] [2022-12-14 13:00:35,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:35,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:35,257 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 13:00:35,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:35,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887428052] [2022-12-14 13:00:35,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887428052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:35,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:35,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:00:35,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517418194] [2022-12-14 13:00:35,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:35,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:00:35,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:35,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:00:35,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:00:35,258 INFO L87 Difference]: Start difference. First operand 930 states and 1192 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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-12-14 13:00:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:35,348 INFO L93 Difference]: Finished difference Result 1315 states and 1661 transitions. [2022-12-14 13:00:35,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:00:35,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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) Word has length 81 [2022-12-14 13:00:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:35,350 INFO L225 Difference]: With dead ends: 1315 [2022-12-14 13:00:35,350 INFO L226 Difference]: Without dead ends: 405 [2022-12-14 13:00:35,350 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-12-14 13:00:35,351 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 23 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 138 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-12-14 13:00:35,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 138 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:00:35,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-12-14 13:00:35,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 380. [2022-12-14 13:00:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 370 states have (on average 1.2594594594594595) internal successors, (466), 379 states have internal predecessors, (466), 0 states have call successors, (0), 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-12-14 13:00:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 466 transitions. [2022-12-14 13:00:35,409 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 466 transitions. Word has length 81 [2022-12-14 13:00:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:35,409 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 466 transitions. [2022-12-14 13:00:35,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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-12-14 13:00:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 466 transitions. [2022-12-14 13:00:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-12-14 13:00:35,410 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:35,410 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:35,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 13:00:35,410 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:35,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:35,410 INFO L85 PathProgramCache]: Analyzing trace with hash -489184462, now seen corresponding path program 1 times [2022-12-14 13:00:35,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:35,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114258076] [2022-12-14 13:00:35,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:35,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 13:00:35,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:35,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114258076] [2022-12-14 13:00:35,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114258076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:35,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:35,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:00:35,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617841149] [2022-12-14 13:00:35,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:35,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:00:35,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:35,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:00:35,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:00:35,446 INFO L87 Difference]: Start difference. First operand 380 states and 466 transitions. Second operand has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 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-12-14 13:00:35,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:35,566 INFO L93 Difference]: Finished difference Result 381 states and 466 transitions. [2022-12-14 13:00:35,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:00:35,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 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 82 [2022-12-14 13:00:35,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:35,568 INFO L225 Difference]: With dead ends: 381 [2022-12-14 13:00:35,568 INFO L226 Difference]: Without dead ends: 376 [2022-12-14 13:00:35,568 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-12-14 13:00:35,568 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 50 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:35,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 56 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:00:35,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-12-14 13:00:35,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 374. [2022-12-14 13:00:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 366 states have (on average 1.2185792349726776) internal successors, (446), 373 states have internal predecessors, (446), 0 states have call successors, (0), 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-12-14 13:00:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 446 transitions. [2022-12-14 13:00:35,620 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 446 transitions. Word has length 82 [2022-12-14 13:00:35,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:35,620 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 446 transitions. [2022-12-14 13:00:35,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 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-12-14 13:00:35,620 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 446 transitions. [2022-12-14 13:00:35,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-12-14 13:00:35,621 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:35,621 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:35,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 13:00:35,621 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:35,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:35,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2015151000, now seen corresponding path program 1 times [2022-12-14 13:00:35,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:35,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635293346] [2022-12-14 13:00:35,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:35,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:00:35,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:35,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635293346] [2022-12-14 13:00:35,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635293346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:35,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:35,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:00:35,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110041171] [2022-12-14 13:00:35,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:35,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:00:35,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:35,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:00:35,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:00:35,682 INFO L87 Difference]: Start difference. First operand 374 states and 446 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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-12-14 13:00:35,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:35,736 INFO L93 Difference]: Finished difference Result 574 states and 675 transitions. [2022-12-14 13:00:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:00:35,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 83 [2022-12-14 13:00:35,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:35,737 INFO L225 Difference]: With dead ends: 574 [2022-12-14 13:00:35,738 INFO L226 Difference]: Without dead ends: 240 [2022-12-14 13:00:35,738 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-12-14 13:00:35,738 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 13 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:35,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 142 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:00:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-12-14 13:00:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 230. [2022-12-14 13:00:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 222 states have (on average 1.1801801801801801) internal successors, (262), 229 states have internal predecessors, (262), 0 states have call successors, (0), 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-12-14 13:00:35,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 262 transitions. [2022-12-14 13:00:35,769 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 262 transitions. Word has length 83 [2022-12-14 13:00:35,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:35,769 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 262 transitions. [2022-12-14 13:00:35,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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-12-14 13:00:35,769 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 262 transitions. [2022-12-14 13:00:35,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 13:00:35,770 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:35,770 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:35,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 13:00:35,770 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:35,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:35,770 INFO L85 PathProgramCache]: Analyzing trace with hash -412724424, now seen corresponding path program 1 times [2022-12-14 13:00:35,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:35,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303761073] [2022-12-14 13:00:35,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:35,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 13:00:35,809 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:35,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303761073] [2022-12-14 13:00:35,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303761073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:35,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:35,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:00:35,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023853079] [2022-12-14 13:00:35,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:35,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:00:35,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:35,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:00:35,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:00:35,810 INFO L87 Difference]: Start difference. First operand 230 states and 262 transitions. Second operand has 3 states, 2 states have (on average 38.5) internal successors, (77), 3 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-12-14 13:00:35,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:35,891 INFO L93 Difference]: Finished difference Result 231 states and 262 transitions. [2022-12-14 13:00:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:00:35,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 38.5) internal successors, (77), 3 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) Word has length 84 [2022-12-14 13:00:35,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:35,892 INFO L225 Difference]: With dead ends: 231 [2022-12-14 13:00:35,892 INFO L226 Difference]: Without dead ends: 224 [2022-12-14 13:00:35,892 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-12-14 13:00:35,892 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 43 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:35,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 50 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:00:35,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-12-14 13:00:35,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2022-12-14 13:00:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 217 states have (on average 1.1566820276497696) internal successors, (251), 222 states have internal predecessors, (251), 0 states have call successors, (0), 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-12-14 13:00:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 251 transitions. [2022-12-14 13:00:35,951 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 251 transitions. Word has length 84 [2022-12-14 13:00:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:35,951 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 251 transitions. [2022-12-14 13:00:35,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 38.5) internal successors, (77), 3 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-12-14 13:00:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 251 transitions. [2022-12-14 13:00:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-12-14 13:00:35,952 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:35,952 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:35,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 13:00:35,952 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:35,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:35,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1016833922, now seen corresponding path program 1 times [2022-12-14 13:00:35,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:35,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735551279] [2022-12-14 13:00:35,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:35,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:35,989 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 13:00:35,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:35,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735551279] [2022-12-14 13:00:35,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735551279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:35,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:35,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:00:35,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476866016] [2022-12-14 13:00:35,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:35,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:00:35,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:35,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:00:35,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:00:35,991 INFO L87 Difference]: Start difference. First operand 223 states and 251 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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-12-14 13:00:36,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:36,053 INFO L93 Difference]: Finished difference Result 353 states and 405 transitions. [2022-12-14 13:00:36,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:00:36,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 85 [2022-12-14 13:00:36,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:36,054 INFO L225 Difference]: With dead ends: 353 [2022-12-14 13:00:36,054 INFO L226 Difference]: Without dead ends: 222 [2022-12-14 13:00:36,055 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-12-14 13:00:36,055 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:36,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 125 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:00:36,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-12-14 13:00:36,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 199. [2022-12-14 13:00:36,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 193 states have (on average 1.145077720207254) internal successors, (221), 198 states have internal predecessors, (221), 0 states have call successors, (0), 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-12-14 13:00:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 221 transitions. [2022-12-14 13:00:36,098 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 221 transitions. Word has length 85 [2022-12-14 13:00:36,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:36,098 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 221 transitions. [2022-12-14 13:00:36,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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-12-14 13:00:36,099 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 221 transitions. [2022-12-14 13:00:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 13:00:36,099 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:36,099 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:36,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 13:00:36,100 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:36,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:36,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1316264089, now seen corresponding path program 1 times [2022-12-14 13:00:36,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:36,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341975591] [2022-12-14 13:00:36,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:36,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:36,158 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 13:00:36,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:36,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341975591] [2022-12-14 13:00:36,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341975591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:36,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:00:36,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:00:36,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888592890] [2022-12-14 13:00:36,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:36,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:00:36,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:36,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:00:36,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:00:36,160 INFO L87 Difference]: Start difference. First operand 199 states and 221 transitions. Second operand has 3 states, 2 states have (on average 41.5) internal successors, (83), 3 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-12-14 13:00:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:36,230 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-12-14 13:00:36,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:00:36,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 41.5) internal successors, (83), 3 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) Word has length 89 [2022-12-14 13:00:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:36,231 INFO L225 Difference]: With dead ends: 200 [2022-12-14 13:00:36,231 INFO L226 Difference]: Without dead ends: 193 [2022-12-14 13:00:36,232 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-12-14 13:00:36,232 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:36,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 50 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:00:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-12-14 13:00:36,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 163. [2022-12-14 13:00:36,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 159 states have (on average 1.1132075471698113) internal successors, (177), 162 states have internal predecessors, (177), 0 states have call successors, (0), 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-12-14 13:00:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2022-12-14 13:00:36,272 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 89 [2022-12-14 13:00:36,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:36,272 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2022-12-14 13:00:36,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 41.5) internal successors, (83), 3 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-12-14 13:00:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2022-12-14 13:00:36,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-14 13:00:36,272 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:00:36,273 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:36,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 13:00:36,273 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:00:36,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:00:36,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1284876936, now seen corresponding path program 4 times [2022-12-14 13:00:36,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:00:36,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622106399] [2022-12-14 13:00:36,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:00:36,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:00:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:36,632 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 13:00:36,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:00:36,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622106399] [2022-12-14 13:00:36,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622106399] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:00:36,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809543002] [2022-12-14 13:00:36,632 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 13:00:36,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:00:36,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:00:36,633 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:00:36,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 13:00:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:00:36,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 13:00:36,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:00:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 13:00:36,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:00:36,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809543002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:00:36,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 13:00:36,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-12-14 13:00:36,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822340704] [2022-12-14 13:00:36,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:00:36,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:00:36,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:00:36,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:00:36,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-14 13:00:36,761 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 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-12-14 13:00:36,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:00:36,823 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2022-12-14 13:00:36,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:00:36,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 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 97 [2022-12-14 13:00:36,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:00:36,824 INFO L225 Difference]: With dead ends: 170 [2022-12-14 13:00:36,824 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 13:00:36,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-14 13:00:36,825 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 15 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:00:36,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 194 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:00:36,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 13:00:36,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 13:00:36,826 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-12-14 13:00:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 13:00:36,826 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2022-12-14 13:00:36,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:00:36,826 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 13:00:36,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 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-12-14 13:00:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 13:00:36,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 13:00:36,829 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-12-14 13:00:36,829 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-12-14 13:00:36,829 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-12-14 13:00:36,829 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-12-14 13:00:36,829 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-12-14 13:00:36,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-12-14 13:00:36,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-12-14 13:00:36,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-12-14 13:00:36,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-12-14 13:00:36,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-12-14 13:00:36,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-12-14 13:00:36,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-12-14 13:00:36,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-12-14 13:00:36,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-12-14 13:00:36,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 13:00:37,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 13:00:37,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 13:00:44,985 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-12-14 13:00:44,985 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 280) no Hoare annotation was computed. [2022-12-14 13:00:44,985 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 407) no Hoare annotation was computed. [2022-12-14 13:00:44,985 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 447) no Hoare annotation was computed. [2022-12-14 13:00:44,985 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-12-14 13:00:44,985 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-12-14 13:00:44,986 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 402) no Hoare annotation was computed. [2022-12-14 13:00:44,986 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 442) no Hoare annotation was computed. [2022-12-14 13:00:44,986 INFO L895 garLoopResultBuilder]: At program point L270(lines 267 280) the Hoare annotation is: (and (<= 0 ~id3~0) (= ~mode2~0 1) (<= 0 ~id1~0) (<= |ULTIMATE.start_main_~main__c1~0#1| 1) (= ~p3_new~0 ~nomsg~0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= 0 |ULTIMATE.start_main_~main__i2~0#1|) (<= |#NULL.offset| 0) (<= 0 ~st1~0) (<= ~__return_1389~0 1) (<= 1 ~__return_1389~0) (= (* 256 (div ~mode3~0 256)) ~mode3~0) (<= 0 ~st2~0) (<= ~p1~0 0) (<= ~__return_main~0 0) (<= 0 ~p2~0) (<= 0 ~send2~0) (= ~mode1~0 1) (<= ~id1~0 127) (<= |ULTIMATE.start_main_~main__i2~0#1| 0) (<= 0 ~__return_main~0) (<= ~id3~0 127) (<= 0 ~id2~0) (<= 0 (+ ~nomsg~0 1)) (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~0#1|) (<= ~p2~0 0) (= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| ~send3~0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= (+ ~p3_new~0 1) 0) (<= |ULTIMATE.start_main_~init__tmp~0#1| 1) (<= 0 |#NULL.offset|) (= ~p3~0 0) (<= 0 ~__return_1465~0) (<= ~__return_1465~0 1) (<= 0 ~send3~0) (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (<= 0 ~p1~0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= 0 |ULTIMATE.start_main_~main__c1~0#1|) (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|) (= |#NULL.base| 0)) [2022-12-14 13:00:44,988 INFO L895 garLoopResultBuilder]: At program point L122(lines 114 383) the Hoare annotation is: (let ((.cse49 (= |ULTIMATE.start_main_~main__c1~0#1| 0)) (.cse53 (+ ~p3_new~0 1)) (.cse51 (+ ~nomsg~0 1)) (.cse55 (+ ~p2_new~0 1)) (.cse54 (+ ~p1_new~0 1))) (let ((.cse4 (< (mod ~r1~0 256) 3)) (.cse13 (<= 0 ~p2~0)) (.cse24 (<= ~p2~0 0)) (.cse28 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse39 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse42 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse43 (= (* 256 (div ~mode1~0 256)) ~mode1~0)) (.cse6 (= ~p3_new~0 ~nomsg~0)) (.cse0 (<= 0 ~id3~0)) (.cse1 (<= 0 ~id1~0)) (.cse2 (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1465~0)) (.cse3 (<= .cse54 0)) (.cse5 (= |ULTIMATE.start_main_~check__tmp~0#1| 1)) (.cse7 (= (+ ~st3~0 ~st2~0 ~st1~0) 0)) (.cse8 (<= 0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|)) (.cse44 (<= ~mode2~0 1)) (.cse9 (<= 0 ~st1~0)) (.cse10 (<= ~__return_1389~0 1)) (.cse11 (<= 1 ~__return_1389~0)) (.cse12 (<= 0 ~st2~0)) (.cse46 (<= ~mode3~0 1)) (.cse14 (<= 0 ~send2~0)) (.cse15 (<= ~id1~0 127)) (.cse16 (<= 0 .cse55)) (.cse47 (<= ~mode1~0 1)) (.cse17 (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|)) (.cse18 (<= .cse55 0)) (.cse19 (<= 0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|)) (.cse20 (<= ~id3~0 127)) (.cse21 (<= 0 ~id2~0)) (.cse22 (= |#NULL.offset| 0)) (.cse23 (<= 0 .cse51)) (.cse25 (<= ~id2~0 127)) (.cse26 (<= 0 ~st3~0)) (.cse27 (<= .cse53 0)) (.cse29 (= ~p3~0 0)) (.cse30 (<= 0 .cse54)) (.cse31 (= (ite .cse49 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|)) (.cse32 (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1465~0)) (.cse33 (<= 0 ~send3~0)) (.cse34 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse35 (= ~p1~0 0)) (.cse36 (<= 0 |#StackHeapBarrier|)) (.cse37 (<= 0 ~send1~0)) (.cse38 (= ~__return_main~0 0)) (.cse40 (= |#NULL.base| 0)) (.cse41 (= |ULTIMATE.start_main_~main__i2~0#1| 0)) (.cse45 (= (* 256 (div ~mode3~0 256)) ~mode3~0))) (or (and (= ~mode3~0 1) .cse0 (= ~mode2~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~mode1~0 1) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) (and .cse0 (<= 0 ~mode1~0) .cse1 .cse42 .cse2 .cse3 .cse4 (<= 0 ~mode3~0) .cse5 .cse43 .cse6 .cse7 .cse8 .cse44 .cse9 .cse10 .cse11 .cse45 .cse12 .cse46 .cse13 .cse14 .cse15 .cse16 .cse47 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= 0 ~mode2~0) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) (and .cse42 .cse43 (let ((.cse48 (= ~p2~0 0)) (.cse50 (= |ULTIMATE.start_main_~init__tmp~0#1| 1))) (or (let ((.cse52 (select |#memory_int| 1))) (and (= 48 (select |#length| 2)) .cse0 (= (select |#length| 3) 12) (= ~nomsg~0 ~p1_new~0) .cse1 .cse48 (= ~__return_1465~0 0) (= (select ~nodes~0.base 0) |#funAddr~node1.base|) (= 2 (select |#length| 1)) (= ~send3~0 ~id3~0) .cse6 (= |#funAddr~node3.base| (select ~nodes~0.base 2)) (= (select |#valid| 3) 1) (= ~st3~0 0) (= |ULTIMATE.start_main_~init__tmp~0#1| ~__return_1389~0) (= ~nomsg~0 ~p2_old~0) (not (= ~id3~0 ~id2~0)) (= |#funAddr~node2.base| (select ~nodes~0.base 1)) (not (= ~id1~0 ~id3~0)) .cse49 .cse15 (= ~nomsg~0 ~p2_new~0) (= ~st1~0 0) (not (= ~id1~0 ~id2~0)) (= ~nomsg~0 ~p1_old~0) .cse50 (= (select ~nodes~0.offset 0) |#funAddr~node1.offset|) (= (select |#valid| 1) 1) (= .cse51 0) (= ~send1~0 ~id1~0) (= (select |#valid| 0) 0) .cse20 (= (select |#valid| 2) 1) .cse21 .cse22 (= ~st2~0 0) (= ~p3_old~0 ~nomsg~0) (= (select .cse52 0) 48) (= (select ~nodes~0.offset 2) |#funAddr~node3.offset|) .cse25 .cse29 (= (select .cse52 1) 0) .cse35 (= |#funAddr~node2.offset| (select ~nodes~0.offset 1)) .cse38 (< 0 |#StackHeapBarrier|) (= ~send2~0 ~id2~0) .cse40 .cse41)) (and .cse0 (<= 0 .cse53) .cse1 .cse2 .cse48 .cse3 .cse5 .cse7 .cse8 .cse44 .cse9 .cse10 .cse11 .cse12 .cse46 .cse14 .cse15 .cse50 .cse16 (<= .cse51 0) .cse47 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 .cse41))) .cse45 (<= ~r1~0 (* (div ~r1~0 256) 256)))))) [2022-12-14 13:00:44,988 INFO L895 garLoopResultBuilder]: At program point L172(lines 161 286) the Hoare annotation is: (let ((.cse31 (+ ~nomsg~0 1))) (let ((.cse0 (<= 0 ~id3~0)) (.cse1 (<= 0 ~id1~0)) (.cse2 (= ~p2~0 0)) (.cse4 (<= |ULTIMATE.start_main_~main__c1~0#1| 1)) (.cse5 (<= 0 ~st1~0)) (.cse6 (<= ~__return_1389~0 1)) (.cse7 (<= 1 ~__return_1389~0)) (.cse8 (<= 0 ~st2~0)) (.cse9 (<= 0 ~send2~0)) (.cse10 (<= ~id1~0 127)) (.cse11 (= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse13 (<= ~id3~0 127)) (.cse14 (<= 0 ~id2~0)) (.cse15 (= |#NULL.offset| 0)) (.cse16 (<= 0 .cse31)) (.cse17 (<= ~id2~0 127)) (.cse18 (<= 0 ~st3~0)) (.cse19 (= ~p3~0 0)) (.cse20 (<= 0 ~__return_1465~0)) (.cse21 (<= ~__return_1465~0 1)) (.cse22 (<= 0 ~send3~0)) (.cse23 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse24 (= ~p1~0 0)) (.cse25 (<= 0 |#StackHeapBarrier|)) (.cse26 (<= 0 ~send1~0)) (.cse27 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse28 (= ~__return_main~0 0)) (.cse29 (= |#NULL.base| 0)) (.cse30 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (let ((.cse12 (+ ~p2_new~0 1)) (.cse3 (+ ~p1_new~0 1))) (and .cse0 (<= ~st2~0 1) .cse1 (= (* 256 (div ~mode2~0 256)) ~mode2~0) .cse2 (<= .cse3 0) .cse4 (<= 0 ~mode3~0) (= ~p3_new~0 ~nomsg~0) (<= 0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= ~mode2~0 1) .cse5 .cse6 .cse7 (= (* 256 (div ~mode3~0 256)) ~mode3~0) .cse8 (<= ~mode3~0 1) .cse9 .cse10 (<= ~st1~0 1) .cse11 (<= 0 .cse12) (<= .cse12 0) (= ~mode1~0 0) (<= 0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) .cse13 (<= ~st3~0 1) .cse14 .cse15 .cse16 (<= 0 ~mode2~0) .cse17 .cse18 (<= (+ ~p3_new~0 1) 0) .cse19 (<= 0 .cse3) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30)) (and (= ~mode3~0 1) .cse0 (= ~mode2~0 1) .cse1 .cse2 .cse4 (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) .cse5 .cse6 .cse7 .cse8 .cse9 (= ~mode1~0 1) .cse10 .cse11 (<= .cse31 0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30)))) [2022-12-14 13:00:44,988 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 397) no Hoare annotation was computed. [2022-12-14 13:00:44,989 INFO L895 garLoopResultBuilder]: At program point L189(lines 181 241) the Hoare annotation is: (let ((.cse45 (+ ~nomsg~0 1)) (.cse48 (+ ~p2_new~0 1)) (.cse46 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse47 (+ ~p1_new~0 1))) (let ((.cse2 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse13 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse20 (= ~mode1~0 0)) (.cse0 (<= 0 ~id3~0)) (.cse1 (<= 0 ~id1~0)) (.cse3 (<= .cse47 0)) (.cse4 (<= |ULTIMATE.start_main_~main__c1~0#1| 1)) (.cse5 (< (mod ~r1~0 256) 3)) (.cse6 (= |ULTIMATE.start_main_~check__tmp~0#1| 1)) (.cse7 (= ~p3_new~0 ~nomsg~0)) (.cse8 (= .cse46 0)) (.cse9 (<= 0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|)) (.cse10 (<= 0 ~st1~0)) (.cse11 (<= ~__return_1389~0 1)) (.cse12 (<= 1 ~__return_1389~0)) (.cse14 (<= 0 ~st2~0)) (.cse15 (<= 0 ~p2~0)) (.cse16 (<= 0 ~send2~0)) (.cse17 (<= ~id1~0 127)) (.cse18 (<= 0 .cse48)) (.cse19 (<= .cse48 0)) (.cse21 (<= 0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|)) (.cse22 (<= ~id3~0 127)) (.cse23 (<= 0 ~id2~0)) (.cse24 (= |#NULL.offset| 0)) (.cse25 (<= 0 .cse45)) (.cse26 (<= ~p2~0 0)) (.cse27 (<= ~id2~0 127)) (.cse28 (<= 0 ~st3~0)) (.cse29 (<= (+ ~p3_new~0 1) 0)) (.cse30 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse31 (= ~p3~0 0)) (.cse32 (<= 0 .cse47)) (.cse33 (<= 0 ~__return_1465~0)) (.cse34 (<= ~__return_1465~0 1)) (.cse35 (<= 0 ~send3~0)) (.cse36 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse37 (= ~p1~0 0)) (.cse38 (<= 0 |#StackHeapBarrier|)) (.cse39 (<= 0 ~send1~0)) (.cse40 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse41 (= ~__return_main~0 0)) (.cse42 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse43 (= |#NULL.base| 0)) (.cse44 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 ~mode3~0) .cse6 .cse7 .cse8 .cse9 (<= ~mode2~0 1) .cse10 .cse11 .cse12 .cse13 .cse14 (<= ~mode3~0 1) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (<= 0 ~mode2~0) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44) (and (<= .cse45 ~id3~0) (<= .cse45 ~send3~0) (<= .cse45 ~send2~0) .cse2 (= |ULTIMATE.start_main_~check__tmp~0#1| 0) (<= (+ ~st2~0 ~st1~0) 2147483647) .cse10 .cse13 (<= .cse45 ~id2~0) (<= .cse45 0) .cse20 (not (<= (+ 2147483649 ~st3~0 ~st2~0 ~st1~0) 0)) (not (<= (+ 2147483649 ~st2~0 ~st1~0) 0)) (<= .cse46 2147483647)) (and (= ~mode3~0 1) .cse0 (= ~mode2~0 1) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 (= ~mode1~0 1) .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44)))) [2022-12-14 13:00:44,989 INFO L895 garLoopResultBuilder]: At program point $Ultimate##60(lines 186 222) the Hoare annotation is: (let ((.cse55 (+ ~nomsg~0 1)) (.cse57 (+ ~p2_new~0 1)) (.cse54 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse56 (+ ~p1_new~0 1))) (let ((.cse1 (<= 0 ~id3~0)) (.cse3 (<= 0 ~id1~0)) (.cse4 (<= .cse56 0)) (.cse5 (<= |ULTIMATE.start_main_~main__c1~0#1| 1)) (.cse6 (= ~p3_new~0 ~nomsg~0)) (.cse7 (= .cse54 0)) (.cse8 (<= 0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|)) (.cse10 (<= ~__return_1389~0 1)) (.cse11 (<= 1 ~__return_1389~0)) (.cse12 (<= 0 ~st2~0)) (.cse13 (<= 0 ~p2~0)) (.cse14 (<= 0 ~send2~0)) (.cse16 (<= ~id1~0 127)) (.cse17 (<= 0 .cse57)) (.cse18 (<= .cse57 0)) (.cse19 (<= 0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|)) (.cse20 (<= ~id3~0 127)) (.cse21 (<= 0 ~id2~0)) (.cse22 (= |#NULL.offset| 0)) (.cse23 (<= 0 .cse55)) (.cse24 (<= ~p2~0 0)) (.cse25 (<= ~id2~0 127)) (.cse26 (<= 0 ~st3~0)) (.cse27 (<= (+ ~p3_new~0 1) 0)) (.cse28 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse29 (= ~p3~0 0)) (.cse30 (<= 0 .cse56)) (.cse31 (<= 0 ~__return_1465~0)) (.cse32 (<= ~__return_1465~0 1)) (.cse33 (<= 0 ~send3~0)) (.cse34 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse35 (= ~p1~0 0)) (.cse36 (<= 0 |#StackHeapBarrier|)) (.cse37 (<= 0 ~send1~0)) (.cse38 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse39 (= ~__return_main~0 0)) (.cse40 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse41 (= |#NULL.base| 0)) (.cse42 (= |ULTIMATE.start_main_~main__i2~0#1| 0)) (.cse0 (= ~mode3~0 1)) (.cse2 (= ~mode2~0 1)) (.cse15 (= ~mode1~0 1)) (.cse43 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse9 (<= 0 ~st1~0)) (.cse44 (= (* 256 (div ~mode3~0 256)) ~mode3~0))) (or (and .cse0 .cse1 .cse2 .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 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42) (and .cse1 .cse3 .cse43 .cse4 .cse5 (<= 0 ~mode3~0) .cse6 .cse7 .cse8 (<= ~mode2~0 1) .cse9 .cse10 .cse11 .cse44 .cse12 (<= ~mode3~0 1) .cse13 .cse14 .cse16 .cse17 .cse18 (= ~mode1~0 0) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= 0 ~mode2~0) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42) (and (let ((.cse45 (<= .cse55 ~id3~0)) (.cse46 (not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 2)))) (.cse47 (<= .cse55 ~send3~0)) (.cse48 (<= .cse55 ~send2~0)) (.cse49 (<= (+ ~st2~0 ~st1~0) 2147483647)) (.cse50 (<= .cse55 ~id2~0)) (.cse51 (<= .cse55 0)) (.cse52 (not (<= (+ 2147483649 ~st2~0 ~st1~0) 0))) (.cse53 (<= .cse54 2147483647))) (or (and .cse45 .cse46 .cse47 .cse0 .cse2 .cse48 .cse49 .cse9 .cse15 .cse50 .cse51 .cse52 .cse53) (and .cse45 .cse46 .cse47 .cse48 .cse43 (= (* 256 (div ~mode1~0 256)) ~mode1~0) .cse49 .cse9 .cse44 .cse50 .cse51 .cse52 .cse53))) (not (<= (+ 2147483649 ~st3~0 ~st2~0 ~st1~0) 0)))))) [2022-12-14 13:00:44,989 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 437) no Hoare annotation was computed. [2022-12-14 13:00:44,989 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-12-14 13:00:44,989 INFO L895 garLoopResultBuilder]: At program point L322(lines 310 330) the Hoare annotation is: false [2022-12-14 13:00:44,989 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 13:00:44,990 INFO L895 garLoopResultBuilder]: At program point L157(lines 146 331) the Hoare annotation is: (let ((.cse30 (+ ~p3_new~0 1)) (.cse31 (+ ~nomsg~0 1))) (let ((.cse0 (<= 0 ~id3~0)) (.cse1 (<= 0 ~id1~0)) (.cse3 (<= |ULTIMATE.start_main_~main__c1~0#1| 1)) (.cse4 (<= 0 ~st1~0)) (.cse5 (<= ~__return_1389~0 1)) (.cse6 (<= 1 ~__return_1389~0)) (.cse7 (<= 0 ~st2~0)) (.cse8 (<= 0 ~p2~0)) (.cse9 (<= 0 ~send2~0)) (.cse10 (<= ~id1~0 127)) (.cse12 (<= ~id3~0 127)) (.cse13 (<= 0 ~id2~0)) (.cse14 (<= 0 .cse31)) (.cse15 (<= ~p2~0 0)) (.cse16 (<= ~id2~0 127)) (.cse17 (<= 0 ~st3~0)) (.cse18 (<= .cse30 0)) (.cse19 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse20 (= ~p3~0 0)) (.cse21 (<= 0 ~__return_1465~0)) (.cse22 (<= ~__return_1465~0 1)) (.cse23 (<= 0 ~send3~0)) (.cse24 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse25 (<= 0 |#StackHeapBarrier|)) (.cse26 (<= 0 ~send1~0)) (.cse27 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse28 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse29 (= |#NULL.base| 0))) (or (let ((.cse11 (+ ~p2_new~0 1)) (.cse2 (+ ~p1_new~0 1))) (and (= ~mode3~0 1) .cse0 (<= ~st3~0 0) (<= ~st2~0 1) .cse1 (= (* 256 (div ~mode2~0 256)) ~mode2~0) (<= .cse2 0) .cse3 (= ~p3_new~0 ~nomsg~0) (<= 0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= ~mode2~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~st1~0 1) (<= 0 .cse11) (<= .cse11 0) (= ~mode1~0 0) (<= 0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) .cse12 .cse13 (= |#NULL.offset| 0) .cse14 .cse15 (<= 0 ~mode2~0) .cse16 .cse17 .cse18 .cse19 .cse20 (<= 0 .cse2) .cse21 .cse22 .cse23 .cse24 (= ~p1~0 0) .cse25 .cse26 .cse27 (= ~__return_main~0 0) .cse28 .cse29 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (and .cse0 (<= 0 .cse30) (= ~mode2~0 1) .cse1 .cse3 (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= 0 |ULTIMATE.start_main_~main__i2~0#1|) (<= |#NULL.offset| 0) .cse4 .cse5 .cse6 (= (* 256 (div ~mode3~0 256)) ~mode3~0) .cse7 (<= ~p1~0 0) (<= ~__return_main~0 0) .cse8 .cse9 (= ~mode1~0 1) .cse10 (<= |ULTIMATE.start_main_~main__i2~0#1| 0) (<= .cse31 0) (<= 0 ~__return_main~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= 0 |#NULL.offset|) .cse20 .cse21 .cse22 .cse23 .cse24 (<= 0 ~p1~0) .cse25 .cse26 .cse27 .cse28 .cse29)))) [2022-12-14 13:00:44,990 INFO L895 garLoopResultBuilder]: At program point L372(lines 360 380) the Hoare annotation is: false [2022-12-14 13:00:44,990 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-12-14 13:00:44,990 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 392) no Hoare annotation was computed. [2022-12-14 13:00:44,990 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-12-14 13:00:44,990 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 432) no Hoare annotation was computed. [2022-12-14 13:00:44,991 INFO L895 garLoopResultBuilder]: At program point L142(lines 126 381) the Hoare annotation is: (let ((.cse1 (+ ~p3_new~0 1)) (.cse12 (+ ~nomsg~0 1)) (.cse33 (+ ~p2_new~0 1))) (let ((.cse0 (<= 0 ~id3~0)) (.cse2 (<= 0 ~id1~0)) (.cse3 (<= |ULTIMATE.start_main_~main__c1~0#1| 1)) (.cse4 (<= 0 ~st1~0)) (.cse5 (<= ~__return_1389~0 1)) (.cse6 (<= 1 ~__return_1389~0)) (.cse7 (<= 0 ~st2~0)) (.cse8 (<= 0 ~p2~0)) (.cse9 (<= 0 ~send2~0)) (.cse10 (<= ~id1~0 127)) (.cse11 (<= 0 .cse33)) (.cse13 (<= .cse33 0)) (.cse14 (<= ~id3~0 127)) (.cse15 (<= 0 ~id2~0)) (.cse16 (<= 0 .cse12)) (.cse17 (<= ~p2~0 0)) (.cse18 (<= ~id2~0 127)) (.cse19 (<= 0 ~st3~0)) (.cse20 (<= .cse1 0)) (.cse21 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse22 (= ~p3~0 0)) (.cse23 (<= 0 ~__return_1465~0)) (.cse24 (<= ~__return_1465~0 1)) (.cse25 (<= 0 ~send3~0)) (.cse26 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse27 (<= 0 |#StackHeapBarrier|)) (.cse28 (<= 0 ~send1~0)) (.cse29 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse30 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse31 (= |#NULL.base| 0))) (or (and .cse0 (<= 0 .cse1) .cse2 (= (* 256 (div ~mode2~0 256)) ~mode2~0) .cse3 (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= 0 |ULTIMATE.start_main_~main__i2~0#1|) (<= |#NULL.offset| 0) .cse4 .cse5 .cse6 (= (* 256 (div ~mode3~0 256)) ~mode3~0) .cse7 (<= ~p1~0 0) (<= ~__return_main~0 0) .cse8 .cse9 (= ~mode1~0 1) .cse10 .cse11 (<= |ULTIMATE.start_main_~main__i2~0#1| 0) (<= .cse12 0) .cse13 (<= 0 ~__return_main~0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= 0 |#NULL.offset|) .cse22 .cse23 .cse24 .cse25 .cse26 (<= 0 ~p1~0) .cse27 .cse28 .cse29 .cse30 .cse31) (let ((.cse32 (+ ~p1_new~0 1))) (and (= ~mode3~0 1) .cse0 (= ~mode2~0 1) (<= ~st3~0 0) .cse2 (<= .cse32 0) .cse3 (= ~p3_new~0 ~nomsg~0) (<= 0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~st1~0 1) .cse11 (<= ~st2~0 0) .cse13 (= ~mode1~0 0) (<= 0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) .cse14 .cse15 (= |#NULL.offset| 0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= 0 .cse32) .cse23 .cse24 .cse25 .cse26 (= ~p1~0 0) .cse27 .cse28 .cse29 (= ~__return_main~0 0) .cse30 .cse31 (= |ULTIMATE.start_main_~main__i2~0#1| 0)))))) [2022-12-14 13:00:44,991 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-12-14 13:00:44,991 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 381) no Hoare annotation was computed. [2022-12-14 13:00:44,991 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 58 469) the Hoare annotation is: true [2022-12-14 13:00:44,991 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-12-14 13:00:44,991 INFO L899 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-12-14 13:00:44,991 INFO L899 garLoopResultBuilder]: For program point L226-1(line 226) no Hoare annotation was computed. [2022-12-14 13:00:44,991 INFO L899 garLoopResultBuilder]: For program point L226-2(line 226) no Hoare annotation was computed. [2022-12-14 13:00:44,992 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-12-14 13:00:44,992 INFO L899 garLoopResultBuilder]: For program point L226-3(line 226) no Hoare annotation was computed. [2022-12-14 13:00:44,992 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 427) no Hoare annotation was computed. [2022-12-14 13:00:44,992 INFO L899 garLoopResultBuilder]: For program point L226-4(lines 226 234) no Hoare annotation was computed. [2022-12-14 13:00:44,992 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 467) no Hoare annotation was computed. [2022-12-14 13:00:44,992 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-12-14 13:00:44,992 INFO L895 garLoopResultBuilder]: At program point L161(lines 161 286) the Hoare annotation is: (let ((.cse31 (+ ~p3_new~0 1)) (.cse32 (+ ~nomsg~0 1))) (let ((.cse0 (<= 0 ~id3~0)) (.cse1 (<= 0 ~id1~0)) (.cse3 (<= |ULTIMATE.start_main_~main__c1~0#1| 1)) (.cse4 (<= 0 ~st1~0)) (.cse5 (<= ~__return_1389~0 1)) (.cse6 (<= 1 ~__return_1389~0)) (.cse7 (<= 0 ~st2~0)) (.cse8 (<= 0 ~p2~0)) (.cse9 (<= 0 ~send2~0)) (.cse10 (<= ~id1~0 127)) (.cse12 (<= ~id3~0 127)) (.cse13 (<= 0 ~id2~0)) (.cse14 (<= 0 .cse32)) (.cse15 (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~0#1|)) (.cse16 (<= ~p2~0 0)) (.cse17 (<= ~id2~0 127)) (.cse18 (<= 0 ~st3~0)) (.cse19 (<= .cse31 0)) (.cse20 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse21 (= ~p3~0 0)) (.cse22 (<= 0 ~__return_1465~0)) (.cse23 (<= ~__return_1465~0 1)) (.cse24 (<= 0 ~send3~0)) (.cse25 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse26 (<= 0 |#StackHeapBarrier|)) (.cse27 (<= 0 ~send1~0)) (.cse28 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse29 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse30 (= |#NULL.base| 0))) (or (let ((.cse11 (+ ~p2_new~0 1)) (.cse2 (+ ~p1_new~0 1))) (and (= ~mode3~0 1) .cse0 (<= ~st3~0 0) (<= ~st2~0 1) .cse1 (= (* 256 (div ~mode2~0 256)) ~mode2~0) (<= .cse2 0) .cse3 (= ~p3_new~0 ~nomsg~0) (<= 0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= ~mode2~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~st1~0 1) (<= 0 .cse11) (<= .cse11 0) (= ~mode1~0 0) (<= 0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) .cse12 .cse13 (= |#NULL.offset| 0) .cse14 .cse15 .cse16 (<= 0 ~mode2~0) .cse17 .cse18 .cse19 .cse20 .cse21 (<= 0 .cse2) .cse22 .cse23 .cse24 .cse25 (= ~p1~0 0) .cse26 .cse27 .cse28 (= ~__return_main~0 0) .cse29 .cse30 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (and .cse0 (<= 0 .cse31) (= ~mode2~0 1) .cse1 .cse3 (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= 0 |ULTIMATE.start_main_~main__i2~0#1|) (<= |#NULL.offset| 0) .cse4 .cse5 .cse6 (= (* 256 (div ~mode3~0 256)) ~mode3~0) .cse7 (<= ~p1~0 0) (<= ~__return_main~0 0) .cse8 .cse9 (= ~mode1~0 1) .cse10 (<= |ULTIMATE.start_main_~main__i2~0#1| 0) (<= .cse32 0) (<= 0 ~__return_main~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= 0 |#NULL.offset|) .cse21 .cse22 .cse23 .cse24 .cse25 (<= 0 ~p1~0) .cse26 .cse27 .cse28 .cse29 .cse30)))) [2022-12-14 13:00:44,993 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 330) no Hoare annotation was computed. [2022-12-14 13:00:44,993 INFO L895 garLoopResultBuilder]: At program point L277(lines 265 285) the Hoare annotation is: false [2022-12-14 13:00:44,993 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 13:00:44,993 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 380) no Hoare annotation was computed. [2022-12-14 13:00:44,993 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 422) no Hoare annotation was computed. [2022-12-14 13:00:44,993 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-12-14 13:00:44,993 INFO L899 garLoopResultBuilder]: For program point L212-1(line 212) no Hoare annotation was computed. [2022-12-14 13:00:44,993 INFO L895 garLoopResultBuilder]: At program point L146(lines 146 331) the Hoare annotation is: (let ((.cse1 (+ ~p3_new~0 1)) (.cse13 (+ ~nomsg~0 1)) (.cse34 (+ ~p2_new~0 1))) (let ((.cse0 (<= 0 ~id3~0)) (.cse2 (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~0#1|)) (.cse3 (<= 0 ~id1~0)) (.cse4 (<= |ULTIMATE.start_main_~main__c1~0#1| 1)) (.cse5 (<= 0 ~st1~0)) (.cse6 (<= ~__return_1389~0 1)) (.cse7 (<= 1 ~__return_1389~0)) (.cse8 (<= 0 ~st2~0)) (.cse9 (<= 0 ~p2~0)) (.cse10 (<= 0 ~send2~0)) (.cse11 (<= ~id1~0 127)) (.cse12 (<= 0 .cse34)) (.cse14 (<= .cse34 0)) (.cse15 (<= ~id3~0 127)) (.cse16 (<= 0 ~id2~0)) (.cse17 (<= 0 .cse13)) (.cse18 (<= ~p2~0 0)) (.cse19 (<= ~id2~0 127)) (.cse20 (<= 0 ~st3~0)) (.cse21 (<= .cse1 0)) (.cse22 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse23 (= ~p3~0 0)) (.cse24 (<= 0 ~__return_1465~0)) (.cse25 (<= ~__return_1465~0 1)) (.cse26 (<= 0 ~send3~0)) (.cse27 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse28 (<= 0 |#StackHeapBarrier|)) (.cse29 (<= 0 ~send1~0)) (.cse30 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse31 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse32 (= |#NULL.base| 0))) (or (and .cse0 (<= 0 .cse1) .cse2 .cse3 (= (* 256 (div ~mode2~0 256)) ~mode2~0) .cse4 (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= 0 |ULTIMATE.start_main_~main__i2~0#1|) (<= |#NULL.offset| 0) .cse5 .cse6 .cse7 (= (* 256 (div ~mode3~0 256)) ~mode3~0) .cse8 (<= ~p1~0 0) (<= ~__return_main~0 0) .cse9 .cse10 (= ~mode1~0 1) .cse11 .cse12 (<= |ULTIMATE.start_main_~main__i2~0#1| 0) (<= .cse13 0) .cse14 (<= 0 ~__return_main~0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= 0 |#NULL.offset|) .cse23 .cse24 .cse25 .cse26 .cse27 (<= 0 ~p1~0) .cse28 .cse29 .cse30 .cse31 .cse32) (let ((.cse33 (+ ~p1_new~0 1))) (and (= ~mode3~0 1) .cse0 (= ~mode2~0 1) (<= ~st3~0 0) .cse2 .cse3 (<= .cse33 0) .cse4 (= ~p3_new~0 ~nomsg~0) (<= 0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~st1~0 1) .cse12 (<= ~st2~0 0) .cse14 (= ~mode1~0 0) (<= 0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) .cse15 .cse16 (= |#NULL.offset| 0) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= 0 .cse33) .cse24 .cse25 .cse26 .cse27 (= ~p1~0 0) .cse28 .cse29 .cse30 (= ~__return_main~0 0) .cse31 .cse32 (= |ULTIMATE.start_main_~main__i2~0#1| 0)))))) [2022-12-14 13:00:44,994 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2022-12-14 13:00:44,994 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 387) no Hoare annotation was computed. [2022-12-14 13:00:44,994 INFO L899 garLoopResultBuilder]: For program point L212-3(line 212) no Hoare annotation was computed. [2022-12-14 13:00:44,994 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 462) no Hoare annotation was computed. [2022-12-14 13:00:44,994 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-12-14 13:00:44,994 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 325) no Hoare annotation was computed. [2022-12-14 13:00:44,994 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-12-14 13:00:44,994 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 375) no Hoare annotation was computed. [2022-12-14 13:00:44,995 INFO L895 garLoopResultBuilder]: At program point L131(lines 128 355) the Hoare annotation is: (let ((.cse1 (+ ~p2_new~0 1)) (.cse0 (+ ~p1_new~0 1))) (and (= ~mode3~0 1) (<= 0 ~id3~0) (= ~mode2~0 1) (<= ~st3~0 0) (<= 0 ~id1~0) (<= .cse0 0) (= |ULTIMATE.start_main_~check__tmp~0#1| 1) (<= ~st1~0 0) (<= (+ 256 (* (div (+ (- 3) ~r1~0) 256) 256)) ~r1~0) (= ~p3_new~0 ~nomsg~0) (<= 0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= 0 ~st1~0) (<= ~__return_1389~0 1) (<= 1 ~__return_1389~0) (<= 0 ~st2~0) (<= 0 ~p2~0) (<= 0 ~send2~0) (= ~mode1~0 1) (<= ~id1~0 127) (<= 0 .cse1) (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) (<= ~st2~0 0) (<= .cse1 0) (<= 0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= ~p2~0 0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= (+ ~p3_new~0 1) 0) (<= |ULTIMATE.start_main_~init__tmp~0#1| 1) (= ~p3~0 0) (<= 0 .cse0) (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1465~0) (<= ~__return_1465~0 1) (<= 1 |ULTIMATE.start_main_~main__c1~0#1|) (<= 0 ~send3~0) (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~0#1|) (= ~__return_main~0 0) (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|) (= |#NULL.base| 0) (= |ULTIMATE.start_main_~main__i2~0#1| 0))) [2022-12-14 13:00:44,995 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 417) no Hoare annotation was computed. [2022-12-14 13:00:44,995 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-12-14 13:00:44,995 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2022-12-14 13:00:44,995 INFO L899 garLoopResultBuilder]: For program point L181-1(line 181) no Hoare annotation was computed. [2022-12-14 13:00:44,995 INFO L899 garLoopResultBuilder]: For program point L181-2(line 181) no Hoare annotation was computed. [2022-12-14 13:00:44,995 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 457) no Hoare annotation was computed. [2022-12-14 13:00:44,995 INFO L899 garLoopResultBuilder]: For program point L181-3(line 181) no Hoare annotation was computed. [2022-12-14 13:00:44,995 INFO L899 garLoopResultBuilder]: For program point L181-4(lines 181 241) no Hoare annotation was computed. [2022-12-14 13:00:44,996 INFO L895 garLoopResultBuilder]: At program point L132(line 132) the Hoare annotation is: (let ((.cse1 (+ ~p2_new~0 1)) (.cse0 (+ ~p1_new~0 1))) (and (= ~mode3~0 1) (<= 0 ~id3~0) (= ~mode2~0 1) (<= ~st3~0 0) (<= 0 ~id1~0) (<= .cse0 0) (= |ULTIMATE.start_main_~check__tmp~0#1| 1) (<= ~st1~0 0) (<= (+ 256 (* (div (+ (- 3) ~r1~0) 256) 256)) ~r1~0) (= ~p3_new~0 ~nomsg~0) (<= 0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= 0 ~st1~0) (<= ~__return_1389~0 1) (<= 1 ~__return_1389~0) (<= 0 ~st2~0) (<= 0 ~p2~0) (<= 0 ~send2~0) (= ~mode1~0 1) (<= ~id1~0 127) (<= 0 .cse1) (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) (<= ~st2~0 0) (<= .cse1 0) (<= 0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= ~p2~0 0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= (+ ~p3_new~0 1) 0) (<= |ULTIMATE.start_main_~init__tmp~0#1| 1) (= ~p3~0 0) (<= 0 .cse0) (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1465~0) (<= ~__return_1465~0 1) (<= 1 |ULTIMATE.start_main_~main__c1~0#1|) (<= 0 ~send3~0) (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~0#1|) (= ~__return_main~0 0) (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|) (= |#NULL.base| 0) (= |ULTIMATE.start_main_~main__i2~0#1| 0))) [2022-12-14 13:00:44,996 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-12-14 13:00:44,996 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 285) no Hoare annotation was computed. [2022-12-14 13:00:44,996 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-12-14 13:00:44,996 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 412) no Hoare annotation was computed. [2022-12-14 13:00:44,996 INFO L895 garLoopResultBuilder]: At program point L315(lines 312 325) the Hoare annotation is: (let ((.cse1 (+ ~p2_new~0 1)) (.cse2 (+ ~nomsg~0 1)) (.cse0 (+ ~p3_new~0 1)) (.cse3 (+ |ULTIMATE.start_main_~node2__m2~0#1| 1))) (and (<= 0 ~id3~0) (<= 0 .cse0) (<= 0 ~id1~0) (= (mod ~mode2~0 256) 0) (<= |ULTIMATE.start_main_~main__c1~0#1| 1) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~send2~0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) (<= 0 ~st1~0) (<= ~__return_1389~0 1) (<= 1 ~__return_1389~0) (= (* 256 (div ~mode3~0 256)) ~mode3~0) (<= 0 ~st2~0) (<= 0 ~p2~0) (<= 0 ~send2~0) (= ~mode1~0 1) (<= ~id1~0 127) (<= 0 .cse1) (<= .cse2 0) (<= .cse1 0) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 .cse2) (<= ~p2~0 0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= .cse0 0) (<= |ULTIMATE.start_main_~init__tmp~0#1| 1) (<= 0 .cse3) (= ~p3~0 0) (<= 0 ~__return_1465~0) (<= ~__return_1465~0 1) (<= 0 ~send3~0) (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= 0 |ULTIMATE.start_main_~main__c1~0#1|) (<= .cse3 0) (= ~__return_main~0 0) (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|) (= |#NULL.base| 0) (= |ULTIMATE.start_main_~main__i2~0#1| 0))) [2022-12-14 13:00:44,997 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 235) no Hoare annotation was computed. [2022-12-14 13:00:44,997 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 452) no Hoare annotation was computed. [2022-12-14 13:00:44,998 INFO L895 garLoopResultBuilder]: At program point L365(lines 362 375) the Hoare annotation is: (let ((.cse6 (+ ~nomsg~0 1))) (and (= (* 256 (div ~mode2~0 256)) ~mode2~0) (let ((.cse0 (<= 0 ~id3~0)) (.cse1 (<= 0 ~id1~0)) (.cse2 (= ~p2~0 0)) (.cse12 (mod ~r1~0 256)) (.cse4 (<= ~id1~0 127)) (.cse5 (= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse7 (<= ~id3~0 127)) (.cse8 (= |#NULL.offset| 0)) (.cse10 (<= ~id2~0 127)) (.cse11 (= ~p3~0 0)) (.cse3 (= |ULTIMATE.start_main_~main__c1~0#1| 0)) (.cse13 (= ~p1~0 0)) (.cse14 (= ~__return_main~0 0)) (.cse15 (= |#NULL.base| 0)) (.cse16 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (let ((.cse9 (select |#memory_int| 1))) (and (= 48 (select |#length| 2)) .cse0 (= (select |#length| 3) 12) (= ~nomsg~0 ~p1_new~0) .cse1 .cse2 (= ~__return_1465~0 0) (= (select ~nodes~0.base 0) |#funAddr~node1.base|) (= 2 (select |#length| 1)) (= ~send3~0 ~id3~0) (= ~p3_new~0 ~nomsg~0) (= |#funAddr~node3.base| (select ~nodes~0.base 2)) (= (select |#valid| 3) 1) (= ~st3~0 0) (= |ULTIMATE.start_main_~init__tmp~0#1| ~__return_1389~0) (= ~nomsg~0 ~p2_old~0) (not (= ~id3~0 ~id2~0)) (= |#funAddr~node2.base| (select ~nodes~0.base 1)) (not (= ~id1~0 ~id3~0)) .cse3 .cse4 (= ~nomsg~0 ~p2_new~0) (= ~st1~0 0) (not (= ~id1~0 ~id2~0)) (= ~nomsg~0 ~p1_old~0) .cse5 (= (select ~nodes~0.offset 0) |#funAddr~node1.offset|) (= (select |#valid| 1) 1) (= .cse6 0) (= ~send1~0 ~id1~0) (= (select |#valid| 0) 0) .cse7 (= (select |#valid| 2) 1) .cse8 (= ~st2~0 0) (= ~p3_old~0 ~nomsg~0) (= (select .cse9 0) 48) (= (select ~nodes~0.offset 2) |#funAddr~node3.offset|) .cse10 .cse11 (= (select .cse9 1) 0) (= .cse12 0) .cse13 (= |#funAddr~node2.offset| (select ~nodes~0.offset 1)) .cse14 (< 0 |#StackHeapBarrier|) (= ~send2~0 ~id2~0) .cse15 .cse16)) (let ((.cse19 (+ ~p2_new~0 1)) (.cse17 (+ ~p3_new~0 1)) (.cse18 (+ ~p1_new~0 1))) (and .cse0 (<= 0 .cse17) .cse1 (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1465~0) .cse2 (<= .cse18 0) (< .cse12 3) (= |ULTIMATE.start_main_~check__tmp~0#1| 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= 0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= ~mode2~0 1) (<= 0 ~st1~0) (<= ~__return_1389~0 1) (<= 1 ~__return_1389~0) (<= 0 ~st2~0) (<= ~mode3~0 1) (<= 0 ~send2~0) .cse4 .cse5 (<= 0 .cse19) (<= ~mode1~0 1) (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) (<= .cse19 0) (<= 0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) .cse7 .cse8 (<= 0 .cse6) .cse10 (<= 0 ~st3~0) (<= .cse17 0) .cse11 (<= 0 .cse18) (= (ite .cse3 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1465~0) (<= 0 ~send3~0) .cse13 (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) .cse14 .cse15 .cse16)))) (= ~send1~0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (= (mod ~mode1~0 256) 0) (= (* 256 (div ~mode3~0 256)) ~mode3~0) (<= .cse6 ~id2~0) (<= .cse6 0) (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~0#1|))) [2022-12-14 13:00:45,001 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:00:45,003 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 13:00:45,014 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,015 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-12-14 13:00:45,015 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-12-14 13:00:45,015 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,016 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-12-14 13:00:45,016 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,016 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,016 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-12-14 13:00:45,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-12-14 13:00:45,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-12-14 13:00:45,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,026 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,027 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-12-14 13:00:45,027 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-12-14 13:00:45,027 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,028 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-12-14 13:00:45,028 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,028 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,028 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-12-14 13:00:45,028 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,029 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-12-14 13:00:45,029 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-12-14 13:00:45,029 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,056 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,056 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-12-14 13:00:45,056 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-12-14 13:00:45,056 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,057 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-12-14 13:00:45,057 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,057 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,057 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-12-14 13:00:45,057 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-12-14 13:00:45,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-12-14 13:00:45,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,060 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,060 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-12-14 13:00:45,060 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-12-14 13:00:45,060 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-12-14 13:00:45,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-12-14 13:00:45,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,062 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-12-14 13:00:45,062 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-12-14 13:00:45,062 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:00:45 BoogieIcfgContainer [2022-12-14 13:00:45,064 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 13:00:45,064 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 13:00:45,064 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 13:00:45,065 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 13:00:45,065 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:00:05" (3/4) ... [2022-12-14 13:00:45,067 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 13:00:45,080 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-12-14 13:00:45,080 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-14 13:00:45,081 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-14 13:00:45,082 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 13:00:45,101 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && 0 <= id1) && check__tmp == __return_1465) && p1_new + 1 <= 0) && r1 % 256 < 3) && check__tmp == 1) && p3_new == nomsg) && st3 + st2 + st1 == 0) && 0 <= node3____CPAchecker_TMP_0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= mode1) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && check__tmp == __return_1465) && p1_new + 1 <= 0) && r1 % 256 < 3) && 0 <= mode3) && check__tmp == 1) && 256 * (mode1 / 256) == mode1) && p3_new == nomsg) && st3 + st2 + st1 == 0) && 0 <= node3____CPAchecker_TMP_0) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && mode1 <= 1) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((256 * (mode2 / 256) == mode2 && 256 * (mode1 / 256) == mode1) && (((((((((((((((((((((((((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && 0 <= id3) && unknown-#length-unknown[3] == 12) && nomsg == p1_new) && 0 <= id1) && p2 == 0) && __return_1465 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && st3 == 0) && init__tmp == __return_1389) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && id1 <= 127) && nomsg == p2_new) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && init__tmp == 1) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && nomsg + 1 == 0) && send1 == id1) && \valid[0] == 0) && id3 <= 127) && \valid[2] == 1) && 0 <= id2) && #NULL == 0) && st2 == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && id2 <= 127) && p3 == 0) && unknown-#memory_int-unknown[1][1] == 0) && p1 == 0) && #funAddr~node2.offset == nodes[1]) && __return_main == 0) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && check__tmp == __return_1465) && p2 == 0) && p1_new + 1 <= 0) && check__tmp == 1) && st3 + st2 + st1 == 0) && 0 <= node3____CPAchecker_TMP_0) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && mode1 <= 1) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && __return_main == 0) && #NULL == 0) && main__i2 == 0))) && 256 * (mode3 / 256) == mode3) && r1 <= r1 / 256 * 256) [2022-12-14 13:00:45,101 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((256 * (mode2 / 256) == mode2 && (((((((((((((((((((((((((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && 0 <= id3) && unknown-#length-unknown[3] == 12) && nomsg == p1_new) && 0 <= id1) && p2 == 0) && __return_1465 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && st3 == 0) && init__tmp == __return_1389) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && id1 <= 127) && nomsg == p2_new) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && init__tmp == 1) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && nomsg + 1 == 0) && send1 == id1) && \valid[0] == 0) && id3 <= 127) && \valid[2] == 1) && #NULL == 0) && st2 == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && id2 <= 127) && p3 == 0) && unknown-#memory_int-unknown[1][1] == 0) && r1 % 256 == 0) && p1 == 0) && #funAddr~node2.offset == nodes[1]) && __return_main == 0) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && check__tmp == __return_1465) && p2 == 0) && p1_new + 1 <= 0) && r1 % 256 < 3) && check__tmp == 1) && st3 + st2 + st1 == 0) && 0 <= node3____CPAchecker_TMP_0) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && mode1 <= 1) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && __return_main == 0) && #NULL == 0) && main__i2 == 0))) && send1 == node1____CPAchecker_TMP_0) && mode1 % 256 == 0) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && nomsg == node1__m1 [2022-12-14 13:00:45,120 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 13:00:45,120 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 13:00:45,120 INFO L158 Benchmark]: Toolchain (without parser) took 40200.49ms. Allocated memory was 127.9MB in the beginning and 331.4MB in the end (delta: 203.4MB). Free memory was 88.4MB in the beginning and 142.8MB in the end (delta: -54.4MB). Peak memory consumption was 150.5MB. Max. memory is 16.1GB. [2022-12-14 13:00:45,120 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 127.9MB. Free memory is still 99.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 13:00:45,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.13ms. Allocated memory is still 127.9MB. Free memory was 88.4MB in the beginning and 74.2MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-14 13:00:45,121 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.42ms. Allocated memory is still 127.9MB. Free memory was 74.2MB in the beginning and 72.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 13:00:45,121 INFO L158 Benchmark]: Boogie Preprocessor took 18.27ms. Allocated memory is still 127.9MB. Free memory was 72.1MB in the beginning and 70.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 13:00:45,121 INFO L158 Benchmark]: RCFGBuilder took 492.49ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 70.7MB in the beginning and 120.9MB in the end (delta: -50.2MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2022-12-14 13:00:45,121 INFO L158 Benchmark]: TraceAbstraction took 39343.01ms. Allocated memory was 155.2MB in the beginning and 331.4MB in the end (delta: 176.2MB). Free memory was 120.1MB in the beginning and 148.0MB in the end (delta: -27.9MB). Peak memory consumption was 198.4MB. Max. memory is 16.1GB. [2022-12-14 13:00:45,121 INFO L158 Benchmark]: Witness Printer took 55.45ms. Allocated memory is still 331.4MB. Free memory was 148.0MB in the beginning and 142.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-14 13:00:45,122 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.17ms. Allocated memory is still 127.9MB. Free memory is still 99.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.13ms. Allocated memory is still 127.9MB. Free memory was 88.4MB in the beginning and 74.2MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.42ms. Allocated memory is still 127.9MB. Free memory was 74.2MB in the beginning and 72.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.27ms. Allocated memory is still 127.9MB. Free memory was 72.1MB in the beginning and 70.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 492.49ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 70.7MB in the beginning and 120.9MB in the end (delta: -50.2MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * TraceAbstraction took 39343.01ms. Allocated memory was 155.2MB in the beginning and 331.4MB in the end (delta: 176.2MB). Free memory was 120.1MB in the beginning and 148.0MB in the end (delta: -27.9MB). Peak memory consumption was 198.4MB. Max. memory is 16.1GB. * Witness Printer took 55.45ms. Allocated memory is still 331.4MB. Free memory was 148.0MB in the beginning and 142.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: 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, 73 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 39.2s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1935 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1935 mSDsluCounter, 2932 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1422 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2419 IncrementalHoareTripleChecker+Invalid, 2531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 1510 mSDtfsCounter, 2419 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 242 SyntacticMatches, 9 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2476 ImplicationChecksByTransitivity, 18.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1206occurred in iteration=13, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 498 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 45 NumberOfFragments, 4102 HoareAnnotationTreeSize, 17 FomulaSimplifications, 13266 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 17 FomulaSimplificationsInter, 9376 FormulaSimplificationTreeSizeReductionInter, 7.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1458 NumberOfCodeBlocks, 1458 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1491 ConstructedInterpolants, 0 QuantifiedInterpolants, 6598 SizeOfPredicates, 18 NumberOfNonLiveVariables, 637 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 467/550 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 4.7s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 69, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 179, TOOLS_POST_TIME: 3.9s, 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: 178, TOOLS_QUANTIFIERELIM_TIME: 3.8s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 238, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 23, DOMAIN_JOIN_TIME: 0.5s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 69, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 2.6s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 2.6s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 9977, DAG_COMPRESSION_RETAINED_NODES: 167, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 362]: Loop Invariant [2022-12-14 13:00:45,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-12-14 13:00:45,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-12-14 13:00:45,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-12-14 13:00:45,128 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,128 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,128 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-12-14 13:00:45,128 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,128 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-12-14 13:00:45,128 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-12-14 13:00:45,128 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,129 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,129 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-12-14 13:00:45,129 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-12-14 13:00:45,129 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,129 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-12-14 13:00:45,130 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,130 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,130 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-12-14 13:00:45,130 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,130 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-12-14 13:00:45,130 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-12-14 13:00:45,130 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset Derived loop invariant: ((((((256 * (mode2 / 256) == mode2 && (((((((((((((((((((((((((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && 0 <= id3) && unknown-#length-unknown[3] == 12) && nomsg == p1_new) && 0 <= id1) && p2 == 0) && __return_1465 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && st3 == 0) && init__tmp == __return_1389) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && id1 <= 127) && nomsg == p2_new) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && init__tmp == 1) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && nomsg + 1 == 0) && send1 == id1) && \valid[0] == 0) && id3 <= 127) && \valid[2] == 1) && #NULL == 0) && st2 == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && id2 <= 127) && p3 == 0) && unknown-#memory_int-unknown[1][1] == 0) && r1 % 256 == 0) && p1 == 0) && #funAddr~node2.offset == nodes[1]) && __return_main == 0) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && check__tmp == __return_1465) && p2 == 0) && p1_new + 1 <= 0) && r1 % 256 < 3) && check__tmp == 1) && st3 + st2 + st1 == 0) && 0 <= node3____CPAchecker_TMP_0) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && mode1 <= 1) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && __return_main == 0) && #NULL == 0) && main__i2 == 0))) && send1 == node1____CPAchecker_TMP_0) && mode1 % 256 == 0) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && nomsg == node1__m1 - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && nomsg == node2__m2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && main__c1 <= 1) && st3 + st2 + st1 <= 0) && 0 <= main__i2) && #NULL <= 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && main__i2 <= 0) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= #NULL) && p3 == 0) && 0 <= __return_1465) && __return_1465 <= 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && 1 <= init__tmp) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && st3 <= 0) && nomsg == node2__m2) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 <= 1) && p3_new == nomsg) && 0 <= node3____CPAchecker_TMP_0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && st2 <= 0) && p2_new + 1 <= 0) && mode1 == 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= __return_1465) && __return_1465 <= 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && main__c1 <= 1) && r1 % 256 < 3) && 0 <= mode3) && check__tmp == 1) && p3_new == nomsg) && st3 + st2 + st1 == 0) && 0 <= node3____CPAchecker_TMP_0) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && mode1 == 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= __return_1465) && __return_1465 <= 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && check__tmp == 0) && st2 + st1 <= 2147483647) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) && !(2147483649 + st3 + st2 + st1 <= 0)) && !(2147483649 + st2 + st1 <= 0)) && st3 + st2 + st1 <= 2147483647)) || ((((((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 <= 1) && r1 % 256 < 3) && check__tmp == 1) && p3_new == nomsg) && st3 + st2 + st1 == 0) && 0 <= node3____CPAchecker_TMP_0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= __return_1465) && __return_1465 <= 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && st3 <= 0) && st2 <= 1) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && main__c1 <= 1) && p3_new == nomsg) && 0 <= node3____CPAchecker_TMP_0) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && mode1 == 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= __return_1465) && __return_1465 <= 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && mode2 == 1) && 0 <= id1) && main__c1 <= 1) && st3 + st2 + st1 <= 0) && 0 <= main__i2) && #NULL <= 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && main__i2 <= 0) && nomsg + 1 <= 0) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= #NULL) && p3 == 0) && 0 <= __return_1465) && __return_1465 <= 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && 1 <= init__tmp) && #NULL == 0) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && st2 <= 1) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p2 == 0) && p1_new + 1 <= 0) && main__c1 <= 1) && 0 <= mode3) && p3_new == nomsg) && 0 <= node3____CPAchecker_TMP_0) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && st1 <= 1) && init__tmp == 1) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && mode1 == 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && 0 <= __return_1465) && __return_1465 <= 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && 0 <= id1) && p2 == 0) && main__c1 <= 1) && st3 + st2 + st1 <= 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && init__tmp == 1) && nomsg + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3 == 0) && 0 <= __return_1465) && __return_1465 <= 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((0 <= id3 && mode2 == 1) && 0 <= id1) && main__c1 <= 1) && p3_new == nomsg) && st3 + st2 + st1 <= 0) && 0 <= main__i2) && #NULL <= 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && main__i2 <= 0) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && 0 <= nomsg + 1) && nomsg == node3__m3) && p2 <= 0) && node3____CPAchecker_TMP_0 == send3) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= #NULL) && p3 == 0) && 0 <= __return_1465) && __return_1465 <= 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && 1 <= init__tmp) && #NULL == 0 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && st3 <= 0) && 0 <= id1) && p1_new + 1 <= 0) && check__tmp == 1) && st1 <= 0) && 256 + (-3 + r1) / 256 * 256 <= r1) && p3_new == nomsg) && 0 <= node3____CPAchecker_TMP_0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && assert__arg == __tmp_1) && st2 <= 0) && p2_new + 1 <= 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && __return_1465 <= 1) && 1 <= main__c1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && nomsg == node1__m1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && st3 <= 0) && 0 <= id1) && p1_new + 1 <= 0) && check__tmp == 1) && st1 <= 0) && 256 + (-3 + r1) / 256 * 256 <= r1) && p3_new == nomsg) && 0 <= node3____CPAchecker_TMP_0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && assert__arg == __tmp_1) && st2 <= 0) && p2_new + 1 <= 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && __return_1465 <= 1) && 1 <= main__c1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && nomsg == node1__m1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0 - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && mode2 % 256 == 0) && main__c1 <= 1) && st3 + st2 + st1 <= 0) && send2 == node2____CPAchecker_TMP_0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && p3 == 0) && 0 <= __return_1465) && __return_1465 <= 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && node2__m2 + 1 <= 0) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0 - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && st3 <= 0) && st2 <= 1) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && main__c1 <= 1) && p3_new == nomsg) && 0 <= node3____CPAchecker_TMP_0) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && mode1 == 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= __return_1465) && __return_1465 <= 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && mode2 == 1) && 0 <= id1) && main__c1 <= 1) && st3 + st2 + st1 <= 0) && 0 <= main__i2) && #NULL <= 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && main__i2 <= 0) && nomsg + 1 <= 0) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && 0 <= nomsg + 1) && nomsg == node3__m3) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= #NULL) && p3 == 0) && 0 <= __return_1465) && __return_1465 <= 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && 1 <= init__tmp) && #NULL == 0) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && main__c1 <= 1) && st3 + st2 + st1 <= 0) && 0 <= main__i2) && #NULL <= 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && main__i2 <= 0) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= #NULL) && p3 == 0) && 0 <= __return_1465) && __return_1465 <= 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && 1 <= init__tmp) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && st3 <= 0) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 <= 1) && p3_new == nomsg) && 0 <= node3____CPAchecker_TMP_0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && st2 <= 0) && p2_new + 1 <= 0) && mode1 == 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= __return_1465) && __return_1465 <= 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 <= 1) && p3_new == nomsg) && st3 + st2 + st1 == 0) && 0 <= node3____CPAchecker_TMP_0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= __return_1465) && __return_1465 <= 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && main__c1 <= 1) && 0 <= mode3) && p3_new == nomsg) && st3 + st2 + st1 == 0) && 0 <= node3____CPAchecker_TMP_0) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && mode1 == 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= __return_1465) && __return_1465 <= 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((nomsg + 1 <= id3 && !(r1 <= r1 / 256 * 256 + 2)) && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && st2 + st1 <= 2147483647) && 0 <= st1) && mode1 == 1) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && !(2147483649 + st2 + st1 <= 0)) && st3 + st2 + st1 <= 2147483647) || ((((((((((((nomsg + 1 <= id3 && !(r1 <= r1 / 256 * 256 + 2)) && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && 256 * (mode1 / 256) == mode1) && st2 + st1 <= 2147483647) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && !(2147483649 + st2 + st1 <= 0)) && st3 + st2 + st1 <= 2147483647)) && !(2147483649 + st3 + st2 + st1 <= 0)) - InvariantResult [Line: 114]: Loop Invariant [2022-12-14 13:00:45,140 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,140 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-12-14 13:00:45,140 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-12-14 13:00:45,140 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,140 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-12-14 13:00:45,141 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,141 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,141 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-12-14 13:00:45,141 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,141 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-12-14 13:00:45,141 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-12-14 13:00:45,141 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,142 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,142 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-12-14 13:00:45,142 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-12-14 13:00:45,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-12-14 13:00:45,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-12-14 13:00:45,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-12-14 13:00:45,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-12-14 13:00:45,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-12-14 13:00:45,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-12-14 13:00:45,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && 0 <= id1) && check__tmp == __return_1465) && p1_new + 1 <= 0) && r1 % 256 < 3) && check__tmp == 1) && p3_new == nomsg) && st3 + st2 + st1 == 0) && 0 <= node3____CPAchecker_TMP_0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= mode1) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && check__tmp == __return_1465) && p1_new + 1 <= 0) && r1 % 256 < 3) && 0 <= mode3) && check__tmp == 1) && 256 * (mode1 / 256) == mode1) && p3_new == nomsg) && st3 + st2 + st1 == 0) && 0 <= node3____CPAchecker_TMP_0) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && mode1 <= 1) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((256 * (mode2 / 256) == mode2 && 256 * (mode1 / 256) == mode1) && (((((((((((((((((((((((((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && 0 <= id3) && unknown-#length-unknown[3] == 12) && nomsg == p1_new) && 0 <= id1) && p2 == 0) && __return_1465 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && st3 == 0) && init__tmp == __return_1389) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && id1 <= 127) && nomsg == p2_new) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && init__tmp == 1) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && nomsg + 1 == 0) && send1 == id1) && \valid[0] == 0) && id3 <= 127) && \valid[2] == 1) && 0 <= id2) && #NULL == 0) && st2 == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && id2 <= 127) && p3 == 0) && unknown-#memory_int-unknown[1][1] == 0) && p1 == 0) && #funAddr~node2.offset == nodes[1]) && __return_main == 0) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && check__tmp == __return_1465) && p2 == 0) && p1_new + 1 <= 0) && check__tmp == 1) && st3 + st2 + st1 == 0) && 0 <= node3____CPAchecker_TMP_0) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && mode1 <= 1) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && 0 <= node2____CPAchecker_TMP_0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && __return_main == 0) && #NULL == 0) && main__i2 == 0))) && 256 * (mode3 / 256) == mode3) && r1 <= r1 / 256 * 256) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-12-14 13:00:45,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad91eae-c115-4b45-b9c6-adcc3002cfcf/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE