./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 23:35:07,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:35:07,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:35:07,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:35:07,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:35:07,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:35:07,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:35:07,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:35:07,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:35:07,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:35:07,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:35:07,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:35:07,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:35:07,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:35:07,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:35:07,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:35:07,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:35:07,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:35:07,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:35:07,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:35:07,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:35:07,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:35:07,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:35:07,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:35:07,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:35:07,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:35:07,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:35:07,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:35:07,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:35:07,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:35:07,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:35:07,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:35:07,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:35:07,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:35:07,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:35:07,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:35:07,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:35:07,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:35:07,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:35:07,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:35:07,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:35:07,979 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-25 23:35:08,018 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:35:08,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:35:08,019 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:35:08,019 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:35:08,020 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:35:08,021 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:35:08,021 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:35:08,021 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:35:08,021 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:35:08,021 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:35:08,022 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:35:08,023 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:35:08,023 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:35:08,023 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:35:08,023 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:35:08,024 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:35:08,024 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:35:08,024 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:35:08,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:35:08,025 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:35:08,025 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:35:08,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:35:08,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:35:08,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:35:08,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:35:08,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:35:08,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:35:08,027 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 23:35:08,027 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:35:08,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:35:08,027 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:35:08,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:35:08,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:35:08,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:35:08,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:35:08,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:35:08,029 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:35:08,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:35:08,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:35:08,030 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:35:08,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:35:08,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:35:08,030 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:35:08,031 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_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c [2022-11-25 23:35:08,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:35:08,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:35:08,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:35:08,325 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:35:08,325 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:35:08,326 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-11-25 23:35:11,253 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:35:11,467 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:35:11,467 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-11-25 23:35:11,482 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/data/e95308be2/00a6fa7cbbf245e482f0597b987039df/FLAG36b183c1c [2022-11-25 23:35:11,498 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/data/e95308be2/00a6fa7cbbf245e482f0597b987039df [2022-11-25 23:35:11,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:35:11,502 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:35:11,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:35:11,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:35:11,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:35:11,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:35:11" (1/1) ... [2022-11-25 23:35:11,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411e5acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:11, skipping insertion in model container [2022-11-25 23:35:11,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:35:11" (1/1) ... [2022-11-25 23:35:11,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:35:11,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:35:11,737 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_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2022-11-25 23:35:11,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:35:11,765 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:35:11,796 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_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2022-11-25 23:35:11,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:35:11,824 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:35:11,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:11 WrapperNode [2022-11-25 23:35:11,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:35:11,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:35:11,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:35:11,826 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:35:11,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:11" (1/1) ... [2022-11-25 23:35:11,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:11" (1/1) ... [2022-11-25 23:35:11,871 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 281 [2022-11-25 23:35:11,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:35:11,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:35:11,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:35:11,872 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:35:11,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:11" (1/1) ... [2022-11-25 23:35:11,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:11" (1/1) ... [2022-11-25 23:35:11,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:11" (1/1) ... [2022-11-25 23:35:11,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:11" (1/1) ... [2022-11-25 23:35:11,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:11" (1/1) ... [2022-11-25 23:35:11,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:11" (1/1) ... [2022-11-25 23:35:11,893 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:11" (1/1) ... [2022-11-25 23:35:11,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:11" (1/1) ... [2022-11-25 23:35:11,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:35:11,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:35:11,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:35:11,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:35:11,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:11" (1/1) ... [2022-11-25 23:35:11,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:35:11,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:11,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:35:11,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:35:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:35:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:35:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:35:11,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:35:12,093 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:35:12,096 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:35:12,588 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:35:12,726 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:35:12,726 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 23:35:12,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:35:12 BoogieIcfgContainer [2022-11-25 23:35:12,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:35:12,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:35:12,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:35:12,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:35:12,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:35:11" (1/3) ... [2022-11-25 23:35:12,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbee1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:35:12, skipping insertion in model container [2022-11-25 23:35:12,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:11" (2/3) ... [2022-11-25 23:35:12,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbee1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:35:12, skipping insertion in model container [2022-11-25 23:35:12,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:35:12" (3/3) ... [2022-11-25 23:35:12,743 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-11-25 23:35:12,764 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:35:12,764 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-25 23:35:12,834 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:35:12,844 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;@28e876bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:35:12,844 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-25 23:35:12,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 72 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-11-25 23:35:12,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:35:12,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:12,855 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-11-25 23:35:12,856 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-11-25 23:35:12,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:12,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1190146159, now seen corresponding path program 1 times [2022-11-25 23:35:12,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:12,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286883173] [2022-11-25 23:35:12,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:12,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:13,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:13,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286883173] [2022-11-25 23:35:13,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286883173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:13,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:13,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:35:13,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247656550] [2022-11-25 23:35:13,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:13,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 23:35:13,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:13,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 23:35:13,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:35:13,160 INFO L87 Difference]: Start difference. First operand has 73 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 72 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-11-25 23:35:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:13,202 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2022-11-25 23:35:13,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:35:13,205 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-11-25 23:35:13,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:13,215 INFO L225 Difference]: With dead ends: 75 [2022-11-25 23:35:13,215 INFO L226 Difference]: Without dead ends: 69 [2022-11-25 23:35:13,218 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-11-25 23:35:13,221 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-11-25 23:35:13,222 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-11-25 23:35:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-25 23:35:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-25 23:35:13,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 68 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-11-25 23:35:13,261 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 21 [2022-11-25 23:35:13,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:13,262 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-11-25 23:35:13,262 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-11-25 23:35:13,263 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-11-25 23:35:13,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 23:35:13,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:13,264 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-11-25 23:35:13,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:35:13,265 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-11-25 23:35:13,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:13,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1628803833, now seen corresponding path program 1 times [2022-11-25 23:35:13,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:13,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260956163] [2022-11-25 23:35:13,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:13,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:13,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:13,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:13,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260956163] [2022-11-25 23:35:13,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260956163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:13,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:13,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:35:13,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334373586] [2022-11-25 23:35:13,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:13,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:35:13,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:13,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:35:13,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:13,415 INFO L87 Difference]: Start difference. First operand 69 states and 82 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-11-25 23:35:13,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:13,479 INFO L93 Difference]: Finished difference Result 165 states and 202 transitions. [2022-11-25 23:35:13,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:35:13,480 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-11-25 23:35:13,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:13,481 INFO L225 Difference]: With dead ends: 165 [2022-11-25 23:35:13,482 INFO L226 Difference]: Without dead ends: 114 [2022-11-25 23:35:13,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:13,484 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 59 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:13,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 181 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:13,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-25 23:35:13,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2022-11-25 23:35:13,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.5222222222222221) internal successors, (137), 101 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:13,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 137 transitions. [2022-11-25 23:35:13,501 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 137 transitions. Word has length 28 [2022-11-25 23:35:13,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:13,502 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 137 transitions. [2022-11-25 23:35:13,502 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-11-25 23:35:13,502 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 137 transitions. [2022-11-25 23:35:13,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 23:35:13,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:13,503 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-11-25 23:35:13,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:35:13,504 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-11-25 23:35:13,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:13,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1333674629, now seen corresponding path program 1 times [2022-11-25 23:35:13,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:13,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012226308] [2022-11-25 23:35:13,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:13,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:13,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:13,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:13,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012226308] [2022-11-25 23:35:13,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012226308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:13,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:13,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:35:13,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675235890] [2022-11-25 23:35:13,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:13,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:35:13,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:13,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:35:13,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:13,598 INFO L87 Difference]: Start difference. First operand 102 states and 137 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-11-25 23:35:13,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:13,669 INFO L93 Difference]: Finished difference Result 262 states and 363 transitions. [2022-11-25 23:35:13,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:35:13,670 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-11-25 23:35:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:13,672 INFO L225 Difference]: With dead ends: 262 [2022-11-25 23:35:13,672 INFO L226 Difference]: Without dead ends: 178 [2022-11-25 23:35:13,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:13,674 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 56 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:13,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 178 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:13,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-25 23:35:13,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2022-11-25 23:35:13,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 154 states have (on average 1.5714285714285714) internal successors, (242), 165 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 242 transitions. [2022-11-25 23:35:13,705 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 242 transitions. Word has length 29 [2022-11-25 23:35:13,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:13,705 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 242 transitions. [2022-11-25 23:35:13,706 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-11-25 23:35:13,706 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 242 transitions. [2022-11-25 23:35:13,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 23:35:13,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:13,707 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-11-25 23:35:13,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:35:13,708 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-25 23:35:13,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2007586470, now seen corresponding path program 1 times [2022-11-25 23:35:13,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:13,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599319994] [2022-11-25 23:35:13,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:13,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:13,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:13,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:13,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599319994] [2022-11-25 23:35:13,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599319994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:13,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:13,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:35:13,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217496628] [2022-11-25 23:35:13,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:13,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:35:13,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:13,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:35:13,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:13,890 INFO L87 Difference]: Start difference. First operand 166 states and 242 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-11-25 23:35:13,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:13,966 INFO L93 Difference]: Finished difference Result 446 states and 666 transitions. [2022-11-25 23:35:13,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:35:13,966 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-11-25 23:35:13,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:13,969 INFO L225 Difference]: With dead ends: 446 [2022-11-25 23:35:13,969 INFO L226 Difference]: Without dead ends: 298 [2022-11-25 23:35:13,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:13,971 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 51 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:13,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 174 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-25 23:35:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 286. [2022-11-25 23:35:14,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 274 states have (on average 1.5985401459854014) internal successors, (438), 285 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 438 transitions. [2022-11-25 23:35:14,031 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 438 transitions. Word has length 32 [2022-11-25 23:35:14,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:14,032 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 438 transitions. [2022-11-25 23:35:14,032 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-11-25 23:35:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 438 transitions. [2022-11-25 23:35:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 23:35:14,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:14,034 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-11-25 23:35:14,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:35:14,034 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-11-25 23:35:14,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:14,035 INFO L85 PathProgramCache]: Analyzing trace with hash 62503230, now seen corresponding path program 1 times [2022-11-25 23:35:14,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:14,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328606186] [2022-11-25 23:35:14,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:14,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:14,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:14,122 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:14,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328606186] [2022-11-25 23:35:14,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328606186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:14,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:14,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:35:14,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192524398] [2022-11-25 23:35:14,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:14,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:35:14,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:14,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:35:14,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:35:14,125 INFO L87 Difference]: Start difference. First operand 286 states and 438 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:14,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:14,310 INFO L93 Difference]: Finished difference Result 437 states and 668 transitions. [2022-11-25 23:35:14,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:35:14,310 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-11-25 23:35:14,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:14,314 INFO L225 Difference]: With dead ends: 437 [2022-11-25 23:35:14,314 INFO L226 Difference]: Without dead ends: 434 [2022-11-25 23:35:14,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:35:14,324 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 175 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:14,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 88 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:35:14,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-11-25 23:35:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 420. [2022-11-25 23:35:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 408 states have (on average 1.588235294117647) internal successors, (648), 419 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 648 transitions. [2022-11-25 23:35:14,389 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 648 transitions. Word has length 35 [2022-11-25 23:35:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:14,391 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 648 transitions. [2022-11-25 23:35:14,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:14,397 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 648 transitions. [2022-11-25 23:35:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 23:35:14,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:14,398 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-11-25 23:35:14,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:35:14,399 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-11-25 23:35:14,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:14,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1937600266, now seen corresponding path program 1 times [2022-11-25 23:35:14,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:14,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332293803] [2022-11-25 23:35:14,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:14,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:14,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:14,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332293803] [2022-11-25 23:35:14,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332293803] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:14,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:14,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:35:14,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078595407] [2022-11-25 23:35:14,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:14,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:35:14,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:14,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:35:14,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:35:14,507 INFO L87 Difference]: Start difference. First operand 420 states and 648 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-11-25 23:35:14,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:14,701 INFO L93 Difference]: Finished difference Result 526 states and 779 transitions. [2022-11-25 23:35:14,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:35:14,702 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-11-25 23:35:14,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:14,705 INFO L225 Difference]: With dead ends: 526 [2022-11-25 23:35:14,705 INFO L226 Difference]: Without dead ends: 523 [2022-11-25 23:35:14,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:35:14,715 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 166 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:14,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 157 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:35:14,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-11-25 23:35:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 496. [2022-11-25 23:35:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 484 states have (on average 1.572314049586777) internal successors, (761), 495 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 761 transitions. [2022-11-25 23:35:14,797 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 761 transitions. Word has length 36 [2022-11-25 23:35:14,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:14,798 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 761 transitions. [2022-11-25 23:35:14,798 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-11-25 23:35:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 761 transitions. [2022-11-25 23:35:14,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 23:35:14,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:14,799 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-11-25 23:35:14,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:35:14,800 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-11-25 23:35:14,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:14,800 INFO L85 PathProgramCache]: Analyzing trace with hash -63933760, now seen corresponding path program 1 times [2022-11-25 23:35:14,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:14,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139594009] [2022-11-25 23:35:14,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:14,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:14,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:14,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139594009] [2022-11-25 23:35:14,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139594009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:14,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:14,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:35:14,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195148948] [2022-11-25 23:35:14,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:14,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:35:14,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:14,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:35:14,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:35:14,884 INFO L87 Difference]: Start difference. First operand 496 states and 761 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-11-25 23:35:15,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:15,171 INFO L93 Difference]: Finished difference Result 759 states and 1136 transitions. [2022-11-25 23:35:15,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:35:15,172 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-11-25 23:35:15,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:15,175 INFO L225 Difference]: With dead ends: 759 [2022-11-25 23:35:15,175 INFO L226 Difference]: Without dead ends: 756 [2022-11-25 23:35:15,176 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-11-25 23:35:15,176 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 324 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:15,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 180 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:35:15,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-11-25 23:35:15,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 720. [2022-11-25 23:35:15,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 708 states have (on average 1.536723163841808) internal successors, (1088), 719 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1088 transitions. [2022-11-25 23:35:15,262 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1088 transitions. Word has length 37 [2022-11-25 23:35:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:15,263 INFO L495 AbstractCegarLoop]: Abstraction has 720 states and 1088 transitions. [2022-11-25 23:35:15,263 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-11-25 23:35:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1088 transitions. [2022-11-25 23:35:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 23:35:15,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:15,265 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-11-25 23:35:15,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:35:15,266 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-11-25 23:35:15,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:15,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1981946420, now seen corresponding path program 1 times [2022-11-25 23:35:15,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:15,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545342555] [2022-11-25 23:35:15,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:15,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:15,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:15,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545342555] [2022-11-25 23:35:15,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545342555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:15,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:15,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:35:15,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626182520] [2022-11-25 23:35:15,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:15,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:35:15,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:15,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:35:15,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:35:15,396 INFO L87 Difference]: Start difference. First operand 720 states and 1088 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-11-25 23:35:15,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:15,835 INFO L93 Difference]: Finished difference Result 1692 states and 2497 transitions. [2022-11-25 23:35:15,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:35:15,838 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-11-25 23:35:15,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:15,842 INFO L225 Difference]: With dead ends: 1692 [2022-11-25 23:35:15,842 INFO L226 Difference]: Without dead ends: 998 [2022-11-25 23:35:15,847 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-11-25 23:35:15,848 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 295 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:15,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 362 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:35:15,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2022-11-25 23:35:15,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 945. [2022-11-25 23:35:15,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 933 states have (on average 1.4812433011789925) internal successors, (1382), 944 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:15,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1382 transitions. [2022-11-25 23:35:15,951 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1382 transitions. Word has length 38 [2022-11-25 23:35:15,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:15,951 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1382 transitions. [2022-11-25 23:35:15,951 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-11-25 23:35:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1382 transitions. [2022-11-25 23:35:15,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 23:35:15,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:15,957 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-11-25 23:35:15,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:35:15,957 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-11-25 23:35:15,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1551716282, now seen corresponding path program 1 times [2022-11-25 23:35:15,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:15,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832368564] [2022-11-25 23:35:15,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:15,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:16,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:16,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832368564] [2022-11-25 23:35:16,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832368564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:16,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:16,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:35:16,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451168991] [2022-11-25 23:35:16,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:16,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:35:16,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:16,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:35:16,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:16,076 INFO L87 Difference]: Start difference. First operand 945 states and 1382 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-11-25 23:35:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:16,253 INFO L93 Difference]: Finished difference Result 1814 states and 2650 transitions. [2022-11-25 23:35:16,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:35:16,253 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-11-25 23:35:16,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:16,258 INFO L225 Difference]: With dead ends: 1814 [2022-11-25 23:35:16,258 INFO L226 Difference]: Without dead ends: 895 [2022-11-25 23:35:16,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:16,262 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 29 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:16,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 136 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:16,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-11-25 23:35:16,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 881. [2022-11-25 23:35:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 869 states have (on average 1.4637514384349828) internal successors, (1272), 880 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1272 transitions. [2022-11-25 23:35:16,372 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1272 transitions. Word has length 53 [2022-11-25 23:35:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:16,373 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1272 transitions. [2022-11-25 23:35:16,373 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-11-25 23:35:16,374 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1272 transitions. [2022-11-25 23:35:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 23:35:16,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:16,375 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-11-25 23:35:16,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:35:16,376 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-11-25 23:35:16,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:16,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2090750529, now seen corresponding path program 1 times [2022-11-25 23:35:16,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:16,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284744150] [2022-11-25 23:35:16,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:16,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:16,662 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:16,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284744150] [2022-11-25 23:35:16,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284744150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:16,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:16,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:35:16,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666854573] [2022-11-25 23:35:16,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:16,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:35:16,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:16,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:35:16,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:35:16,664 INFO L87 Difference]: Start difference. First operand 881 states and 1272 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-11-25 23:35:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:16,942 INFO L93 Difference]: Finished difference Result 1750 states and 2524 transitions. [2022-11-25 23:35:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:35:16,943 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-11-25 23:35:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:16,946 INFO L225 Difference]: With dead ends: 1750 [2022-11-25 23:35:16,947 INFO L226 Difference]: Without dead ends: 895 [2022-11-25 23:35:16,948 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-11-25 23:35:16,948 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 31 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:16,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 177 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:35:16,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-11-25 23:35:17,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 881. [2022-11-25 23:35:17,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 869 states have (on average 1.4602991944764097) internal successors, (1269), 880 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1269 transitions. [2022-11-25 23:35:17,050 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1269 transitions. Word has length 57 [2022-11-25 23:35:17,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:17,051 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1269 transitions. [2022-11-25 23:35:17,051 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-11-25 23:35:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1269 transitions. [2022-11-25 23:35:17,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:35:17,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:17,054 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-11-25 23:35:17,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:35:17,054 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-11-25 23:35:17,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:17,055 INFO L85 PathProgramCache]: Analyzing trace with hash 847640831, now seen corresponding path program 1 times [2022-11-25 23:35:17,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:17,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409891226] [2022-11-25 23:35:17,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:17,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:35:17,176 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:17,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409891226] [2022-11-25 23:35:17,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409891226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:17,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:17,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:35:17,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326845603] [2022-11-25 23:35:17,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:17,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:35:17,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:17,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:35:17,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:35:17,178 INFO L87 Difference]: Start difference. First operand 881 states and 1269 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-11-25 23:35:17,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:17,363 INFO L93 Difference]: Finished difference Result 1736 states and 2510 transitions. [2022-11-25 23:35:17,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:35:17,364 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-11-25 23:35:17,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:17,368 INFO L225 Difference]: With dead ends: 1736 [2022-11-25 23:35:17,368 INFO L226 Difference]: Without dead ends: 881 [2022-11-25 23:35:17,369 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-11-25 23:35:17,370 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 190 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:17,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 76 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-11-25 23:35:17,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2022-11-25 23:35:17,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 869 states have (on average 1.4464902186421174) internal successors, (1257), 880 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1257 transitions. [2022-11-25 23:35:17,491 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1257 transitions. Word has length 58 [2022-11-25 23:35:17,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:17,492 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1257 transitions. [2022-11-25 23:35:17,492 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-11-25 23:35:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1257 transitions. [2022-11-25 23:35:17,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:35:17,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:17,493 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-11-25 23:35:17,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 23:35:17,494 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-11-25 23:35:17,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:17,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2119941276, now seen corresponding path program 1 times [2022-11-25 23:35:17,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:17,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821945529] [2022-11-25 23:35:17,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:17,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:35:17,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:17,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821945529] [2022-11-25 23:35:17,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821945529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:17,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:17,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:35:17,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206580680] [2022-11-25 23:35:17,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:17,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:35:17,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:17,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:35:17,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:35:17,616 INFO L87 Difference]: Start difference. First operand 881 states and 1257 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-11-25 23:35:17,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:17,792 INFO L93 Difference]: Finished difference Result 1736 states and 2486 transitions. [2022-11-25 23:35:17,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:35:17,793 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-11-25 23:35:17,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:17,796 INFO L225 Difference]: With dead ends: 1736 [2022-11-25 23:35:17,797 INFO L226 Difference]: Without dead ends: 881 [2022-11-25 23:35:17,798 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-11-25 23:35:17,799 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 200 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 68 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-11-25 23:35:17,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 68 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:17,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-11-25 23:35:17,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2022-11-25 23:35:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 869 states have (on average 1.425776754890679) internal successors, (1239), 880 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1239 transitions. [2022-11-25 23:35:17,931 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1239 transitions. Word has length 58 [2022-11-25 23:35:17,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:17,931 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1239 transitions. [2022-11-25 23:35:17,932 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-11-25 23:35:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1239 transitions. [2022-11-25 23:35:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:35:17,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:17,933 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-11-25 23:35:17,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 23:35:17,933 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-11-25 23:35:17,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:17,934 INFO L85 PathProgramCache]: Analyzing trace with hash -398610401, now seen corresponding path program 1 times [2022-11-25 23:35:17,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:17,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671256009] [2022-11-25 23:35:17,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:17,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:35:18,282 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:18,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671256009] [2022-11-25 23:35:18,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671256009] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:35:18,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462459527] [2022-11-25 23:35:18,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:18,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:18,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:18,290 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:35:18,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:35:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:18,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:35:18,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:18,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:35:18,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:35:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:35:19,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462459527] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:35:19,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1199854311] [2022-11-25 23:35:19,326 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2022-11-25 23:35:19,326 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:35:19,330 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:35:19,335 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:35:19,335 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:35:19,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:19,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:19,688 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-11-25 23:35:19,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:19,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:19,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:19,714 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-11-25 23:35:30,641 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:35:45,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1199854311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:45,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:35:45,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [5, 4, 5] total 52 [2022-11-25 23:35:45,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871959904] [2022-11-25 23:35:45,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:45,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-25 23:35:45,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:45,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-25 23:35:45,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=2085, Unknown=0, NotChecked=0, Total=2756 [2022-11-25 23:35:45,314 INFO L87 Difference]: Start difference. First operand 881 states and 1239 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-11-25 23:35:56,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:56,331 INFO L93 Difference]: Finished difference Result 2217 states and 3149 transitions. [2022-11-25 23:35:56,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-25 23:35:56,332 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-11-25 23:35:56,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:56,337 INFO L225 Difference]: With dead ends: 2217 [2022-11-25 23:35:56,337 INFO L226 Difference]: Without dead ends: 1358 [2022-11-25 23:35:56,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 118 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2713 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=1330, Invalid=4990, Unknown=0, NotChecked=0, Total=6320 [2022-11-25 23:35:56,341 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 190 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:56,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 123 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-25 23:35:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2022-11-25 23:35:56,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1306. [2022-11-25 23:35:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1294 states have (on average 1.3415765069551777) internal successors, (1736), 1305 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1736 transitions. [2022-11-25 23:35:56,608 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1736 transitions. Word has length 58 [2022-11-25 23:35:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:56,608 INFO L495 AbstractCegarLoop]: Abstraction has 1306 states and 1736 transitions. [2022-11-25 23:35:56,609 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-11-25 23:35:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1736 transitions. [2022-11-25 23:35:56,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 23:35:56,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:56,611 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-11-25 23:35:56,617 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 23:35:56,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:56,817 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-11-25 23:35:56,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:56,817 INFO L85 PathProgramCache]: Analyzing trace with hash -545673620, now seen corresponding path program 1 times [2022-11-25 23:35:56,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:56,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763861775] [2022-11-25 23:35:56,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:56,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:56,958 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:35:56,958 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:56,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763861775] [2022-11-25 23:35:56,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763861775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:56,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:56,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:35:56,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618687050] [2022-11-25 23:35:56,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:56,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:35:56,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:56,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:35:56,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:56,961 INFO L87 Difference]: Start difference. First operand 1306 states and 1736 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-11-25 23:35:57,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:57,215 INFO L93 Difference]: Finished difference Result 2460 states and 3269 transitions. [2022-11-25 23:35:57,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:35:57,216 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-11-25 23:35:57,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:57,220 INFO L225 Difference]: With dead ends: 2460 [2022-11-25 23:35:57,220 INFO L226 Difference]: Without dead ends: 1180 [2022-11-25 23:35:57,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:57,223 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 30 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:57,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 161 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:57,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2022-11-25 23:35:57,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1022. [2022-11-25 23:35:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1010 states have (on average 1.3455445544554456) internal successors, (1359), 1021 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1359 transitions. [2022-11-25 23:35:57,449 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1359 transitions. Word has length 81 [2022-11-25 23:35:57,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:57,449 INFO L495 AbstractCegarLoop]: Abstraction has 1022 states and 1359 transitions. [2022-11-25 23:35:57,450 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-11-25 23:35:57,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1359 transitions. [2022-11-25 23:35:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 23:35:57,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:57,451 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-11-25 23:35:57,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 23:35:57,452 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-11-25 23:35:57,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:57,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1816895466, now seen corresponding path program 2 times [2022-11-25 23:35:57,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:57,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874878738] [2022-11-25 23:35:57,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:57,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 23:35:57,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:57,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874878738] [2022-11-25 23:35:57,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874878738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:57,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:57,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:35:57,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444882039] [2022-11-25 23:35:57,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:57,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:35:57,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:57,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:35:57,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:57,515 INFO L87 Difference]: Start difference. First operand 1022 states and 1359 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-11-25 23:35:57,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:57,774 INFO L93 Difference]: Finished difference Result 1023 states and 1359 transitions. [2022-11-25 23:35:57,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:35:57,774 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-11-25 23:35:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:57,778 INFO L225 Difference]: With dead ends: 1023 [2022-11-25 23:35:57,779 INFO L226 Difference]: Without dead ends: 1020 [2022-11-25 23:35:57,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:57,781 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 54 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:57,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 61 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:57,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2022-11-25 23:35:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1020. [2022-11-25 23:35:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1010 states have (on average 1.314851485148515) internal successors, (1328), 1019 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1328 transitions. [2022-11-25 23:35:58,011 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1328 transitions. Word has length 81 [2022-11-25 23:35:58,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:58,011 INFO L495 AbstractCegarLoop]: Abstraction has 1020 states and 1328 transitions. [2022-11-25 23:35:58,011 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-11-25 23:35:58,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1328 transitions. [2022-11-25 23:35:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 23:35:58,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:58,013 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-11-25 23:35:58,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 23:35:58,013 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-11-25 23:35:58,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:58,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1325175212, now seen corresponding path program 3 times [2022-11-25 23:35:58,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:58,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381562963] [2022-11-25 23:35:58,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:58,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:35:58,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:58,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381562963] [2022-11-25 23:35:58,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381562963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:58,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:58,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:35:58,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696073958] [2022-11-25 23:35:58,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:58,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:35:58,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:58,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:35:58,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:58,123 INFO L87 Difference]: Start difference. First operand 1020 states and 1328 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-11-25 23:35:58,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:58,230 INFO L93 Difference]: Finished difference Result 1440 states and 1851 transitions. [2022-11-25 23:35:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:35:58,231 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-11-25 23:35:58,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:58,233 INFO L225 Difference]: With dead ends: 1440 [2022-11-25 23:35:58,233 INFO L226 Difference]: Without dead ends: 440 [2022-11-25 23:35:58,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:58,235 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 24 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:58,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 142 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:58,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-11-25 23:35:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 421. [2022-11-25 23:35:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 411 states have (on average 1.2846715328467153) internal successors, (528), 420 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 528 transitions. [2022-11-25 23:35:58,324 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 528 transitions. Word has length 81 [2022-11-25 23:35:58,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:58,324 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 528 transitions. [2022-11-25 23:35:58,324 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-11-25 23:35:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 528 transitions. [2022-11-25 23:35:58,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-25 23:35:58,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:58,332 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-11-25 23:35:58,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 23:35:58,332 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-11-25 23:35:58,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:58,333 INFO L85 PathProgramCache]: Analyzing trace with hash -489184462, now seen corresponding path program 1 times [2022-11-25 23:35:58,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:58,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863223475] [2022-11-25 23:35:58,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:58,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 23:35:58,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:58,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863223475] [2022-11-25 23:35:58,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863223475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:58,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:58,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:35:58,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460081366] [2022-11-25 23:35:58,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:58,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:35:58,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:58,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:35:58,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:58,392 INFO L87 Difference]: Start difference. First operand 421 states and 528 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-11-25 23:35:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:58,520 INFO L93 Difference]: Finished difference Result 422 states and 528 transitions. [2022-11-25 23:35:58,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:35:58,521 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-11-25 23:35:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:58,523 INFO L225 Difference]: With dead ends: 422 [2022-11-25 23:35:58,523 INFO L226 Difference]: Without dead ends: 419 [2022-11-25 23:35:58,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:58,525 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 51 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 56 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-11-25 23:35:58,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 56 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:58,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-11-25 23:35:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 413. [2022-11-25 23:35:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 405 states have (on average 1.237037037037037) internal successors, (501), 412 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:58,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 501 transitions. [2022-11-25 23:35:58,615 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 501 transitions. Word has length 82 [2022-11-25 23:35:58,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:58,616 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 501 transitions. [2022-11-25 23:35:58,616 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-11-25 23:35:58,616 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 501 transitions. [2022-11-25 23:35:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-25 23:35:58,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:58,617 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-11-25 23:35:58,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 23:35:58,618 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-11-25 23:35:58,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:58,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2015151000, now seen corresponding path program 1 times [2022-11-25 23:35:58,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:58,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831442069] [2022-11-25 23:35:58,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:58,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:35:58,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:58,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831442069] [2022-11-25 23:35:58,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831442069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:58,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:58,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:35:58,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051792248] [2022-11-25 23:35:58,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:58,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:35:58,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:58,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:35:58,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:58,724 INFO L87 Difference]: Start difference. First operand 413 states and 501 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-11-25 23:35:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:58,803 INFO L93 Difference]: Finished difference Result 626 states and 749 transitions. [2022-11-25 23:35:58,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:35:58,804 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-11-25 23:35:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:58,805 INFO L225 Difference]: With dead ends: 626 [2022-11-25 23:35:58,805 INFO L226 Difference]: Without dead ends: 254 [2022-11-25 23:35:58,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:58,806 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 14 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:58,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 146 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:58,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-11-25 23:35:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2022-11-25 23:35:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 240 states have (on average 1.2) internal successors, (288), 247 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 288 transitions. [2022-11-25 23:35:58,860 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 288 transitions. Word has length 83 [2022-11-25 23:35:58,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:58,861 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 288 transitions. [2022-11-25 23:35:58,861 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-11-25 23:35:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 288 transitions. [2022-11-25 23:35:58,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-25 23:35:58,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:58,863 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-11-25 23:35:58,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 23:35:58,864 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-11-25 23:35:58,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:58,864 INFO L85 PathProgramCache]: Analyzing trace with hash -412724424, now seen corresponding path program 1 times [2022-11-25 23:35:58,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:58,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702075246] [2022-11-25 23:35:58,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:58,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 23:35:58,927 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:58,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702075246] [2022-11-25 23:35:58,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702075246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:58,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:58,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:35:58,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57884984] [2022-11-25 23:35:58,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:58,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:35:58,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:58,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:35:58,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:58,929 INFO L87 Difference]: Start difference. First operand 248 states and 288 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-11-25 23:35:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:59,019 INFO L93 Difference]: Finished difference Result 249 states and 288 transitions. [2022-11-25 23:35:59,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:35:59,020 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-11-25 23:35:59,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:59,021 INFO L225 Difference]: With dead ends: 249 [2022-11-25 23:35:59,021 INFO L226 Difference]: Without dead ends: 246 [2022-11-25 23:35:59,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:59,022 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 44 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:59,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 50 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:59,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-11-25 23:35:59,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2022-11-25 23:35:59,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 234 states have (on average 1.1752136752136753) internal successors, (275), 239 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:59,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 275 transitions. [2022-11-25 23:35:59,075 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 275 transitions. Word has length 84 [2022-11-25 23:35:59,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:59,075 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 275 transitions. [2022-11-25 23:35:59,075 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-11-25 23:35:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 275 transitions. [2022-11-25 23:35:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-25 23:35:59,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:59,076 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-11-25 23:35:59,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 23:35:59,077 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-11-25 23:35:59,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:59,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1016833922, now seen corresponding path program 1 times [2022-11-25 23:35:59,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:59,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940341089] [2022-11-25 23:35:59,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:59,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:59,132 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:35:59,132 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:59,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940341089] [2022-11-25 23:35:59,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940341089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:59,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:59,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:35:59,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066539828] [2022-11-25 23:35:59,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:59,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:35:59,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:59,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:35:59,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:59,135 INFO L87 Difference]: Start difference. First operand 240 states and 275 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-11-25 23:35:59,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:59,225 INFO L93 Difference]: Finished difference Result 441 states and 516 transitions. [2022-11-25 23:35:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:35:59,226 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-11-25 23:35:59,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:59,227 INFO L225 Difference]: With dead ends: 441 [2022-11-25 23:35:59,227 INFO L226 Difference]: Without dead ends: 300 [2022-11-25 23:35:59,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:59,229 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 38 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 158 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-11-25 23:35:59,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 158 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-11-25 23:35:59,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 295. [2022-11-25 23:35:59,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 289 states have (on average 1.166089965397924) internal successors, (337), 294 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:59,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 337 transitions. [2022-11-25 23:35:59,300 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 337 transitions. Word has length 85 [2022-11-25 23:35:59,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:59,300 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 337 transitions. [2022-11-25 23:35:59,300 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-11-25 23:35:59,301 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 337 transitions. [2022-11-25 23:35:59,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-25 23:35:59,302 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:59,302 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-11-25 23:35:59,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 23:35:59,302 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-11-25 23:35:59,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:59,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1316264089, now seen corresponding path program 1 times [2022-11-25 23:35:59,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:59,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650304015] [2022-11-25 23:35:59,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:59,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 23:35:59,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:59,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650304015] [2022-11-25 23:35:59,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650304015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:59,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:59,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:35:59,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476147681] [2022-11-25 23:35:59,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:59,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:35:59,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:59,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:35:59,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:59,366 INFO L87 Difference]: Start difference. First operand 295 states and 337 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-11-25 23:35:59,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:59,469 INFO L93 Difference]: Finished difference Result 296 states and 337 transitions. [2022-11-25 23:35:59,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:35:59,470 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-11-25 23:35:59,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:59,471 INFO L225 Difference]: With dead ends: 296 [2022-11-25 23:35:59,472 INFO L226 Difference]: Without dead ends: 293 [2022-11-25 23:35:59,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:59,472 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 36 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:59,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 50 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:59,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-25 23:35:59,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 254. [2022-11-25 23:35:59,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 250 states have (on average 1.144) internal successors, (286), 253 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:59,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 286 transitions. [2022-11-25 23:35:59,546 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 286 transitions. Word has length 89 [2022-11-25 23:35:59,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:59,547 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 286 transitions. [2022-11-25 23:35:59,547 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-11-25 23:35:59,547 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 286 transitions. [2022-11-25 23:35:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-25 23:35:59,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:59,548 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-11-25 23:35:59,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 23:35:59,549 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-11-25 23:35:59,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:59,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1284876936, now seen corresponding path program 4 times [2022-11-25 23:35:59,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:59,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385202528] [2022-11-25 23:35:59,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:59,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:36:00,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:00,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385202528] [2022-11-25 23:36:00,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385202528] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:00,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659314664] [2022-11-25 23:36:00,628 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:36:00,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:00,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:00,629 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:00,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:36:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:00,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 23:36:00,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 23:36:00,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:36:00,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659314664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:00,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:36:00,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2022-11-25 23:36:00,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383672801] [2022-11-25 23:36:00,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:00,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:36:00,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:00,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:36:00,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:36:00,837 INFO L87 Difference]: Start difference. First operand 254 states and 286 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-11-25 23:36:00,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:00,964 INFO L93 Difference]: Finished difference Result 383 states and 434 transitions. [2022-11-25 23:36:00,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:36:00,965 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-11-25 23:36:00,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:00,966 INFO L225 Difference]: With dead ends: 383 [2022-11-25 23:36:00,967 INFO L226 Difference]: Without dead ends: 222 [2022-11-25 23:36:00,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:36:00,969 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 28 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:00,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 303 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:36:00,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-25 23:36:01,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-11-25 23:36:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 218 states have (on average 1.114678899082569) internal successors, (243), 221 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 243 transitions. [2022-11-25 23:36:01,058 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 243 transitions. Word has length 97 [2022-11-25 23:36:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:01,058 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 243 transitions. [2022-11-25 23:36:01,059 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-11-25 23:36:01,059 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 243 transitions. [2022-11-25 23:36:01,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-25 23:36:01,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:01,060 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, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:01,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:36:01,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-25 23:36:01,266 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-25 23:36:01,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:01,267 INFO L85 PathProgramCache]: Analyzing trace with hash -2121831527, now seen corresponding path program 1 times [2022-11-25 23:36:01,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:01,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912603113] [2022-11-25 23:36:01,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:01,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 23:36:01,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:01,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912603113] [2022-11-25 23:36:01,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912603113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:01,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:01,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:36:01,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341476203] [2022-11-25 23:36:01,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:01,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:36:01,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:01,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:36:01,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:36:01,346 INFO L87 Difference]: Start difference. First operand 222 states and 243 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:01,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:01,440 INFO L93 Difference]: Finished difference Result 349 states and 387 transitions. [2022-11-25 23:36:01,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:36:01,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 103 [2022-11-25 23:36:01,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:01,442 INFO L225 Difference]: With dead ends: 349 [2022-11-25 23:36:01,442 INFO L226 Difference]: Without dead ends: 222 [2022-11-25 23:36:01,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:36:01,443 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 16 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:01,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 106 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:36:01,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-25 23:36:01,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 192. [2022-11-25 23:36:01,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 188 states have (on average 1.1063829787234043) internal successors, (208), 191 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 208 transitions. [2022-11-25 23:36:01,499 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 208 transitions. Word has length 103 [2022-11-25 23:36:01,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:01,499 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 208 transitions. [2022-11-25 23:36:01,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2022-11-25 23:36:01,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-25 23:36:01,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:01,501 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 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, 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] [2022-11-25 23:36:01,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 23:36:01,501 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-25 23:36:01,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:01,502 INFO L85 PathProgramCache]: Analyzing trace with hash 283875224, now seen corresponding path program 1 times [2022-11-25 23:36:01,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:01,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454660784] [2022-11-25 23:36:01,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:01,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:02,407 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 65 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 23:36:02,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:02,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454660784] [2022-11-25 23:36:02,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454660784] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:02,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278495178] [2022-11-25 23:36:02,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:02,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:02,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:02,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:02,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:36:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:02,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 23:36:02,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 65 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 23:36:03,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:36:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 23:36:04,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278495178] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:36:04,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [836768298] [2022-11-25 23:36:04,126 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2022-11-25 23:36:04,126 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:36:04,127 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:36:04,127 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:36:04,128 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:36:04,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,662 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-11-25 23:36:04,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:04,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:04,678 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-11-25 23:36:14,571 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:36:35,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [836768298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:35,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:36:35,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [8, 5, 6] total 59 [2022-11-25 23:36:35,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270359693] [2022-11-25 23:36:35,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:35,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-25 23:36:35,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:35,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-25 23:36:35,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=850, Invalid=2690, Unknown=0, NotChecked=0, Total=3540 [2022-11-25 23:36:35,918 INFO L87 Difference]: Start difference. First operand 192 states and 208 transitions. Second operand has 44 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:15,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:15,996 INFO L93 Difference]: Finished difference Result 303 states and 335 transitions. [2022-11-25 23:37:15,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-11-25 23:37:15,997 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 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 109 [2022-11-25 23:37:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:15,997 INFO L225 Difference]: With dead ends: 303 [2022-11-25 23:37:15,997 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 23:37:16,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 257 SyntacticMatches, 20 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5526 ImplicationChecksByTransitivity, 58.2s TimeCoverageRelationStatistics Valid=2647, Invalid=10235, Unknown=0, NotChecked=0, Total=12882 [2022-11-25 23:37:16,002 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 182 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:16,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 86 Invalid, 1845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-25 23:37:16,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 23:37:16,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 23:37:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 23:37:16,003 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2022-11-25 23:37:16,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:16,003 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 23:37:16,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:16,004 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 23:37:16,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 23:37:16,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-25 23:37:16,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-25 23:37:16,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-25 23:37:16,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-25 23:37:16,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-25 23:37:16,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-25 23:37:16,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-25 23:37:16,009 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-25 23:37:16,009 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-25 23:37:16,009 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-25 23:37:16,009 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-25 23:37:16,009 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-25 23:37:16,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-25 23:37:16,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-25 23:37:16,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:37:16,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-25 23:37:16,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 23:37:49,110 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-25 23:37:49,111 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 280) no Hoare annotation was computed. [2022-11-25 23:37:49,111 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 408) no Hoare annotation was computed. [2022-11-25 23:37:49,111 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 23:37:49,111 INFO L895 garLoopResultBuilder]: At program point L284(lines 265 285) the Hoare annotation is: false [2022-11-25 23:37:49,112 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 448) no Hoare annotation was computed. [2022-11-25 23:37:49,112 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-25 23:37:49,112 INFO L895 garLoopResultBuilder]: At program point L318(lines 146 331) the Hoare annotation is: (let ((.cse50 (+ ~nomsg~0 1)) (.cse55 (+ ~p2_new~0 1)) (.cse53 (+ ~p1_old~0 1)) (.cse54 (+ ~p3_new~0 1)) (.cse56 (+ |ULTIMATE.start_main_~node2__m2~0#1| 1))) (let ((.cse25 (= ~send2~0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|)) (.cse26 (= (let ((.cse57 (mod |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256))) (ite (<= .cse57 127) .cse57 (+ (- 256) .cse57))) ~p2_new~0)) (.cse4 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse48 (<= 0 .cse56)) (.cse49 (<= .cse56 0)) (.cse27 (<= 0 ~id3~0)) (.cse28 (<= 0 .cse54)) (.cse29 (<= 0 .cse53)) (.cse30 (<= 0 ~id1~0)) (.cse47 (<= 0 ~__return_1470~0)) (.cse32 (<= ~mode2~0 0)) (.cse33 (<= 0 ~st1~0)) (.cse34 (<= 0 ~st2~0)) (.cse35 (<= 0 ~p2~0)) (.cse36 (<= 0 ~send2~0)) (.cse37 (<= ~id1~0 127)) (.cse38 (<= 0 .cse55)) (.cse39 (<= .cse50 0)) (.cse40 (<= ~__return_1394~0 1)) (.cse41 (<= .cse55 0)) (.cse42 (<= ~p2~0 0)) (.cse43 (<= .cse54 0)) (.cse44 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse45 (<= .cse53 0)) (.cse46 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|))) (let ((.cse1 (let ((.cse51 (<= 0 ~mode1~0)) (.cse52 (<= ~mode1~0 1))) (or (and .cse27 (<= 1 ~mode2~0) .cse28 .cse51 .cse30 .cse47 (<= ~mode2~0 1) .cse33 .cse34 .cse35 .cse37 .cse39 .cse52 .cse40 (<= 0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) .cse42 .cse43 .cse44 .cse48 .cse49 .cse46) (and .cse27 .cse28 .cse51 .cse29 .cse30 .cse47 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse52 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46)))) (.cse3 (<= 0 ~mode3~0)) (.cse6 (<= ~mode3~0 1)) (.cse0 (= ~mode2~0 1)) (.cse24 (<= .cse4 0)) (.cse5 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse7 (= ~mode1~0 1)) (.cse8 (or (= ~mode2~0 0) (and .cse25 .cse26))) (.cse2 (* (div ~r1~0 256) 256)) (.cse9 (<= ~id3~0 127)) (.cse10 (<= 0 ~id2~0)) (.cse11 (= |#NULL.offset| 0)) (.cse12 (<= 0 .cse50)) (.cse13 (<= ~id2~0 127)) (.cse14 (<= 0 ~st3~0)) (.cse15 (<= 1 ~__return_1394~0)) (.cse16 (= ~p3~0 0)) (.cse17 (<= 0 ~send3~0)) (.cse18 (= ~p1~0 0)) (.cse19 (<= 0 |#StackHeapBarrier|)) (.cse20 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse21 (= ~__return_main~0 0)) (.cse22 (= |#NULL.base| 0)) (.cse23 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and .cse0 .cse1 (< (+ .cse2 2) ~r1~0) .cse3 (<= .cse4 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse3 .cse24 .cse25 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse31 (+ ~p1_new~0 1))) (and (= ~mode3~0 1) .cse27 .cse28 .cse29 (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1470~0) (<= ~st2~0 1) .cse30 (<= .cse31 0) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1470~0) .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= ~st1~0 1) .cse38 (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0)) .cse39 (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) .cse40 .cse41 (= ~mode1~0 0) .cse9 (<= ~st3~0 1) .cse10 .cse11 .cse12 .cse42 (<= 0 ~mode2~0) .cse13 .cse14 .cse15 .cse43 .cse44 (<= ~__return_1470~0 1) .cse16 (<= 0 .cse31) (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) .cse45 .cse17 .cse18 .cse19 .cse20 .cse21 .cse46 .cse22 .cse23)) (and .cse27 .cse28 .cse0 .cse30 .cse47 (= ~p2~0 0) .cse24 .cse33 .cse5 .cse34 .cse36 .cse7 .cse37 .cse39 .cse40 .cse8 (<= ~r1~0 .cse2) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse43 .cse44 .cse48 .cse16 .cse17 .cse18 .cse19 .cse20 .cse49 .cse21 .cse46 .cse22 .cse23))))) [2022-11-25 23:37:49,113 INFO L902 garLoopResultBuilder]: At program point L467(lines 58 470) the Hoare annotation is: true [2022-11-25 23:37:49,113 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-25 23:37:49,113 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 403) no Hoare annotation was computed. [2022-11-25 23:37:49,113 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 443) no Hoare annotation was computed. [2022-11-25 23:37:49,114 INFO L895 garLoopResultBuilder]: At program point L369(lines 126 382) the Hoare annotation is: (let ((.cse43 (+ ~nomsg~0 1)) (.cse42 (+ ~p3_new~0 1))) (let ((.cse44 (+ ~p2_new~0 1)) (.cse29 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse30 (<= 0 ~id3~0)) (.cse31 (<= 0 .cse42)) (.cse32 (<= 0 ~id1~0)) (.cse33 (<= 0 ~__return_1470~0)) (.cse35 (<= 0 ~st1~0)) (.cse36 (<= 0 ~st2~0)) (.cse37 (<= 0 ~send2~0)) (.cse38 (<= ~id1~0 127)) (.cse39 (<= .cse43 0)) (.cse40 (<= ~__return_1394~0 1))) (let ((.cse1 (<= 0 ~mode3~0)) (.cse3 (let ((.cse45 (<= 0 ~mode1~0)) (.cse46 (<= 0 ~p2~0)) (.cse47 (<= ~mode1~0 1)) (.cse48 (<= ~p2~0 0))) (or (let ((.cse49 (+ |ULTIMATE.start_main_~node2__m2~0#1| 1))) (and .cse30 (<= 1 ~mode2~0) .cse31 .cse45 .cse32 .cse33 (<= ~mode2~0 1) .cse35 .cse36 .cse46 .cse38 .cse39 .cse47 .cse40 (<= 0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) .cse48 (<= 0 .cse49) (<= .cse49 0))) (let ((.cse50 (+ ~p1_old~0 1))) (and .cse30 .cse31 .cse45 (<= 0 .cse50) .cse32 .cse33 (<= ~mode2~0 0) .cse35 .cse36 .cse46 .cse37 .cse38 .cse39 .cse47 .cse40 .cse48 (<= .cse50 0)))))) (.cse5 (<= ~mode3~0 1)) (.cse13 (<= 0 ~mode2~0)) (.cse0 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse2 (<= .cse29 0)) (.cse4 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse6 (= ~mode1~0 1)) (.cse28 (* (div ~r1~0 256) 256)) (.cse18 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse25 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse34 (= ~p2~0 0)) (.cse7 (<= 0 .cse44)) (.cse8 (<= .cse44 0)) (.cse9 (<= ~id3~0 127)) (.cse10 (<= 0 ~id2~0)) (.cse11 (= |#NULL.offset| 0)) (.cse12 (<= 0 .cse43)) (.cse14 (<= ~id2~0 127)) (.cse15 (<= 0 ~st3~0)) (.cse16 (<= 1 ~__return_1394~0)) (.cse17 (<= .cse42 0)) (.cse19 (= ~p3~0 0)) (.cse20 (<= 0 ~send3~0)) (.cse21 (= ~p1~0 0)) (.cse22 (<= 0 |#StackHeapBarrier|)) (.cse23 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse24 (= ~__return_main~0 0)) (.cse26 (= |#NULL.base| 0)) (.cse27 (= |ULTIMATE.start_main_~main__i2~0#1| 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) (and .cse0 (< (+ .cse28 2) ~r1~0) .cse1 (<= .cse29 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse30 .cse31 .cse32 .cse33 .cse0 .cse34 .cse2 .cse35 .cse4 .cse36 .cse37 .cse6 .cse38 .cse7 .cse39 .cse40 .cse8 (<= ~r1~0 .cse28) .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (let ((.cse41 (+ ~p1_new~0 1))) (and (= ~mode3~0 1) .cse30 (= ~mode2~0 1) (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1470~0) (<= ~st2~0 1) .cse32 .cse34 (<= .cse41 0) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1470~0) (= ~p3_new~0 ~nomsg~0) .cse35 .cse36 .cse37 .cse38 (<= ~st1~0 1) (= |ULTIMATE.start_main_~init__tmp~0#1| 1) .cse7 (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0)) (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) .cse40 .cse8 (= ~mode1~0 0) .cse9 (<= ~st3~0 1) .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 (<= ~__return_1470~0 1) .cse19 (<= 0 .cse41) (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) .cse20 .cse21 .cse22 .cse23 .cse24 .cse26 .cse27)))))) [2022-11-25 23:37:49,114 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 398) no Hoare annotation was computed. [2022-11-25 23:37:49,114 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 438) no Hoare annotation was computed. [2022-11-25 23:37:49,114 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-25 23:37:49,115 INFO L895 garLoopResultBuilder]: At program point L206(lines 114 384) the Hoare annotation is: (let ((.cse55 (= |ULTIMATE.start_main_~main__c1~0#1| 0)) (.cse65 (+ ~p2_new~0 1)) (.cse63 (+ ~p1_new~0 1)) (.cse62 (+ ~p1_old~0 1)) (.cse64 (+ ~p3_new~0 1)) (.cse61 (+ ~nomsg~0 1)) (.cse52 (+ ~st3~0 ~st2~0 ~st1~0))) (let ((.cse1 (= ~mode3~0 1)) (.cse2 (= ~mode2~0 1)) (.cse12 (= ~mode1~0 1)) (.cse39 (<= .cse52 2147483647)) (.cse46 (<= 0 ~id3~0)) (.cse51 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse43 (= ~p2~0 0)) (.cse44 (= .cse52 0)) (.cse48 (<= ~mode2~0 1)) (.cse11 (<= 0 ~send2~0)) (.cse14 (= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse0 (<= .cse61 ~id3~0)) (.cse42 (<= 0 .cse64)) (.cse58 (<= 0 .cse62)) (.cse3 (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1470~0)) (.cse4 (<= 0 ~id1~0)) (.cse5 (<= .cse63 0)) (.cse6 (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1470~0)) (.cse47 (<= 0 ~mode3~0)) (.cse7 (<= .cse52 1)) (.cse8 (<= 0 ~st1~0)) (.cse53 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse9 (<= 0 ~st2~0)) (.cse49 (<= ~mode3~0 1)) (.cse10 (<= 0 ~p2~0)) (.cse13 (<= ~id1~0 127)) (.cse15 (<= 0 .cse65)) (.cse16 (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))) (.cse17 (<= .cse61 0)) (.cse18 (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|)) (.cse19 (<= ~__return_1394~0 1)) (.cse20 (<= .cse65 0)) (.cse59 (= ~mode1~0 0)) (.cse21 (<= ~id3~0 127)) (.cse22 (<= 0 ~id2~0)) (.cse23 (= |#NULL.offset| 0)) (.cse24 (<= 0 .cse61)) (.cse25 (<= ~p2~0 0)) (.cse50 (<= 0 ~mode2~0)) (.cse26 (<= ~id2~0 127)) (.cse27 (<= 0 ~st3~0)) (.cse28 (not (< (mod ~r1~0 256) 3))) (.cse29 (<= 1 ~__return_1394~0)) (.cse45 (<= .cse64 0)) (.cse54 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse30 (<= ~__return_1470~0 1)) (.cse31 (= ~p3~0 0)) (.cse32 (<= 0 .cse63)) (.cse33 (= (ite .cse55 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|)) (.cse60 (<= .cse62 0)) (.cse34 (<= 0 ~send3~0)) (.cse35 (= ~p1~0 0)) (.cse36 (<= 0 |#StackHeapBarrier|)) (.cse37 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse38 (= ~__return_main~0 0)) (.cse57 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse40 (= |#NULL.base| 0)) (.cse41 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~p3_new~0 ~nomsg~0) .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) (and .cse0 .cse1 .cse42 .cse2 .cse3 .cse4 .cse43 .cse5 .cse6 .cse44 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse26 .cse27 .cse29 .cse45 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) (and .cse46 .cse42 (or (and .cse47 .cse48 .cse49 (<= ~mode1~0 1) .cse50) (<= |ULTIMATE.start_main_~main__c1~0#1| 0)) .cse4 .cse51 .cse5 (= (* 256 (div ~mode1~0 256)) ~mode1~0) (<= .cse52 0) .cse53 .cse9 (<= ~p1~0 0) (<= ~__return_main~0 0) .cse10 .cse11 .cse13 .cse15 .cse17 (<= ~st2~0 0) .cse19 .cse20 (<= ~r1~0 (* (div ~r1~0 256) 256)) (<= 0 ~__return_main~0) .cse21 .cse22 .cse23 .cse24 (<= 0 (+ ~st2~0 ~st1~0)) .cse25 .cse26 .cse27 .cse29 .cse45 .cse54 .cse30 .cse31 .cse32 (or (let ((.cse56 (select |#memory_int| 1))) (and (= ~__return_1470~0 0) (= (select |#length| 3) 12) (= (select |#length| 2) 50) (= (select ~nodes~0.base 0) |#funAddr~node1.base|) (= 2 (select |#length| 1)) (= ~send3~0 ~id3~0) (= |#funAddr~node3.base| (select ~nodes~0.base 2)) (= (select |#valid| 3) 1) (= ~nomsg~0 ~p2_old~0) (not (= ~id3~0 ~id2~0)) (= |#funAddr~node2.base| (select ~nodes~0.base 1)) (not (= ~id1~0 ~id3~0)) .cse55 (not (= ~id1~0 ~id2~0)) (= ~nomsg~0 ~p1_old~0) (= (select ~nodes~0.offset 0) |#funAddr~node1.offset|) (= (select |#valid| 1) 1) (= ~send1~0 ~id1~0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= ~p3_old~0 ~nomsg~0) (= (select .cse56 0) 48) (= (select ~nodes~0.offset 2) |#funAddr~node3.offset|) (= (select .cse56 1) 0) (= |#funAddr~node2.offset| (select ~nodes~0.offset 1)) (< 0 |#StackHeapBarrier|) (= ~send2~0 ~id2~0))) (and .cse3 .cse6 .cse16 .cse18 .cse33)) .cse34 (<= 0 ~p1~0) .cse36 .cse37 .cse57 .cse40 .cse41) (and .cse46 .cse42 .cse58 .cse3 .cse4 .cse51 .cse43 .cse5 .cse6 .cse47 .cse44 .cse48 .cse8 .cse53 .cse9 .cse49 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse59 .cse21 .cse22 .cse23 .cse24 .cse50 .cse26 .cse27 .cse29 .cse45 .cse30 .cse31 .cse32 .cse33 .cse60 .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 .cse41) (and .cse0 .cse42 (<= .cse61 ~send2~0) .cse58 .cse3 .cse4 .cse5 .cse6 .cse47 (<= ~mode2~0 0) .cse7 .cse8 .cse53 .cse9 .cse49 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse59 .cse21 .cse22 .cse23 .cse24 .cse25 .cse50 .cse26 .cse27 .cse28 .cse29 .cse45 .cse54 .cse30 .cse31 .cse32 .cse33 .cse60 .cse34 .cse35 .cse36 .cse37 .cse38 .cse57 .cse40 .cse41)))) [2022-11-25 23:37:49,116 INFO L895 garLoopResultBuilder]: At program point L355(lines 128 356) 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) (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1470~0) (not (= 255 (mod ~r1~0 256))) (<= 0 ~id1~0) (<= .cse0 0) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1470~0) (= ~p3_new~0 ~nomsg~0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 1) (<= 0 ~st1~0) (<= 0 ~st2~0) (<= 0 ~p2~0) (<= 0 ~send2~0) (= ~mode1~0 1) (<= ~id1~0 127) (= |ULTIMATE.start_main_~init__tmp~0#1| 1) (<= 0 .cse1) (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0)) (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) (<= ~__return_1394~0 1) (<= .cse1 0) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= ~p2~0 0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= 1 ~__return_1394~0) (<= (+ ~p3_new~0 1) 0) (<= ~__return_1470~0 1) (= ~p3~0 0) (<= 0 .cse0) (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) (<= 0 ~send3~0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~main__c1~0#1|) (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~0#1|) (= ~__return_main~0 0) (= |#NULL.base| 0) (= |ULTIMATE.start_main_~main__i2~0#1| 0))) [2022-11-25 23:37:49,116 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 23:37:49,116 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-25 23:37:49,117 INFO L895 garLoopResultBuilder]: At program point L273(lines 161 286) the Hoare annotation is: (let ((.cse36 (+ ~nomsg~0 1))) (let ((.cse1 (<= 0 ~id3~0)) (.cse9 (<= 0 ~send2~0)) (.cse0 (= ~mode3~0 1)) (.cse2 (= ~mode2~0 1)) (.cse3 (<= 0 ~id1~0)) (.cse4 (<= 0 ~__return_1470~0)) (.cse5 (= ~p2~0 0)) (.cse6 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse7 (<= 0 ~st1~0)) (.cse8 (<= 0 ~st2~0)) (.cse10 (= ~mode1~0 1)) (.cse11 (<= ~id1~0 127)) (.cse12 (= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse13 (<= .cse36 0)) (.cse14 (<= ~__return_1394~0 1)) (.cse15 (<= ~id3~0 127)) (.cse16 (<= 0 ~id2~0)) (.cse17 (= |#NULL.offset| 0)) (.cse18 (<= 0 .cse36)) (.cse19 (<= ~id2~0 127)) (.cse20 (<= 0 ~st3~0)) (.cse21 (<= 1 ~__return_1394~0)) (.cse22 (= ~p3~0 0)) (.cse23 (<= 0 ~send3~0)) (.cse24 (= ~p1~0 0)) (.cse25 (<= 0 |#StackHeapBarrier|)) (.cse26 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse27 (= ~__return_main~0 0)) (.cse28 (= |#NULL.base| 0)) (.cse29 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse6 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (let ((.cse35 (+ ~p2_new~0 1)) (.cse30 (+ ~p3_new~0 1)) (.cse34 (+ ~p1_new~0 1)) (.cse31 (= |ULTIMATE.start_main_~main__c1~0#1| 0)) (.cse33 (+ ~p1_old~0 1))) (and .cse1 (<= 0 .cse30) (or (let ((.cse32 (select |#memory_int| 1))) (and (= ~__return_1470~0 0) (= (select |#length| 3) 12) (= (select |#length| 2) 50) (= (select ~nodes~0.base 0) |#funAddr~node1.base|) (= 2 (select |#length| 1)) (= ~send3~0 ~id3~0) (= |#funAddr~node3.base| (select ~nodes~0.base 2)) (= (select |#valid| 3) 1) (= ~st3~0 0) (= ~nomsg~0 ~p2_old~0) (not (= ~id3~0 ~id2~0)) (= |#funAddr~node2.base| (select ~nodes~0.base 1)) (not (= ~id1~0 ~id3~0)) .cse31 (= ~st1~0 0) (not (= ~id1~0 ~id2~0)) (= (select ~nodes~0.offset 0) |#funAddr~node1.offset|) (= (select |#valid| 1) 1) (= ~send1~0 ~id1~0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= ~st2~0 0) (= ~p3_old~0 ~nomsg~0) (= (select .cse32 0) 48) (= (select ~nodes~0.offset 2) |#funAddr~node3.offset|) (= (select .cse32 1) 0) (= (mod ~r1~0 256) 0) (= |#funAddr~node2.offset| (select ~nodes~0.offset 1)) (< 0 |#StackHeapBarrier|) (= ~send2~0 ~id2~0))) (and (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1470~0) (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0)))) (<= 0 .cse33) (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1470~0) (<= ~st2~0 1) .cse3 (<= .cse34 0) (<= 0 ~mode3~0) (<= ~mode2~0 0) .cse7 (= (* 256 (div ~mode3~0 256)) ~mode3~0) .cse8 (<= ~mode3~0 1) (<= 0 ~p2~0) .cse9 .cse11 (<= ~st1~0 1) (<= 0 .cse35) .cse13 (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) .cse14 (<= .cse35 0) (= ~mode1~0 0) .cse15 (<= ~st3~0 1) .cse16 .cse17 .cse18 (<= ~p2~0 0) (<= 0 ~mode2~0) .cse19 .cse20 .cse21 (<= .cse30 0) (<= |ULTIMATE.start_main_~init__tmp~0#1| 1) (<= ~__return_1470~0 1) .cse22 (<= 0 .cse34) (= (ite .cse31 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) (<= .cse33 0) .cse23 .cse24 .cse25 .cse26 .cse27 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|) .cse28 .cse29)) (and (<= .cse36 ~id3~0) .cse0 .cse2 (<= .cse36 ~send2~0) .cse3 .cse4 .cse5 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse6 1) .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29)))) [2022-11-25 23:37:49,118 INFO L895 garLoopResultBuilder]: At program point L240(lines 181 241) the Hoare annotation is: (let ((.cse57 (+ ~p2_new~0 1)) (.cse54 (+ ~p1_new~0 1)) (.cse53 (+ ~p1_old~0 1)) (.cse55 (+ ~p3_new~0 1)) (.cse58 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse56 (+ ~nomsg~0 1))) (let ((.cse1 (<= .cse56 ~id3~0)) (.cse2 (<= .cse56 ~send3~0)) (.cse3 (= ~mode3~0 1)) (.cse5 (= ~mode2~0 1)) (.cse6 (<= .cse56 ~send2~0)) (.cse13 (<= (+ ~st2~0 ~st1~0) 2147483647)) (.cse44 (<= .cse58 1)) (.cse47 (<= 0 ~p2~0)) (.cse16 (= ~mode1~0 1)) (.cse17 (<= .cse56 ~id2~0)) (.cse49 (<= ~p2~0 0)) (.cse51 (not (< (mod ~r1~0 256) 3))) (.cse37 (not (<= (+ 2147483649 ~st2~0 ~st1~0) 0))) (.cse38 (<= .cse58 2147483647)) (.cse0 (<= |ULTIMATE.start_main_~check__tmp~0#1| 1)) (.cse4 (<= 0 .cse55)) (.cse7 (<= 0 |ULTIMATE.start_main_~check__tmp~0#1|)) (.cse41 (<= 0 .cse53)) (.cse8 (<= 0 ~id1~0)) (.cse9 (<= 0 ~__return_1470~0)) (.cse42 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse10 (= ~p2~0 0)) (.cse11 (<= .cse54 0)) (.cse43 (<= 0 ~mode3~0)) (.cse12 (= .cse58 0)) (.cse14 (<= 0 ~st1~0)) (.cse45 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse15 (<= 0 ~st2~0)) (.cse46 (<= ~mode3~0 1)) (.cse18 (<= ~id1~0 127)) (.cse19 (= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse20 (<= 0 .cse57)) (.cse21 (<= .cse56 0)) (.cse22 (<= ~__return_1394~0 1)) (.cse23 (<= .cse57 0)) (.cse48 (= ~mode1~0 0)) (.cse24 (<= ~id3~0 127)) (.cse25 (= |#NULL.offset| 0)) (.cse26 (<= 0 .cse56)) (.cse50 (<= 0 ~mode2~0)) (.cse27 (<= ~id2~0 127)) (.cse28 (<= 0 ~st3~0)) (.cse29 (<= 1 ~__return_1394~0)) (.cse30 (<= .cse55 0)) (.cse31 (= ~p3~0 0)) (.cse32 (<= 0 .cse54)) (.cse52 (<= .cse53 0)) (.cse33 (= ~p1~0 0)) (.cse34 (<= 0 |#StackHeapBarrier|)) (.cse35 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse36 (= ~__return_main~0 0)) (.cse39 (= |#NULL.base| 0)) (.cse40 (= |ULTIMATE.start_main_~main__i2~0#1| 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) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse41 .cse8 .cse9 .cse42 .cse11 .cse43 (<= ~mode2~0 0) .cse44 .cse14 .cse45 .cse15 .cse46 .cse47 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse48 .cse24 .cse25 .cse26 .cse49 .cse50 .cse27 .cse28 .cse51 .cse29 .cse30 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1) .cse31 .cse32 .cse52 .cse33 .cse34 .cse35 .cse36 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|) .cse39 .cse40) (and .cse1 .cse2 .cse6 .cse42 (= |ULTIMATE.start_main_~check__tmp~0#1| 0) .cse13 .cse14 .cse45 .cse17 .cse21 .cse48 (not (<= (+ 2147483649 ~st3~0 ~st2~0 ~st1~0) 0)) .cse37 .cse38) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 (= ~p3_new~0 ~nomsg~0) .cse13 .cse44 .cse14 .cse15 .cse47 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse49 .cse27 .cse28 .cse51 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse0 (<= 0 ~id3~0) .cse4 .cse7 .cse41 .cse8 .cse9 .cse42 .cse10 .cse11 .cse43 .cse12 (<= ~mode2~0 1) .cse14 .cse45 .cse15 .cse46 (<= 0 ~send2~0) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse48 .cse24 (<= 0 ~id2~0) .cse25 .cse26 .cse50 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse52 (<= 0 ~send3~0) .cse33 .cse34 .cse35 .cse36 .cse39 .cse40)))) [2022-11-25 23:37:49,118 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 393) no Hoare annotation was computed. [2022-11-25 23:37:49,118 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-25 23:37:49,119 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 433) no Hoare annotation was computed. [2022-11-25 23:37:49,119 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-25 23:37:49,119 INFO L895 garLoopResultBuilder]: At program point L324(lines 312 325) the Hoare annotation is: (let ((.cse43 (+ |ULTIMATE.start_main_~node2__m2~0#1| 1)) (.cse46 (+ ~nomsg~0 1)) (.cse47 (+ ~p2_new~0 1)) (.cse8 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse44 (+ ~p1_old~0 1)) (.cse45 (+ ~p3_new~0 1))) (let ((.cse5 (* (div ~r1~0 256) 256)) (.cse0 (<= 0 ~id3~0)) (.cse1 (<= 0 .cse45)) (.cse2 (<= 0 .cse44)) (.cse3 (<= 0 ~id1~0)) (.cse4 (<= 0 ~__return_1470~0)) (.cse41 (= ~p2~0 0)) (.cse6 (<= 0 ~mode3~0)) (.cse42 (<= .cse8 0)) (.cse7 (= ~send2~0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|)) (.cse9 (<= 0 ~st1~0)) (.cse10 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse11 (<= 0 ~st2~0)) (.cse12 (<= ~mode3~0 1)) (.cse13 (<= 0 ~send2~0)) (.cse14 (= ~mode1~0 1)) (.cse15 (<= ~id1~0 127)) (.cse16 (<= 0 .cse47)) (.cse17 (<= .cse46 0)) (.cse18 (<= ~__return_1394~0 1)) (.cse19 (<= .cse47 0)) (.cse20 (<= ~id3~0 127)) (.cse21 (<= 0 ~id2~0)) (.cse22 (= |#NULL.offset| 0)) (.cse23 (<= 0 .cse46)) (.cse24 (<= ~id2~0 127)) (.cse25 (<= 0 ~st3~0)) (.cse26 (<= 1 ~__return_1394~0)) (.cse27 (<= .cse45 0)) (.cse28 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse29 (<= 0 .cse43)) (.cse30 (= ~p3~0 0)) (.cse31 (<= .cse44 0)) (.cse32 (<= 0 ~send3~0)) (.cse33 (= ~p1~0 0)) (.cse34 (<= 0 |#StackHeapBarrier|)) (.cse35 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse36 (<= .cse43 0)) (.cse37 (= ~__return_main~0 0)) (.cse38 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse39 (= |#NULL.base| 0)) (.cse40 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (< (+ .cse5 2) ~r1~0) .cse6 (<= ~mode2~0 0) .cse7 (<= .cse8 1) .cse9 .cse10 .cse11 .cse12 (<= 0 ~p2~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= ~p2~0 0) (<= 0 ~mode2~0) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse0 .cse1 .cse3 .cse4 (= (mod ~mode2~0 256) 0) .cse41 .cse42 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= ~r1~0 .cse5) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (and (= ~mode2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse41 .cse6 .cse42 .cse7 .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)))) [2022-11-25 23:37:49,119 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 382) no Hoare annotation was computed. [2022-11-25 23:37:49,119 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-25 23:37:49,120 INFO L899 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-11-25 23:37:49,120 INFO L899 garLoopResultBuilder]: For program point L226-1(line 226) no Hoare annotation was computed. [2022-11-25 23:37:49,120 INFO L899 garLoopResultBuilder]: For program point L226-2(line 226) no Hoare annotation was computed. [2022-11-25 23:37:49,120 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-11-25 23:37:49,120 INFO L899 garLoopResultBuilder]: For program point L226-3(line 226) no Hoare annotation was computed. [2022-11-25 23:37:49,120 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 428) no Hoare annotation was computed. [2022-11-25 23:37:49,121 INFO L899 garLoopResultBuilder]: For program point L226-4(lines 226 234) no Hoare annotation was computed. [2022-11-25 23:37:49,121 INFO L895 garLoopResultBuilder]: At program point L375(lines 363 376) the Hoare annotation is: (let ((.cse89 (select |#memory_int| 1)) (.cse63 (= |ULTIMATE.start_main_~main__c1~0#1| 0)) (.cse88 (+ ~nomsg~0 1)) (.cse92 (+ ~p2_new~0 1)) (.cse8 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse90 (+ ~p1_new~0 1)) (.cse91 (+ ~p3_new~0 1)) (.cse93 (+ ~p1_old~0 1))) (let ((.cse1 (<= 0 .cse93)) (.cse10 (<= 0 ~st1~0)) (.cse21 (= ~mode1~0 0)) (.cse35 (<= .cse93 0)) (.cse37 (= ~p1~0 0)) (.cse40 (= ~__return_main~0 0)) (.cse0 (<= 0 ~id3~0)) (.cse46 (<= 0 .cse91)) (.cse2 (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1470~0)) (.cse3 (<= 0 ~id1~0)) (.cse48 (<= 0 ~__return_1470~0)) (.cse4 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse5 (<= .cse90 0)) (.cse49 (<= |ULTIMATE.start_main_~main__c1~0#1| 1)) (.cse7 (<= 0 ~mode3~0)) (.cse56 (<= .cse8 0)) (.cse58 (= (mod ~mode1~0 256) 0)) (.cse9 (<= ~mode2~0 1)) (.cse11 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse12 (<= 0 ~st2~0)) (.cse61 (<= ~p1~0 0)) (.cse62 (<= ~__return_main~0 0)) (.cse13 (<= ~mode3~0 1)) (.cse64 (<= 0 ~p2~0)) (.cse14 (<= 0 ~send2~0)) (.cse15 (<= ~id1~0 127)) (.cse16 (<= 0 .cse92)) (.cse69 (<= .cse88 0)) (.cse18 (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|)) (.cse70 (<= ~st2~0 0)) (.cse19 (<= ~__return_1394~0 1)) (.cse20 (<= .cse92 0)) (.cse72 (<= ~r1~0 (* (div ~r1~0 256) 256))) (.cse74 (<= 0 ~__return_main~0)) (.cse22 (<= ~id3~0 127)) (.cse23 (<= 0 ~id2~0)) (.cse24 (= |#NULL.offset| 0)) (.cse25 (<= 0 .cse88)) (.cse78 (<= 0 (+ ~st2~0 ~st1~0))) (.cse79 (<= ~p2~0 0)) (.cse26 (<= 0 ~mode2~0)) (.cse27 (<= ~id2~0 127)) (.cse28 (<= 0 ~st3~0)) (.cse29 (<= 1 ~__return_1394~0)) (.cse30 (<= .cse91 0)) (.cse31 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse81 (<= ~__return_1470~0 1)) (.cse32 (= ~p3~0 0)) (.cse33 (<= 0 .cse90)) (.cse34 (= (ite .cse63 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|)) (.cse36 (<= 0 ~send3~0)) (.cse83 (<= 0 ~p1~0)) (.cse38 (<= 0 |#StackHeapBarrier|)) (.cse85 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse39 (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~0#1|)) (.cse41 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse44 (= ~__return_1470~0 0)) (.cse45 (= (select |#length| 3) 12)) (.cse47 (= (select |#length| 2) 50)) (.cse50 (= (select ~nodes~0.base 0) |#funAddr~node1.base|)) (.cse51 (= 2 (select |#length| 1))) (.cse52 (= ~send3~0 ~id3~0)) (.cse53 (= |#funAddr~node3.base| (select ~nodes~0.base 2))) (.cse54 (= (select |#valid| 3) 1)) (.cse55 (= ~nomsg~0 ~p2_old~0)) (.cse57 (not (= ~id3~0 ~id2~0))) (.cse59 (= |#funAddr~node2.base| (select ~nodes~0.base 1))) (.cse60 (not (= ~id1~0 ~id3~0))) (.cse65 (not (= ~id1~0 ~id2~0))) (.cse66 (= ~nomsg~0 ~p1_old~0)) (.cse67 (= (select ~nodes~0.offset 0) |#funAddr~node1.offset|)) (.cse68 (= (select |#valid| 1) 1)) (.cse71 (= ~send1~0 ~id1~0)) (.cse73 (= (select |#valid| 0) 0)) (.cse75 (= (select |#valid| 2) 1)) (.cse76 (= ~p3_old~0 ~nomsg~0)) (.cse77 (= (select .cse89 0) 48)) (.cse80 (= (select ~nodes~0.offset 2) |#funAddr~node3.offset|)) (.cse82 (= (select .cse89 1) 0)) (.cse84 (= |#funAddr~node2.offset| (select ~nodes~0.offset 1))) (.cse86 (< 0 |#StackHeapBarrier|)) (.cse87 (= ~send2~0 ~id2~0)) (.cse6 (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1470~0)) (.cse17 (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))) (.cse42 (= |#NULL.base| 0)) (.cse43 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p2~0 0) .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~check__tmp~0#1| 1) (= ~p3_new~0 ~nomsg~0) (= .cse8 0) .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 .cse43) (and .cse44 .cse0 .cse45 .cse46 .cse47 .cse3 .cse48 .cse4 .cse5 .cse49 .cse50 .cse51 .cse52 (= ~send1~0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse11 .cse12 .cse61 .cse62 .cse63 .cse64 .cse14 .cse15 .cse65 .cse66 .cse67 .cse68 .cse16 .cse69 .cse70 .cse19 .cse20 .cse71 .cse72 .cse73 .cse74 .cse22 .cse75 .cse23 .cse24 .cse25 .cse76 .cse77 .cse78 .cse79 .cse80 .cse27 .cse28 .cse29 .cse30 .cse31 .cse81 .cse32 .cse33 .cse82 .cse83 .cse84 .cse85 .cse39 .cse41 .cse86 .cse87 .cse42 .cse43) (and (<= .cse88 ~id3~0) .cse46 (<= .cse88 ~send2~0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 (<= ~mode2~0 0) (<= .cse8 1) .cse10 .cse11 .cse12 .cse13 .cse64 .cse15 .cse16 .cse17 .cse69 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse79 .cse26 .cse27 .cse28 (not (< (mod ~r1~0 256) 3)) .cse29 .cse30 .cse31 .cse81 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse85 .cse39 .cse40 .cse41 .cse42 .cse43) (and .cse0 .cse46 .cse2 .cse3 .cse48 .cse4 .cse5 .cse49 .cse7 .cse56 .cse58 .cse9 .cse11 .cse12 .cse61 .cse62 .cse13 .cse64 .cse14 .cse15 .cse16 .cse69 (<= ~mode1~0 1) .cse18 .cse70 .cse19 .cse20 .cse72 .cse74 .cse22 .cse23 .cse24 .cse25 .cse78 .cse79 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse81 .cse32 .cse33 .cse34 .cse36 .cse83 .cse38 .cse85 .cse39 .cse41 (or (and .cse44 .cse45 .cse47 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse57 .cse59 .cse60 .cse63 .cse65 .cse66 .cse67 .cse68 .cse71 .cse73 .cse75 .cse76 .cse77 .cse80 .cse82 .cse84 .cse86 .cse87) (and .cse6 .cse17)) .cse42 .cse43)))) [2022-11-25 23:37:49,121 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 468) no Hoare annotation was computed. [2022-11-25 23:37:49,122 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-11-25 23:37:49,122 INFO L895 garLoopResultBuilder]: At program point L161(lines 161 286) the Hoare annotation is: (let ((.cse51 (+ ~nomsg~0 1)) (.cse56 (+ ~p2_new~0 1)) (.cse54 (+ ~p1_old~0 1)) (.cse55 (+ ~p3_new~0 1)) (.cse57 (+ |ULTIMATE.start_main_~node2__m2~0#1| 1))) (let ((.cse47 (= ~send2~0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|)) (.cse49 (= (let ((.cse58 (mod |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256))) (ite (<= .cse58 127) .cse58 (+ (- 256) .cse58))) ~p2_new~0)) (.cse43 (<= 0 .cse57)) (.cse44 (<= .cse57 0)) (.cse0 (<= 0 ~id3~0)) (.cse1 (<= 0 .cse55)) (.cse2 (<= 0 .cse54)) (.cse3 (<= 0 ~id1~0)) (.cse37 (<= 0 ~__return_1470~0)) (.cse5 (<= ~mode2~0 0)) (.cse6 (<= 0 ~st1~0)) (.cse7 (<= 0 ~st2~0)) (.cse8 (<= 0 ~p2~0)) (.cse9 (<= 0 ~send2~0)) (.cse10 (<= ~id1~0 127)) (.cse11 (<= 0 .cse56)) (.cse12 (<= .cse51 0)) (.cse13 (<= ~__return_1394~0 1)) (.cse14 (<= .cse56 0)) (.cse20 (<= ~p2~0 0)) (.cse24 (<= .cse55 0)) (.cse25 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse27 (<= .cse54 0)) (.cse33 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse50 (+ ~st3~0 ~st2~0 ~st1~0))) (let ((.cse38 (<= .cse50 0)) (.cse36 (= ~mode2~0 1)) (.cse45 (let ((.cse52 (<= 0 ~mode1~0)) (.cse53 (<= ~mode1~0 1))) (or (and .cse0 (<= 1 ~mode2~0) .cse1 .cse52 .cse3 .cse37 (<= ~mode2~0 1) .cse6 .cse7 .cse8 .cse10 .cse12 .cse53 .cse13 (<= 0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) .cse20 .cse24 .cse25 .cse43 .cse44 .cse33) (and .cse0 .cse1 .cse52 .cse2 .cse3 .cse37 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse53 .cse13 .cse14 .cse20 .cse24 .cse25 .cse27 .cse33)))) (.cse42 (* (div ~r1~0 256) 256)) (.cse46 (<= 0 ~mode3~0)) (.cse39 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse48 (<= ~mode3~0 1)) (.cse40 (= ~mode1~0 1)) (.cse41 (or (= ~mode2~0 0) (and .cse47 .cse49))) (.cse15 (<= ~id3~0 127)) (.cse16 (<= 0 ~id2~0)) (.cse17 (= |#NULL.offset| 0)) (.cse18 (<= 0 .cse51)) (.cse19 (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~0#1|)) (.cse21 (<= ~id2~0 127)) (.cse22 (<= 0 ~st3~0)) (.cse23 (<= 1 ~__return_1394~0)) (.cse26 (= ~p3~0 0)) (.cse28 (<= 0 ~send3~0)) (.cse29 (= ~p1~0 0)) (.cse30 (<= 0 |#StackHeapBarrier|)) (.cse31 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse32 (= ~__return_main~0 0)) (.cse34 (= |#NULL.base| 0)) (.cse35 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (let ((.cse4 (+ ~p1_new~0 1))) (and (= ~mode3~0 1) .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1470~0) (<= ~st2~0 1) .cse3 (<= .cse4 0) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1470~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~st1~0 1) .cse11 (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0)) .cse12 (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) .cse13 .cse14 (= ~mode1~0 0) .cse15 (<= ~st3~0 1) .cse16 .cse17 .cse18 .cse19 .cse20 (<= 0 ~mode2~0) .cse21 .cse22 .cse23 .cse24 .cse25 (<= ~__return_1470~0 1) .cse26 (<= 0 .cse4) (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35)) (and .cse0 .cse1 .cse36 .cse3 .cse37 (= ~p2~0 0) .cse38 .cse6 .cse39 .cse7 .cse9 .cse40 .cse10 .cse12 .cse13 .cse41 (<= ~r1~0 .cse42) .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse43 .cse26 .cse28 .cse29 .cse30 .cse31 .cse44 .cse32 .cse33 .cse34 .cse35) (and .cse36 .cse45 .cse46 .cse38 .cse47 .cse39 .cse48 .cse40 .cse15 .cse49 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35) (and .cse36 .cse45 (< (+ .cse42 2) ~r1~0) .cse46 (<= .cse50 1) .cse39 .cse48 .cse40 .cse41 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35))))) [2022-11-25 23:37:49,122 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 330) no Hoare annotation was computed. [2022-11-25 23:37:49,123 INFO L895 garLoopResultBuilder]: At program point L228(lines 183 235) the Hoare annotation is: (let ((.cse51 (+ ~p2_new~0 1)) (.cse49 (+ ~p1_new~0 1)) (.cse50 (+ ~p3_new~0 1)) (.cse48 (+ ~nomsg~0 1)) (.cse52 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse53 (+ ~p1_old~0 1))) (let ((.cse7 (= ~p3_new~0 ~nomsg~0)) (.cse0 (<= 0 ~id3~0)) (.cse1 (<= 0 .cse53)) (.cse6 (<= 0 ~mode3~0)) (.cse41 (<= .cse52 1)) (.cse10 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse12 (<= ~mode3~0 1)) (.cse42 (<= 0 ~p2~0)) (.cse13 (<= 0 ~send2~0)) (.cse19 (= ~mode1~0 0)) (.cse21 (<= 0 ~id2~0)) (.cse44 (<= ~p2~0 0)) (.cse45 (not (< (mod ~r1~0 256) 3))) (.cse30 (<= .cse53 0)) (.cse38 (<= .cse48 ~id3~0)) (.cse39 (= ~mode3~0 1)) (.cse46 (<= 0 .cse50)) (.cse40 (= ~mode2~0 1)) (.cse2 (<= 0 ~id1~0)) (.cse3 (<= 0 ~__return_1470~0)) (.cse4 (= ~p2~0 0)) (.cse5 (<= .cse49 0)) (.cse8 (= .cse52 0)) (.cse9 (<= 0 ~st1~0)) (.cse11 (<= 0 ~st2~0)) (.cse43 (= ~mode1~0 1)) (.cse14 (<= ~id1~0 127)) (.cse15 (= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse16 (<= 0 .cse51)) (.cse47 (<= .cse48 0)) (.cse17 (<= ~__return_1394~0 1)) (.cse18 (<= .cse51 0)) (.cse20 (<= ~id3~0 127)) (.cse22 (= |#NULL.offset| 0)) (.cse23 (<= 0 .cse48)) (.cse24 (<= ~id2~0 127)) (.cse25 (<= 0 ~st3~0)) (.cse26 (<= 1 ~__return_1394~0)) (.cse27 (<= .cse50 0)) (.cse28 (= ~p3~0 0)) (.cse29 (<= 0 .cse49)) (.cse31 (<= 0 ~send3~0)) (.cse32 (= ~p1~0 0)) (.cse33 (<= 0 |#StackHeapBarrier|)) (.cse34 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse35 (= ~__return_main~0 0)) (.cse36 (= |#NULL.base| 0)) (.cse37 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and (= ~mode2~0 0) .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) (and .cse38 .cse39 .cse40 .cse2 .cse3 .cse5 .cse7 .cse41 .cse9 .cse11 .cse42 .cse13 .cse43 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse44 .cse24 .cse25 .cse45 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) (and .cse0 .cse46 .cse1 .cse2 .cse3 .cse5 .cse6 (<= ~mode2~0 0) .cse41 .cse9 .cse10 .cse11 .cse12 .cse42 .cse13 .cse14 .cse16 .cse47 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse44 (<= 0 ~mode2~0) .cse24 .cse25 .cse45 .cse26 .cse27 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|) .cse36 .cse37) (and .cse38 .cse39 .cse46 .cse40 (<= .cse48 ~send2~0) .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse11 .cse43 (<= .cse48 ~id2~0) .cse14 .cse15 .cse16 .cse47 .cse17 .cse18 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37)))) [2022-11-25 23:37:49,123 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 423) no Hoare annotation was computed. [2022-11-25 23:37:49,123 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-11-25 23:37:49,123 INFO L899 garLoopResultBuilder]: For program point L212-1(line 212) no Hoare annotation was computed. [2022-11-25 23:37:49,124 INFO L895 garLoopResultBuilder]: At program point L146(lines 146 331) the Hoare annotation is: (let ((.cse43 (+ ~p3_new~0 1)) (.cse44 (+ ~nomsg~0 1))) (let ((.cse45 (+ ~p2_new~0 1)) (.cse40 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse7 (<= 0 ~send2~0)) (.cse36 (<= .cse44 0)) (.cse0 (<= 0 ~id3~0)) (.cse30 (<= 0 .cse43)) (.cse2 (<= 0 ~id1~0)) (.cse31 (<= 0 ~__return_1470~0)) (.cse5 (<= 0 ~st1~0)) (.cse6 (<= 0 ~st2~0)) (.cse8 (<= ~id1~0 127)) (.cse10 (<= ~__return_1394~0 1))) (let ((.cse3 (= ~p2~0 0)) (.cse37 (* (div ~r1~0 256) 256)) (.cse1 (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~0#1|)) (.cse38 (let ((.cse46 (<= 0 ~mode1~0)) (.cse48 (<= 0 ~p2~0)) (.cse49 (<= ~mode1~0 1)) (.cse50 (<= ~p2~0 0))) (or (let ((.cse47 (+ ~p1_old~0 1))) (and .cse0 .cse30 .cse46 (<= 0 .cse47) .cse2 .cse31 (<= ~mode2~0 0) .cse5 .cse6 .cse48 .cse7 .cse8 .cse36 .cse49 .cse10 .cse50 (<= .cse47 0))) (and .cse0 (<= 1 ~mode2~0) .cse30 .cse46 .cse2 .cse31 (<= ~mode2~0 1) .cse5 .cse6 .cse48 .cse8 .cse49 .cse10 (<= 0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) .cse50 (<= (+ |ULTIMATE.start_main_~node2__m2~0#1| 1) 0))))) (.cse32 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse39 (<= 0 ~mode3~0)) (.cse33 (<= .cse40 0)) (.cse34 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse41 (<= ~mode3~0 1)) (.cse35 (= ~mode1~0 1)) (.cse9 (<= 0 .cse45)) (.cse11 (<= .cse45 0)) (.cse12 (<= ~id3~0 127)) (.cse13 (<= 0 ~id2~0)) (.cse14 (= |#NULL.offset| 0)) (.cse15 (<= 0 .cse44)) (.cse42 (<= 0 ~mode2~0)) (.cse16 (<= ~id2~0 127)) (.cse17 (<= 0 ~st3~0)) (.cse18 (<= 1 ~__return_1394~0)) (.cse19 (<= .cse43 0)) (.cse20 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse21 (= ~p3~0 0)) (.cse22 (<= 0 ~send3~0)) (.cse23 (= ~p1~0 0)) (.cse24 (<= 0 |#StackHeapBarrier|)) (.cse25 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse26 (= ~__return_main~0 0)) (.cse27 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse28 (= |#NULL.base| 0)) (.cse29 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (let ((.cse4 (+ ~p1_new~0 1))) (and (= ~mode3~0 1) .cse0 (= ~mode2~0 1) .cse1 (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1470~0) (<= ~st2~0 1) .cse2 .cse3 (<= .cse4 0) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1470~0) (= ~p3_new~0 ~nomsg~0) .cse5 .cse6 .cse7 .cse8 (<= ~st1~0 1) .cse9 (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0)) (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) .cse10 .cse11 (= ~mode1~0 0) .cse12 (<= ~st3~0 1) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= ~__return_1470~0 1) .cse21 (<= 0 .cse4) (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29)) (and .cse0 .cse30 .cse1 .cse2 .cse31 .cse32 .cse3 .cse33 .cse5 .cse34 .cse6 .cse7 .cse35 .cse8 .cse9 .cse36 .cse10 .cse11 (<= ~r1~0 .cse37) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse1 .cse38 .cse32 (< (+ .cse37 2) ~r1~0) .cse39 (<= .cse40 1) .cse34 .cse41 .cse35 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse42 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse1 .cse38 .cse32 .cse39 .cse33 .cse34 .cse41 .cse35 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse42 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29))))) [2022-11-25 23:37:49,124 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2022-11-25 23:37:49,124 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 388) no Hoare annotation was computed. [2022-11-25 23:37:49,124 INFO L899 garLoopResultBuilder]: For program point L212-3(line 212) no Hoare annotation was computed. [2022-11-25 23:37:49,125 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 463) no Hoare annotation was computed. [2022-11-25 23:37:49,125 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-25 23:37:49,125 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 381) no Hoare annotation was computed. [2022-11-25 23:37:49,125 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 325) no Hoare annotation was computed. [2022-11-25 23:37:49,126 INFO L895 garLoopResultBuilder]: At program point L279(lines 267 280) the Hoare annotation is: (let ((.cse51 (+ ~p3_new~0 1)) (.cse52 (+ |ULTIMATE.start_main_~node2__m2~0#1| 1))) (let ((.cse4 (= ~send2~0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|)) (.cse9 (= (let ((.cse53 (mod |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256))) (ite (<= .cse53 127) .cse53 (+ (- 256) .cse53))) ~p2_new~0)) (.cse38 (<= 0 .cse52)) (.cse39 (<= .cse52 0)) (.cse26 (<= 0 ~id3~0)) (.cse27 (<= 0 ~id1~0)) (.cse28 (<= 0 ~__return_1470~0)) (.cse29 (<= 0 ~st1~0)) (.cse30 (<= 0 ~st2~0)) (.cse31 (<= 0 ~send2~0)) (.cse32 (<= ~id1~0 127)) (.cse33 (<= ~__return_1394~0 1)) (.cse36 (<= .cse51 0)) (.cse37 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse40 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse42 (+ ~nomsg~0 1)) (.cse41 (+ ~st3~0 ~st2~0 ~st1~0))) (let ((.cse3 (<= .cse41 0)) (.cse0 (= ~mode2~0 1)) (.cse1 (let ((.cse43 (<= 0 .cse51)) (.cse44 (<= 0 ~mode1~0)) (.cse45 (<= 0 ~p2~0)) (.cse46 (<= .cse42 0)) (.cse47 (<= ~mode1~0 1)) (.cse48 (<= ~p2~0 0))) (or (and .cse26 (<= 1 ~mode2~0) .cse43 .cse44 .cse27 .cse28 (<= ~mode2~0 1) .cse29 .cse30 .cse45 .cse32 .cse46 .cse47 .cse33 (<= 0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) .cse48 .cse36 .cse37 .cse38 .cse39 .cse40) (let ((.cse50 (+ ~p2_new~0 1)) (.cse49 (+ ~p1_old~0 1))) (and .cse26 .cse43 .cse44 (<= 0 .cse49) .cse27 .cse28 (<= ~mode2~0 0) .cse29 .cse30 .cse45 .cse31 .cse32 (<= 0 .cse50) .cse46 .cse47 .cse33 (<= .cse50 0) .cse48 .cse36 .cse37 (<= .cse49 0) .cse40))))) (.cse35 (* (div ~r1~0 256) 256)) (.cse2 (<= 0 ~mode3~0)) (.cse5 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse6 (<= ~mode3~0 1)) (.cse7 (= ~mode1~0 1)) (.cse34 (or (= ~mode2~0 0) (and .cse4 .cse9))) (.cse8 (<= ~id3~0 127)) (.cse10 (<= 0 ~id2~0)) (.cse11 (= |#NULL.offset| 0)) (.cse12 (<= 0 .cse42)) (.cse13 (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~0#1|)) (.cse14 (= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| ~send3~0)) (.cse15 (<= ~id2~0 127)) (.cse16 (<= 0 ~st3~0)) (.cse17 (<= 1 ~__return_1394~0)) (.cse18 (= ~p3~0 0)) (.cse19 (<= 0 ~send3~0)) (.cse20 (= ~p1~0 0)) (.cse21 (<= 0 |#StackHeapBarrier|)) (.cse22 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse23 (= ~__return_main~0 0)) (.cse24 (= |#NULL.base| 0)) (.cse25 (= |ULTIMATE.start_main_~main__i2~0#1| 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) (and .cse26 .cse0 .cse27 .cse28 (= ~p2~0 0) (= ~p3_new~0 ~nomsg~0) .cse3 .cse29 .cse5 .cse30 .cse31 .cse7 .cse32 .cse33 .cse34 (<= ~r1~0 .cse35) .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse36 .cse37 .cse38 .cse18 .cse19 .cse20 .cse21 .cse22 .cse39 .cse23 .cse40 .cse24 .cse25) (and .cse0 .cse1 (< (+ .cse35 2) ~r1~0) .cse2 (<= .cse41 1) .cse5 .cse6 .cse7 .cse34 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25))))) [2022-11-25 23:37:49,126 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-25 23:37:49,126 INFO L895 garLoopResultBuilder]: At program point L329(lines 310 330) the Hoare annotation is: false [2022-11-25 23:37:49,126 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 418) no Hoare annotation was computed. [2022-11-25 23:37:49,126 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-25 23:37:49,126 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2022-11-25 23:37:49,127 INFO L899 garLoopResultBuilder]: For program point L181-1(line 181) no Hoare annotation was computed. [2022-11-25 23:37:49,127 INFO L899 garLoopResultBuilder]: For program point L181-2(line 181) no Hoare annotation was computed. [2022-11-25 23:37:49,127 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 458) no Hoare annotation was computed. [2022-11-25 23:37:49,127 INFO L899 garLoopResultBuilder]: For program point L181-3(line 181) no Hoare annotation was computed. [2022-11-25 23:37:49,127 INFO L899 garLoopResultBuilder]: For program point L181-4(lines 181 241) no Hoare annotation was computed. [2022-11-25 23:37:49,127 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 376) no Hoare annotation was computed. [2022-11-25 23:37:49,128 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) (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1470~0) (not (= 255 (mod ~r1~0 256))) (<= 0 ~id1~0) (<= .cse0 0) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1470~0) (= ~p3_new~0 ~nomsg~0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 1) (<= 0 ~st1~0) (<= 0 ~st2~0) (<= 0 ~p2~0) (<= 0 ~send2~0) (= ~mode1~0 1) (<= ~id1~0 127) (= |ULTIMATE.start_main_~init__tmp~0#1| 1) (<= 0 .cse1) (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0)) (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) (<= ~__return_1394~0 1) (<= .cse1 0) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= ~p2~0 0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= 1 ~__return_1394~0) (<= (+ ~p3_new~0 1) 0) (<= ~__return_1470~0 1) (= ~p3~0 0) (<= 0 .cse0) (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) (<= 0 ~send3~0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~main__c1~0#1|) (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~0#1|) (= ~__return_main~0 0) (= |#NULL.base| 0) (= |ULTIMATE.start_main_~main__i2~0#1| 0))) [2022-11-25 23:37:49,128 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-25 23:37:49,129 INFO L895 garLoopResultBuilder]: At program point L380(lines 361 381) the Hoare annotation is: (let ((.cse42 (= |ULTIMATE.start_main_~main__c1~0#1| 0)) (.cse51 (+ ~nomsg~0 1)) (.cse55 (+ ~p2_new~0 1)) (.cse53 (+ ~p1_new~0 1)) (.cse52 (+ ~p1_old~0 1)) (.cse54 (+ ~p3_new~0 1))) (let ((.cse0 (<= 0 ~id3~0)) (.cse4 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse8 (<= ~mode2~0 1)) (.cse14 (<= 0 ~send2~0)) (.cse16 (= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse1 (<= 0 .cse54)) (.cse48 (<= 0 .cse52)) (.cse2 (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1470~0)) (.cse3 (<= 0 ~id1~0)) (.cse5 (<= .cse53 0)) (.cse44 (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1470~0)) (.cse6 (<= 0 ~mode3~0)) (.cse7 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse9 (<= 0 ~st1~0)) (.cse10 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse11 (<= 0 ~st2~0)) (.cse12 (<= ~mode3~0 1)) (.cse13 (<= 0 ~p2~0)) (.cse15 (<= ~id1~0 127)) (.cse17 (<= 0 .cse55)) (.cse45 (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))) (.cse18 (<= .cse51 0)) (.cse19 (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|)) (.cse20 (<= ~__return_1394~0 1)) (.cse21 (<= .cse55 0)) (.cse49 (= ~mode1~0 0)) (.cse22 (<= ~id3~0 127)) (.cse23 (<= 0 ~id2~0)) (.cse24 (= |#NULL.offset| 0)) (.cse25 (<= 0 .cse51)) (.cse26 (<= ~p2~0 0)) (.cse27 (<= 0 ~mode2~0)) (.cse28 (<= ~id2~0 127)) (.cse29 (<= 0 ~st3~0)) (.cse30 (<= 1 ~__return_1394~0)) (.cse31 (<= .cse54 0)) (.cse32 (<= ~__return_1470~0 1)) (.cse33 (= ~p3~0 0)) (.cse34 (<= 0 .cse53)) (.cse35 (= (ite .cse42 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|)) (.cse50 (<= .cse52 0)) (.cse36 (<= 0 ~send3~0)) (.cse37 (= ~p1~0 0)) (.cse38 (<= 0 |#StackHeapBarrier|)) (.cse39 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse40 (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~0#1|)) (.cse41 (= ~__return_main~0 0)) (.cse46 (= |#NULL.base| 0)) (.cse47 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse7 0) (= (mod ~mode1~0 256) 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= ~mode1~0 1) .cse19 .cse20 .cse21 (<= ~r1~0 (* (div ~r1~0 256) 256)) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (or (let ((.cse43 (select |#memory_int| 1))) (and (= ~__return_1470~0 0) (= (select |#length| 3) 12) (= (select |#length| 2) 50) (= (select ~nodes~0.base 0) |#funAddr~node1.base|) (= 2 (select |#length| 1)) (= ~send3~0 ~id3~0) (= |#funAddr~node3.base| (select ~nodes~0.base 2)) (= (select |#valid| 3) 1) (= ~nomsg~0 ~p2_old~0) (not (= ~id3~0 ~id2~0)) (= |#funAddr~node2.base| (select ~nodes~0.base 1)) (not (= ~id1~0 ~id3~0)) .cse42 (not (= ~id1~0 ~id2~0)) (= ~nomsg~0 ~p1_old~0) (= (select ~nodes~0.offset 0) |#funAddr~node1.offset|) (= (select |#valid| 1) 1) (= ~send1~0 ~id1~0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= ~p3_old~0 ~nomsg~0) (= (select .cse43 0) 48) (= (select ~nodes~0.offset 2) |#funAddr~node3.offset|) (= (select .cse43 1) 0) (= |#funAddr~node2.offset| (select ~nodes~0.offset 1)) (< 0 |#StackHeapBarrier|) (= ~send2~0 ~id2~0))) (and .cse44 .cse45)) .cse46 .cse47) (and .cse0 .cse48 .cse2 .cse3 .cse4 (= ~p2~0 0) .cse5 .cse44 .cse6 (= ~p3_new~0 ~nomsg~0) (= .cse7 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse45 .cse19 .cse20 .cse21 .cse49 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse50 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse46 .cse47) (and (<= .cse51 ~id3~0) .cse1 (<= .cse51 ~send2~0) .cse48 .cse2 .cse3 .cse5 .cse44 .cse6 (<= ~mode2~0 0) (<= .cse7 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse45 .cse18 .cse19 .cse20 .cse21 .cse49 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (not (< (mod ~r1~0 256) 3)) .cse30 .cse31 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1) .cse32 .cse33 .cse34 .cse35 .cse50 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|) .cse46 .cse47)))) [2022-11-25 23:37:49,129 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 285) no Hoare annotation was computed. [2022-11-25 23:37:49,129 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-11-25 23:37:49,129 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 413) no Hoare annotation was computed. [2022-11-25 23:37:49,130 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 235) no Hoare annotation was computed. [2022-11-25 23:37:49,130 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 453) no Hoare annotation was computed. [2022-11-25 23:37:49,133 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, 1, 1] [2022-11-25 23:37:49,136 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:37:49,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,186 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,186 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,187 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,187 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,187 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,188 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,188 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,188 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,189 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,189 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,189 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,194 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,194 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,194 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,194 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,195 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,195 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,195 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,210 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,211 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,211 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,212 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,212 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,213 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,213 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,213 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,214 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,214 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,215 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,215 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,220 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,220 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,221 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,221 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,221 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,222 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,229 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,230 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,230 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,231 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,231 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,232 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,232 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,232 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,234 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,234 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,234 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,235 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,235 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,235 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,235 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,236 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,236 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,236 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,236 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,237 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,237 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,239 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,251 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,252 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,252 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,252 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,253 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,253 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,253 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,253 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,254 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,254 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,254 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,254 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:37:49 BoogieIcfgContainer [2022-11-25 23:37:49,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:37:49,264 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:37:49,264 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:37:49,264 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:37:49,265 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:35:12" (3/4) ... [2022-11-25 23:37:49,268 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 23:37:49,279 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-25 23:37:49,283 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-25 23:37:49,283 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 23:37:49,284 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:37:49,320 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && mode3 == 1) && mode2 == 1) && check__tmp == __return_1470) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 == __return_1470) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && 1 <= __return_1394) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && st3 + st2 + st1 <= 2147483647) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && mode3 == 1) && 0 <= p3_new + 1) && mode2 == 1) && check__tmp == __return_1470) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && main__c1 == __return_1470) && st3 + st2 + st1 == 0) && 0 <= st1) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && st3 + st2 + st1 <= 2147483647) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && (((((0 <= mode3 && mode2 <= 1) && mode3 <= 1) && mode1 <= 1) && 0 <= mode2) || main__c1 <= 0)) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && 256 * (mode1 / 256) == mode1) && st3 + st2 + st1 <= 0) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && st2 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= st2 + st1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (((((((((((((((((((((((((((__return_1470 == 0 && unknown-#length-unknown[3] == 12) && unknown-#length-unknown[2] == 50) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) || ((((check__tmp == __return_1470 && main__c1 == __return_1470) && !(assert__arg % 256 == 0)) && assert__arg == __tmp_1) && (if main__c1 == 0 then 0 else 1) == __tmp_1))) && 0 <= send3) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= p1_\old + 1) && check__tmp == __return_1470) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p2 == 0) && p1_new + 1 <= 0) && main__c1 == __return_1470) && 0 <= mode3) && st3 + st2 + st1 == 0) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && 0 <= p3_new + 1) && nomsg + 1 <= send2) && 0 <= p1_\old + 1) && check__tmp == __return_1470) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 == __return_1470) && 0 <= mode3) && mode2 <= 0) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && id1 <= 127) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) [2022-11-25 23:37:49,321 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && check__tmp == __return_1470) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && 0 <= mode3) && st3 + st2 + st1 <= 0) && mode1 % 256 == 0) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && mode1 <= 1) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && nomsg == node1__m1) && __return_main == 0) && (((((((((((((((((((((((((((__return_1470 == 0 && unknown-#length-unknown[3] == 12) && unknown-#length-unknown[2] == 50) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) || (main__c1 == __return_1470 && !(assert__arg % 256 == 0)))) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p1_\old + 1) && check__tmp == __return_1470) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p2 == 0) && p1_new + 1 <= 0) && main__c1 == __return_1470) && 0 <= mode3) && p3_new == nomsg) && st3 + st2 + st1 == 0) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && nomsg == node1__m1) && __return_main == 0) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && 0 <= p3_new + 1) && nomsg + 1 <= send2) && 0 <= p1_\old + 1) && check__tmp == __return_1470) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 == __return_1470) && 0 <= mode3) && mode2 <= 0) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && id1 <= 127) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && nomsg == node1__m1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) [2022-11-25 23:37:49,321 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p1_\old + 1) && check__tmp == __return_1470) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p2 == 0) && p1_new + 1 <= 0) && main__c1 == __return_1470) && 0 <= mode3) && check__tmp == 1) && p3_new == nomsg) && st3 + st2 + st1 == 0) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && nomsg == node1__m1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((__return_1470 == 0 && 0 <= id3) && unknown-#length-unknown[3] == 12) && 0 <= p3_new + 1) && unknown-#length-unknown[2] == 50) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && main__c1 <= 1) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && send1 == node1____CPAchecker_TMP_0) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && nomsg == p2_\old) && st3 + st2 + st1 <= 0) && !(id3 == id2)) && mode1 % 256 == 0) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && main__c1 == 0) && 0 <= p2) && 0 <= send2) && id1 <= 127) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && st2 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && send1 == id1) && r1 <= r1 / 256 * 256) && \valid[0] == 0) && 0 <= __return_main) && id3 <= 127) && \valid[2] == 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && 0 <= st2 + st1) && p2 <= 0) && nodes[2] == #funAddr~node3.offset) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && unknown-#memory_int-unknown[1][1] == 0) && 0 <= p1) && #funAddr~node2.offset == nodes[1]) && 0 <= main__c1) && nomsg == node1__m1) && 1 <= init__tmp) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && 0 <= p3_new + 1) && nomsg + 1 <= send2) && 0 <= p1_\old + 1) && check__tmp == __return_1470) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 == __return_1470) && 0 <= mode3) && mode2 <= 0) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && id1 <= 127) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && nomsg == node1__m1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && check__tmp == __return_1470) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && main__c1 <= 1) && 0 <= mode3) && st3 + st2 + st1 <= 0) && mode1 % 256 == 0) && mode2 <= 1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && mode1 <= 1) && assert__arg == __tmp_1) && st2 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= st2 + st1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && nomsg == node1__m1) && 1 <= init__tmp) && (((((((((((((((((((((((((((__return_1470 == 0 && unknown-#length-unknown[3] == 12) && unknown-#length-unknown[2] == 50) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) || (main__c1 == __return_1470 && !(assert__arg % 256 == 0)))) && #NULL == 0) && main__i2 == 0) [2022-11-25 23:37:49,322 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((256 * (mode2 / 256) == mode2 && 0 <= mode3) && st3 + st2 + st1 <= 0) && ((((((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && 0 <= node2__m2 + 1) && node2__m2 + 1 <= 0) || ((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2 <= 0) && p1_\old + 1 <= 0))) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((256 * (mode2 / 256) == mode2 && r1 / 256 * 256 + 2 < r1) && 0 <= mode3) && st3 + st2 + st1 <= 1) && ((((((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && 0 <= node2__m2 + 1) && node2__m2 + 1 <= 0) || ((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2 <= 0) && p1_\old + 1 <= 0))) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p2 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && check__tmp == __return_1470) && st2 <= 1) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && main__c1 == __return_1470) && p3_new == nomsg) && 0 <= st1) && 0 <= st2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && init__tmp == 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) [2022-11-25 23:37:49,322 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && nomsg == node2__m2) && check__tmp == __return_1470) && st2 <= 1) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && main__c1 == __return_1470) && p3_new == nomsg) && 0 <= st1) && 0 <= st2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && nomsg == node2__m2) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p2 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((nomsg == node2__m2 && (((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2 <= 0) && p1_\old + 1 <= 0) || (((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && node2__m2 + 1 <= 0))) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && 0 <= mode3) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((((((nomsg == node2__m2 && (((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2 <= 0) && p1_\old + 1 <= 0) || (((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && node2__m2 + 1 <= 0))) && 256 * (mode2 / 256) == mode2) && 0 <= mode3) && st3 + st2 + st1 <= 0) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) [2022-11-25 23:37:49,323 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && r1 / 256 * 256 + 2 < r1) && 0 <= mode3) && mode2 <= 0) && send2 == node2____CPAchecker_TMP_0) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && p3 == 0) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && node2__m2 + 1 <= 0) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 % 256 == 0) && p2 == 0) && st3 + st2 + st1 <= 0) && send2 == node2____CPAchecker_TMP_0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && node2__m2 + 1 <= 0) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((mode2 == 0 && 0 <= id3) && 0 <= p3_new + 1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && p2 == 0) && 0 <= mode3) && st3 + st2 + st1 <= 0) && send2 == node2____CPAchecker_TMP_0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && p3 == 0) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && node2__m2 + 1 <= 0) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) [2022-11-25 23:37:49,323 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((mode2 == 1 && (((((((((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && node2__m2 + 1 <= 0) && 1 <= init__tmp) || (((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && p1_\old + 1 <= 0) && 1 <= init__tmp))) && r1 / 256 * 256 + 2 < r1) && 0 <= mode3) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && (mode2 == 0 || (send2 == node2____CPAchecker_TMP_0 && (if node2____CPAchecker_TMP_0 % 256 <= 127 then node2____CPAchecker_TMP_0 % 256 else -256 + node2____CPAchecker_TMP_0 % 256) == p2_new))) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((mode2 == 1 && (((((((((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && node2__m2 + 1 <= 0) && 1 <= init__tmp) || (((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && p1_\old + 1 <= 0) && 1 <= init__tmp))) && 0 <= mode3) && st3 + st2 + st1 <= 0) && send2 == node2____CPAchecker_TMP_0) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && id3 <= 127) && (if node2____CPAchecker_TMP_0 % 256 <= 127 then node2____CPAchecker_TMP_0 % 256 else -256 + node2____CPAchecker_TMP_0 % 256) == p2_new) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && 0 <= p3_new + 1) && 0 <= p1_\old + 1) && check__tmp == __return_1470) && st2 <= 1) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 == __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && mode2 == 1) && 0 <= id1) && 0 <= __return_1470) && p2 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg + 1 <= 0) && __return_1394 <= 1) && (mode2 == 0 || (send2 == node2____CPAchecker_TMP_0 && (if node2____CPAchecker_TMP_0 % 256 <= 127 then node2____CPAchecker_TMP_0 % 256 else -256 + node2____CPAchecker_TMP_0 % 256) == p2_new))) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && node2__m2 + 1 <= 0) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) [2022-11-25 23:37:49,324 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && 0 <= p3_new + 1) && 0 <= p1_\old + 1) && check__tmp == __return_1470) && st2 <= 1) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 == __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && mode2 == 1) && 0 <= id1) && 0 <= __return_1470) && p2 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg + 1 <= 0) && __return_1394 <= 1) && (mode2 == 0 || (send2 == node2____CPAchecker_TMP_0 && (if node2____CPAchecker_TMP_0 % 256 <= 127 then node2____CPAchecker_TMP_0 % 256 else -256 + node2____CPAchecker_TMP_0 % 256) == p2_new))) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && node2__m2 + 1 <= 0) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((mode2 == 1 && (((((((((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && node2__m2 + 1 <= 0) && 1 <= init__tmp) || (((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && p1_\old + 1 <= 0) && 1 <= init__tmp))) && 0 <= mode3) && st3 + st2 + st1 <= 0) && send2 == node2____CPAchecker_TMP_0) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && id3 <= 127) && (if node2____CPAchecker_TMP_0 % 256 <= 127 then node2____CPAchecker_TMP_0 % 256 else -256 + node2____CPAchecker_TMP_0 % 256) == p2_new) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((mode2 == 1 && (((((((((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && node2__m2 + 1 <= 0) && 1 <= init__tmp) || (((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && p1_\old + 1 <= 0) && 1 <= init__tmp))) && r1 / 256 * 256 + 2 < r1) && 0 <= mode3) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && (mode2 == 0 || (send2 == node2____CPAchecker_TMP_0 && (if node2____CPAchecker_TMP_0 % 256 <= 127 then node2____CPAchecker_TMP_0 % 256 else -256 + node2____CPAchecker_TMP_0 % 256) == p2_new))) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) [2022-11-25 23:37:49,324 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((mode2 == 1 && (((((((((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && node2__m2 + 1 <= 0) && 1 <= init__tmp) || (((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && p1_\old + 1 <= 0) && 1 <= init__tmp))) && 0 <= mode3) && st3 + st2 + st1 <= 0) && send2 == node2____CPAchecker_TMP_0) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && id3 <= 127) && (if node2____CPAchecker_TMP_0 % 256 <= 127 then node2____CPAchecker_TMP_0 % 256 else -256 + node2____CPAchecker_TMP_0 % 256) == p2_new) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && node3____CPAchecker_TMP_0 == send3) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((((((((((((((((0 <= id3 && mode2 == 1) && 0 <= id1) && 0 <= __return_1470) && p2 == 0) && p3_new == nomsg) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && __return_1394 <= 1) && (mode2 == 0 || (send2 == node2____CPAchecker_TMP_0 && (if node2____CPAchecker_TMP_0 % 256 <= 127 then node2____CPAchecker_TMP_0 % 256 else -256 + node2____CPAchecker_TMP_0 % 256) == p2_new))) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && node3____CPAchecker_TMP_0 == send3) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && node2__m2 + 1 <= 0) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((mode2 == 1 && (((((((((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && node2__m2 + 1 <= 0) && 1 <= init__tmp) || (((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && p1_\old + 1 <= 0) && 1 <= init__tmp))) && r1 / 256 * 256 + 2 < r1) && 0 <= mode3) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && (mode2 == 0 || (send2 == node2____CPAchecker_TMP_0 && (if node2____CPAchecker_TMP_0 % 256 <= 127 then node2____CPAchecker_TMP_0 % 256 else -256 + node2____CPAchecker_TMP_0 % 256) == p2_new))) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && node3____CPAchecker_TMP_0 == send3) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) [2022-11-25 23:37:49,324 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && 0 <= id1) && 0 <= __return_1470) && p2 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && init__tmp == 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && ((((((((((((((((((((((((((((((__return_1470 == 0 && unknown-#length-unknown[3] == 12) && unknown-#length-unknown[2] == 50) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && st3 == 0) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && st1 == 0) && !(id1 == id2)) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && st2 == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && r1 % 256 == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) || (main__c1 == __return_1470 && !(assert__arg % 256 == 0)))) && 0 <= p1_\old + 1) && check__tmp == __return_1470) && st2 <= 1) && 0 <= id1) && p1_new + 1 <= 0) && 0 <= mode3) && mode2 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((((((((nomsg + 1 <= id3 && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && 0 <= __return_1470) && p2 == 0) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 0 <= st1) && 0 <= st2) && mode1 == 1) && id1 <= 127) && init__tmp == 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) [2022-11-25 23:37:49,325 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((mode2 == 0 && 0 <= id3) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && p2 == 0) && p1_new + 1 <= 0) && 0 <= mode3) && p3_new == nomsg) && st3 + st2 + st1 == 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && mode3 == 1) && mode2 == 1) && 0 <= id1) && 0 <= __return_1470) && p1_new + 1 <= 0) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && 1 <= __return_1394) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && p1_new + 1 <= 0) && 0 <= mode3) && mode2 <= 0) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && mode3 == 1) && 0 <= p3_new + 1) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && 0 <= __return_1470) && p2 == 0) && p1_new + 1 <= 0) && st3 + st2 + st1 == 0) && 0 <= st1) && 0 <= st2) && mode1 == 1) && nomsg + 1 <= id2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) [2022-11-25 23:37:49,325 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && nomsg + 1 <= id3) && nomsg + 1 <= send3) && mode3 == 1) && 0 <= p3_new + 1) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= check__tmp) && 0 <= id1) && 0 <= __return_1470) && p2 == 0) && p1_new + 1 <= 0) && st3 + st2 + st1 == 0) && st2 + st1 <= 2147483647) && 0 <= st1) && 0 <= st2) && mode1 == 1) && nomsg + 1 <= id2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && !(2147483649 + st2 + st1 <= 0)) && st3 + st2 + st1 <= 2147483647) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && nomsg + 1 <= id3) && nomsg + 1 <= send3) && 0 <= p3_new + 1) && nomsg + 1 <= send2) && 0 <= check__tmp) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && 0 <= mode3) && mode2 <= 0) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && nomsg + 1 <= id2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && p1_\old + 1 <= 0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 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)) || (((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && nomsg + 1 <= id3) && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= check__tmp) && 0 <= id1) && 0 <= __return_1470) && p1_new + 1 <= 0) && p3_new == nomsg) && st2 + st1 <= 2147483647) && st3 + st2 + st1 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && mode1 == 1) && nomsg + 1 <= id2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && 1 <= __return_1394) && p3 == 0) && 0 <= p1_new + 1) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && !(2147483649 + st2 + st1 <= 0)) && st3 + st2 + st1 <= 2147483647) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && 0 <= id3) && 0 <= p3_new + 1) && 0 <= check__tmp) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p2 == 0) && p1_new + 1 <= 0) && 0 <= mode3) && st3 + st2 + st1 == 0) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) [2022-11-25 23:37:49,369 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:37:49,370 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:37:49,370 INFO L158 Benchmark]: Toolchain (without parser) took 157868.28ms. Allocated memory was 155.2MB in the beginning and 866.1MB in the end (delta: 710.9MB). Free memory was 107.5MB in the beginning and 500.5MB in the end (delta: -393.0MB). Peak memory consumption was 318.3MB. Max. memory is 16.1GB. [2022-11-25 23:37:49,371 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 155.2MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:37:49,371 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.10ms. Allocated memory is still 155.2MB. Free memory was 107.5MB in the beginning and 93.4MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 23:37:49,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.04ms. Allocated memory is still 155.2MB. Free memory was 93.4MB in the beginning and 91.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:37:49,373 INFO L158 Benchmark]: Boogie Preprocessor took 25.07ms. Allocated memory is still 155.2MB. Free memory was 91.3MB in the beginning and 89.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:37:49,375 INFO L158 Benchmark]: RCFGBuilder took 831.62ms. Allocated memory was 155.2MB in the beginning and 199.2MB in the end (delta: 44.0MB). Free memory was 89.6MB in the beginning and 158.5MB in the end (delta: -69.0MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2022-11-25 23:37:49,376 INFO L158 Benchmark]: TraceAbstraction took 156530.01ms. Allocated memory was 199.2MB in the beginning and 866.1MB in the end (delta: 666.9MB). Free memory was 157.4MB in the beginning and 506.8MB in the end (delta: -349.4MB). Peak memory consumption was 519.7MB. Max. memory is 16.1GB. [2022-11-25 23:37:49,380 INFO L158 Benchmark]: Witness Printer took 106.24ms. Allocated memory is still 866.1MB. Free memory was 506.8MB in the beginning and 500.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-25 23:37:49,382 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.26ms. Allocated memory is still 155.2MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.10ms. Allocated memory is still 155.2MB. Free memory was 107.5MB in the beginning and 93.4MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.04ms. Allocated memory is still 155.2MB. Free memory was 93.4MB in the beginning and 91.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.07ms. Allocated memory is still 155.2MB. Free memory was 91.3MB in the beginning and 89.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 831.62ms. Allocated memory was 155.2MB in the beginning and 199.2MB in the end (delta: 44.0MB). Free memory was 89.6MB in the beginning and 158.5MB in the end (delta: -69.0MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * TraceAbstraction took 156530.01ms. Allocated memory was 199.2MB in the beginning and 866.1MB in the end (delta: 666.9MB). Free memory was 157.4MB in the beginning and 506.8MB in the end (delta: -349.4MB). Peak memory consumption was 519.7MB. Max. memory is 16.1GB. * Witness Printer took 106.24ms. Allocated memory is still 866.1MB. Free memory was 506.8MB in the beginning and 500.5MB in the end (delta: 6.3MB). 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 - 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 - 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: 156.3s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 54.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 32.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2283 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2283 mSDsluCounter, 3312 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1655 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4304 IncrementalHoareTripleChecker+Invalid, 4487 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 1657 mSDtfsCounter, 4304 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 779 GetRequests, 501 SyntacticMatches, 28 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8300 ImplicationChecksByTransitivity, 81.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1306occurred in iteration=13, InterpolantAutomatonStates: 228, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 515 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 102 NumberOfFragments, 9167 HoareAnnotationTreeSize, 17 FomulaSimplifications, 39980 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 17 FomulaSimplificationsInter, 32417 FormulaSimplificationTreeSizeReductionInter, 31.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 1779 NumberOfCodeBlocks, 1779 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1917 ConstructedInterpolants, 0 QuantifiedInterpolants, 11042 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1030 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 29 InterpolantComputations, 22 PerfectInterpolantSequences, 602/890 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: 21.8s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 191, DAG_INTERPRETER_EARLY_EXITS: 3, TOOLS_POST_APPLICATIONS: 762, TOOLS_POST_TIME: 17.7s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 758, TOOLS_QUANTIFIERELIM_TIME: 17.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.5s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 914, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 102, DOMAIN_JOIN_TIME: 2.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 10, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 18, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 191, DOMAIN_ISBOTTOM_TIME: 0.4s, LOOP_SUMMARIZER_APPLICATIONS: 8, LOOP_SUMMARIZER_CACHE_MISSES: 8, LOOP_SUMMARIZER_OVERALL_TIME: 16.8s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 16.8s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 18, 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.7s, DAG_COMPRESSION_PROCESSED_NODES: 40437, DAG_COMPRESSION_RETAINED_NODES: 476, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && check__tmp == __return_1470) && !(255 == r1 % 256)) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 == __return_1470) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && nomsg == node1__m1) && __return_main == 0) && #NULL == 0) && main__i2 == 0 - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((mode2 == 0 && 0 <= id3) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && p2 == 0) && p1_new + 1 <= 0) && 0 <= mode3) && p3_new == nomsg) && st3 + st2 + st1 == 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && mode3 == 1) && mode2 == 1) && 0 <= id1) && 0 <= __return_1470) && p1_new + 1 <= 0) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && 1 <= __return_1394) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && p1_new + 1 <= 0) && 0 <= mode3) && mode2 <= 0) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && mode3 == 1) && 0 <= p3_new + 1) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && 0 <= __return_1470) && p2 == 0) && p1_new + 1 <= 0) && st3 + st2 + st1 == 0) && 0 <= st1) && 0 <= st2) && mode1 == 1) && nomsg + 1 <= id2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((256 * (mode2 / 256) == mode2 && 0 <= mode3) && st3 + st2 + st1 <= 0) && ((((((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && 0 <= node2__m2 + 1) && node2__m2 + 1 <= 0) || ((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2 <= 0) && p1_\old + 1 <= 0))) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((256 * (mode2 / 256) == mode2 && r1 / 256 * 256 + 2 < r1) && 0 <= mode3) && st3 + st2 + st1 <= 1) && ((((((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && 0 <= node2__m2 + 1) && node2__m2 + 1 <= 0) || ((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2 <= 0) && p1_\old + 1 <= 0))) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p2 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && check__tmp == __return_1470) && st2 <= 1) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && main__c1 == __return_1470) && p3_new == nomsg) && 0 <= st1) && 0 <= st2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && init__tmp == 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && nomsg == node2__m2) && check__tmp == __return_1470) && st2 <= 1) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && main__c1 == __return_1470) && p3_new == nomsg) && 0 <= st1) && 0 <= st2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && nomsg == node2__m2) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p2 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((nomsg == node2__m2 && (((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2 <= 0) && p1_\old + 1 <= 0) || (((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && node2__m2 + 1 <= 0))) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && 0 <= mode3) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((((((nomsg == node2__m2 && (((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2 <= 0) && p1_\old + 1 <= 0) || (((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && node2__m2 + 1 <= 0))) && 256 * (mode2 / 256) == mode2) && 0 <= mode3) && st3 + st2 + st1 <= 0) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((mode2 == 1 && (((((((((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && node2__m2 + 1 <= 0) && 1 <= init__tmp) || (((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && p1_\old + 1 <= 0) && 1 <= init__tmp))) && 0 <= mode3) && st3 + st2 + st1 <= 0) && send2 == node2____CPAchecker_TMP_0) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && id3 <= 127) && (if node2____CPAchecker_TMP_0 % 256 <= 127 then node2____CPAchecker_TMP_0 % 256 else -256 + node2____CPAchecker_TMP_0 % 256) == p2_new) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && node3____CPAchecker_TMP_0 == send3) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((((((((((((((((0 <= id3 && mode2 == 1) && 0 <= id1) && 0 <= __return_1470) && p2 == 0) && p3_new == nomsg) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && __return_1394 <= 1) && (mode2 == 0 || (send2 == node2____CPAchecker_TMP_0 && (if node2____CPAchecker_TMP_0 % 256 <= 127 then node2____CPAchecker_TMP_0 % 256 else -256 + node2____CPAchecker_TMP_0 % 256) == p2_new))) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && node3____CPAchecker_TMP_0 == send3) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && node2__m2 + 1 <= 0) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((mode2 == 1 && (((((((((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && node2__m2 + 1 <= 0) && 1 <= init__tmp) || (((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && p1_\old + 1 <= 0) && 1 <= init__tmp))) && r1 / 256 * 256 + 2 < r1) && 0 <= mode3) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && (mode2 == 0 || (send2 == node2____CPAchecker_TMP_0 && (if node2____CPAchecker_TMP_0 % 256 <= 127 then node2____CPAchecker_TMP_0 % 256 else -256 + node2____CPAchecker_TMP_0 % 256) == p2_new))) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && node3____CPAchecker_TMP_0 == send3) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 361]: Loop Invariant [2022-11-25 23:37:49,434 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,435 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,435 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,435 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,436 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,436 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,436 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,436 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,437 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,437 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,437 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,437 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,439 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,439 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,439 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,440 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,440 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,440 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,440 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,441 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,441 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,441 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,441 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,441 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && check__tmp == __return_1470) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && 0 <= mode3) && st3 + st2 + st1 <= 0) && mode1 % 256 == 0) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && mode1 <= 1) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && nomsg == node1__m1) && __return_main == 0) && (((((((((((((((((((((((((((__return_1470 == 0 && unknown-#length-unknown[3] == 12) && unknown-#length-unknown[2] == 50) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) || (main__c1 == __return_1470 && !(assert__arg % 256 == 0)))) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p1_\old + 1) && check__tmp == __return_1470) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p2 == 0) && p1_new + 1 <= 0) && main__c1 == __return_1470) && 0 <= mode3) && p3_new == nomsg) && st3 + st2 + st1 == 0) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && nomsg == node1__m1) && __return_main == 0) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && 0 <= p3_new + 1) && nomsg + 1 <= send2) && 0 <= p1_\old + 1) && check__tmp == __return_1470) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 == __return_1470) && 0 <= mode3) && mode2 <= 0) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && id1 <= 127) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && nomsg == node1__m1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((mode2 == 1 && (((((((((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && node2__m2 + 1 <= 0) && 1 <= init__tmp) || (((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && p1_\old + 1 <= 0) && 1 <= init__tmp))) && r1 / 256 * 256 + 2 < r1) && 0 <= mode3) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && (mode2 == 0 || (send2 == node2____CPAchecker_TMP_0 && (if node2____CPAchecker_TMP_0 % 256 <= 127 then node2____CPAchecker_TMP_0 % 256 else -256 + node2____CPAchecker_TMP_0 % 256) == p2_new))) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((mode2 == 1 && (((((((((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && node2__m2 + 1 <= 0) && 1 <= init__tmp) || (((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && p1_\old + 1 <= 0) && 1 <= init__tmp))) && 0 <= mode3) && st3 + st2 + st1 <= 0) && send2 == node2____CPAchecker_TMP_0) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && id3 <= 127) && (if node2____CPAchecker_TMP_0 % 256 <= 127 then node2____CPAchecker_TMP_0 % 256 else -256 + node2____CPAchecker_TMP_0 % 256) == p2_new) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && 0 <= p3_new + 1) && 0 <= p1_\old + 1) && check__tmp == __return_1470) && st2 <= 1) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 == __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && mode2 == 1) && 0 <= id1) && 0 <= __return_1470) && p2 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg + 1 <= 0) && __return_1394 <= 1) && (mode2 == 0 || (send2 == node2____CPAchecker_TMP_0 && (if node2____CPAchecker_TMP_0 % 256 <= 127 then node2____CPAchecker_TMP_0 % 256 else -256 + node2____CPAchecker_TMP_0 % 256) == p2_new))) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && node2__m2 + 1 <= 0) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && nomsg + 1 <= id3) && nomsg + 1 <= send3) && mode3 == 1) && 0 <= p3_new + 1) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= check__tmp) && 0 <= id1) && 0 <= __return_1470) && p2 == 0) && p1_new + 1 <= 0) && st3 + st2 + st1 == 0) && st2 + st1 <= 2147483647) && 0 <= st1) && 0 <= st2) && mode1 == 1) && nomsg + 1 <= id2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && !(2147483649 + st2 + st1 <= 0)) && st3 + st2 + st1 <= 2147483647) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && nomsg + 1 <= id3) && nomsg + 1 <= send3) && 0 <= p3_new + 1) && nomsg + 1 <= send2) && 0 <= check__tmp) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && 0 <= mode3) && mode2 <= 0) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && nomsg + 1 <= id2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && p1_\old + 1 <= 0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 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)) || (((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && nomsg + 1 <= id3) && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= check__tmp) && 0 <= id1) && 0 <= __return_1470) && p1_new + 1 <= 0) && p3_new == nomsg) && st2 + st1 <= 2147483647) && st3 + st2 + st1 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && mode1 == 1) && nomsg + 1 <= id2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && 1 <= __return_1394) && p3 == 0) && 0 <= p1_new + 1) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && !(2147483649 + st2 + st1 <= 0)) && st3 + st2 + st1 <= 2147483647) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && 0 <= id3) && 0 <= p3_new + 1) && 0 <= check__tmp) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p2 == 0) && p1_new + 1 <= 0) && 0 <= mode3) && st3 + st2 + st1 == 0) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && check__tmp == __return_1470) && !(255 == r1 % 256)) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 == __return_1470) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && nomsg == node1__m1) && __return_main == 0) && #NULL == 0) && main__i2 == 0 - InvariantResult [Line: 161]: Loop Invariant [2022-11-25 23:37:49,452 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,453 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,453 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,454 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,454 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,455 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,455 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,455 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,456 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,456 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,456 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,457 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,458 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,459 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,459 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,459 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,460 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,460 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,461 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,461 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,461 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,462 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,462 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,462 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) && 0 <= __return_1470) && p2 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && init__tmp == 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && ((((((((((((((((((((((((((((((__return_1470 == 0 && unknown-#length-unknown[3] == 12) && unknown-#length-unknown[2] == 50) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && st3 == 0) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && st1 == 0) && !(id1 == id2)) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && st2 == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && r1 % 256 == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) || (main__c1 == __return_1470 && !(assert__arg % 256 == 0)))) && 0 <= p1_\old + 1) && check__tmp == __return_1470) && st2 <= 1) && 0 <= id1) && p1_new + 1 <= 0) && 0 <= mode3) && mode2 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((((((((nomsg + 1 <= id3 && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && 0 <= __return_1470) && p2 == 0) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 0 <= st1) && 0 <= st2) && mode1 == 1) && id1 <= 127) && init__tmp == 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && 0 <= p3_new + 1) && 0 <= p1_\old + 1) && check__tmp == __return_1470) && st2 <= 1) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 == __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && mode2 == 1) && 0 <= id1) && 0 <= __return_1470) && p2 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg + 1 <= 0) && __return_1394 <= 1) && (mode2 == 0 || (send2 == node2____CPAchecker_TMP_0 && (if node2____CPAchecker_TMP_0 % 256 <= 127 then node2____CPAchecker_TMP_0 % 256 else -256 + node2____CPAchecker_TMP_0 % 256) == p2_new))) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && node2__m2 + 1 <= 0) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((mode2 == 1 && (((((((((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && node2__m2 + 1 <= 0) && 1 <= init__tmp) || (((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && p1_\old + 1 <= 0) && 1 <= init__tmp))) && 0 <= mode3) && st3 + st2 + st1 <= 0) && send2 == node2____CPAchecker_TMP_0) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && id3 <= 127) && (if node2____CPAchecker_TMP_0 % 256 <= 127 then node2____CPAchecker_TMP_0 % 256 else -256 + node2____CPAchecker_TMP_0 % 256) == p2_new) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((mode2 == 1 && (((((((((((((((((((((0 <= id3 && 1 <= mode2) && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && id1 <= 127) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && 0 <= node2____CPAchecker_TMP_0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && node2__m2 + 1 <= 0) && 1 <= init__tmp) || (((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= mode1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && mode1 <= 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && p2 <= 0) && p3_new + 1 <= 0) && init__tmp <= 1) && p1_\old + 1 <= 0) && 1 <= init__tmp))) && r1 / 256 * 256 + 2 < r1) && 0 <= mode3) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && mode3 <= 1) && mode1 == 1) && (mode2 == 0 || (send2 == node2____CPAchecker_TMP_0 && (if node2____CPAchecker_TMP_0 % 256 <= 127 then node2____CPAchecker_TMP_0 % 256 else -256 + node2____CPAchecker_TMP_0 % 256) == p2_new))) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 363]: Loop Invariant [2022-11-25 23:37:49,470 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,470 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,471 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,473 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,473 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,474 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,474 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,474 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,475 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,475 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,475 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,475 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,476 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,476 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,476 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,476 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,477 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,477 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,477 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,478 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,478 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,478 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,478 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,478 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,480 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,481 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,481 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,482 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,482 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,483 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,483 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,483 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,484 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,484 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,484 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,484 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,485 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,485 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,485 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,485 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,486 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,486 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,486 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,486 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,486 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,487 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,487 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,487 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p1_\old + 1) && check__tmp == __return_1470) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p2 == 0) && p1_new + 1 <= 0) && main__c1 == __return_1470) && 0 <= mode3) && check__tmp == 1) && p3_new == nomsg) && st3 + st2 + st1 == 0) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && nomsg == node1__m1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((__return_1470 == 0 && 0 <= id3) && unknown-#length-unknown[3] == 12) && 0 <= p3_new + 1) && unknown-#length-unknown[2] == 50) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && main__c1 <= 1) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && send1 == node1____CPAchecker_TMP_0) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && nomsg == p2_\old) && st3 + st2 + st1 <= 0) && !(id3 == id2)) && mode1 % 256 == 0) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && main__c1 == 0) && 0 <= p2) && 0 <= send2) && id1 <= 127) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && st2 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && send1 == id1) && r1 <= r1 / 256 * 256) && \valid[0] == 0) && 0 <= __return_main) && id3 <= 127) && \valid[2] == 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && 0 <= st2 + st1) && p2 <= 0) && nodes[2] == #funAddr~node3.offset) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && unknown-#memory_int-unknown[1][1] == 0) && 0 <= p1) && #funAddr~node2.offset == nodes[1]) && 0 <= main__c1) && nomsg == node1__m1) && 1 <= init__tmp) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && 0 <= p3_new + 1) && nomsg + 1 <= send2) && 0 <= p1_\old + 1) && check__tmp == __return_1470) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 == __return_1470) && 0 <= mode3) && mode2 <= 0) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && id1 <= 127) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && nomsg == node1__m1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && check__tmp == __return_1470) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && main__c1 <= 1) && 0 <= mode3) && st3 + st2 + st1 <= 0) && mode1 % 256 == 0) && mode2 <= 1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && mode1 <= 1) && assert__arg == __tmp_1) && st2 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= st2 + st1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && nomsg == node1__m1) && 1 <= init__tmp) && (((((((((((((((((((((((((((__return_1470 == 0 && unknown-#length-unknown[3] == 12) && unknown-#length-unknown[2] == 50) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) || (main__c1 == __return_1470 && !(assert__arg % 256 == 0)))) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && r1 / 256 * 256 + 2 < r1) && 0 <= mode3) && mode2 <= 0) && send2 == node2____CPAchecker_TMP_0) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && p3 == 0) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && node2__m2 + 1 <= 0) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 % 256 == 0) && p2 == 0) && st3 + st2 + st1 <= 0) && send2 == node2____CPAchecker_TMP_0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && node2__m2 + 1 <= 0) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((mode2 == 0 && 0 <= id3) && 0 <= p3_new + 1) && 0 <= p1_\old + 1) && 0 <= id1) && 0 <= __return_1470) && p2 == 0) && 0 <= mode3) && st3 + st2 + st1 <= 0) && send2 == node2____CPAchecker_TMP_0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && p3 == 0) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && node2__m2 + 1 <= 0) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 114]: Loop Invariant [2022-11-25 23:37:49,492 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,492 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,492 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,492 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,494 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,495 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,495 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,495 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,496 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,496 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,496 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,496 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,499 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,499 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-25 23:37:49,499 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-25 23:37:49,500 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,500 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-25 23:37:49,500 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-25 23:37:49,501 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,501 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-25 23:37:49,501 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-25 23:37:49,501 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-25 23:37:49,501 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-25 23:37:49,502 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && mode3 == 1) && mode2 == 1) && check__tmp == __return_1470) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 == __return_1470) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && 1 <= __return_1394) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && st3 + st2 + st1 <= 2147483647) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && mode3 == 1) && 0 <= p3_new + 1) && mode2 == 1) && check__tmp == __return_1470) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && main__c1 == __return_1470) && st3 + st2 + st1 == 0) && 0 <= st1) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && st3 + st2 + st1 <= 2147483647) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && (((((0 <= mode3 && mode2 <= 1) && mode3 <= 1) && mode1 <= 1) && 0 <= mode2) || main__c1 <= 0)) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && 256 * (mode1 / 256) == mode1) && st3 + st2 + st1 <= 0) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && st2 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= st2 + st1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (((((((((((((((((((((((((((__return_1470 == 0 && unknown-#length-unknown[3] == 12) && unknown-#length-unknown[2] == 50) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) || ((((check__tmp == __return_1470 && main__c1 == __return_1470) && !(assert__arg % 256 == 0)) && assert__arg == __tmp_1) && (if main__c1 == 0 then 0 else 1) == __tmp_1))) && 0 <= send3) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= p1_\old + 1) && check__tmp == __return_1470) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p2 == 0) && p1_new + 1 <= 0) && main__c1 == __return_1470) && 0 <= mode3) && st3 + st2 + st1 == 0) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && 0 <= p3_new + 1) && nomsg + 1 <= send2) && 0 <= p1_\old + 1) && check__tmp == __return_1470) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 == __return_1470) && 0 <= mode3) && mode2 <= 0) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && id1 <= 127) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && p1_\old + 1 <= 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) RESULT: Ultimate proved your program to be correct! [2022-11-25 23:37:49,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5af67d-34a6-4ca6-a281-6c84f403b5c8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE