./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4e7fbc69 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_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW --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 e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca --- 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-4e7fbc6 [2022-11-23 15:12:01,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:12:01,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:12:01,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:12:01,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:12:01,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:12:01,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:12:01,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:12:01,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:12:01,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:12:01,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:12:01,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:12:01,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:12:01,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:12:01,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:12:01,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:12:01,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:12:01,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:12:01,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:12:01,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:12:01,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:12:01,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:12:01,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:12:01,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:12:01,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:12:01,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:12:01,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:12:01,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:12:01,876 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:12:01,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:12:01,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:12:01,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:12:01,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:12:01,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:12:01,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:12:01,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:12:01,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:12:01,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:12:01,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:12:01,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:12:01,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:12:01,892 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-23 15:12:01,922 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:12:01,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:12:01,923 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:12:01,924 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:12:01,925 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:12:01,925 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:12:01,926 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:12:01,927 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:12:01,927 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:12:01,927 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 15:12:01,928 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:12:01,928 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:12:01,929 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 15:12:01,929 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 15:12:01,930 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:12:01,930 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 15:12:01,931 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 15:12:01,931 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 15:12:01,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:12:01,933 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:12:01,933 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 15:12:01,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:12:01,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:12:01,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:12:01,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 15:12:01,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:12:01,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 15:12:01,937 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-23 15:12:01,937 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:12:01,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 15:12:01,938 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:12:01,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 15:12:01,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:12:01,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:12:01,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:12:01,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:12:01,941 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 15:12:01,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:12:01,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 15:12:01,942 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 15:12:01,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 15:12:01,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 15:12:01,943 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:12:01,944 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_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/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_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW 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 -> e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca [2022-11-23 15:12:02,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:12:02,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:12:02,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:12:02,327 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:12:02,327 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:12:02,329 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-23 15:12:06,347 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:12:06,654 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:12:06,664 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-23 15:12:06,678 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/data/e3964b5c9/379a8739b7634e398604d15c79940cb9/FLAG0c8ed6bcd [2022-11-23 15:12:06,708 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/data/e3964b5c9/379a8739b7634e398604d15c79940cb9 [2022-11-23 15:12:06,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:12:06,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:12:06,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:12:06,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:12:06,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:12:06,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:12:06" (1/1) ... [2022-11-23 15:12:06,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@326c0b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:06, skipping insertion in model container [2022-11-23 15:12:06,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:12:06" (1/1) ... [2022-11-23 15:12:06,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:12:06,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:12:07,131 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_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2022-11-23 15:12:07,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:12:07,145 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:12:07,188 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_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2022-11-23 15:12:07,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:12:07,207 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:12:07,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:07 WrapperNode [2022-11-23 15:12:07,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:12:07,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:12:07,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:12:07,210 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:12:07,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:07" (1/1) ... [2022-11-23 15:12:07,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:07" (1/1) ... [2022-11-23 15:12:07,261 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 219 [2022-11-23 15:12:07,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:12:07,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:12:07,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:12:07,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:12:07,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:07" (1/1) ... [2022-11-23 15:12:07,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:07" (1/1) ... [2022-11-23 15:12:07,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:07" (1/1) ... [2022-11-23 15:12:07,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:07" (1/1) ... [2022-11-23 15:12:07,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:07" (1/1) ... [2022-11-23 15:12:07,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:07" (1/1) ... [2022-11-23 15:12:07,308 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:07" (1/1) ... [2022-11-23 15:12:07,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:07" (1/1) ... [2022-11-23 15:12:07,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:12:07,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:12:07,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:12:07,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:12:07,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:07" (1/1) ... [2022-11-23 15:12:07,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:12:07,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:07,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:12:07,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:12:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:12:07,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 15:12:07,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:12:07,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:12:07,558 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:12:07,560 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:12:08,047 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:12:08,475 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:12:08,476 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 15:12:08,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:12:08 BoogieIcfgContainer [2022-11-23 15:12:08,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:12:08,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:12:08,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:12:08,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:12:08,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:12:06" (1/3) ... [2022-11-23 15:12:08,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59de1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:12:08, skipping insertion in model container [2022-11-23 15:12:08,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:07" (2/3) ... [2022-11-23 15:12:08,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59de1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:12:08, skipping insertion in model container [2022-11-23 15:12:08,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:12:08" (3/3) ... [2022-11-23 15:12:08,490 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-23 15:12:08,514 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:12:08,514 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-23 15:12:08,578 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:12:08,585 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;@338a8b19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:12:08,586 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-23 15:12:08,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:12:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-23 15:12:08,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:08,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-23 15:12:08,600 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-23 15:12:08,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:08,608 INFO L85 PathProgramCache]: Analyzing trace with hash 11377276, now seen corresponding path program 1 times [2022-11-23 15:12:08,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:08,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861681810] [2022-11-23 15:12:08,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:08,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:09,222 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-23 15:12:09,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:09,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861681810] [2022-11-23 15:12:09,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861681810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:09,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:09,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:12:09,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796649490] [2022-11-23 15:12:09,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:09,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:12:09,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:09,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:12:09,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:12:09,281 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:12:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:09,410 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2022-11-23 15:12:09,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:12:09,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-23 15:12:09,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:09,425 INFO L225 Difference]: With dead ends: 104 [2022-11-23 15:12:09,426 INFO L226 Difference]: Without dead ends: 67 [2022-11-23 15:12:09,433 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-23 15:12:09,438 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 34 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:09,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 98 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:12:09,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-23 15:12:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-11-23 15:12:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 54 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-23 15:12:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2022-11-23 15:12:09,498 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 4 [2022-11-23 15:12:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:09,500 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 76 transitions. [2022-11-23 15:12:09,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:12:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2022-11-23 15:12:09,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 15:12:09,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:09,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 15:12:09,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 15:12:09,503 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-23 15:12:09,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:09,508 INFO L85 PathProgramCache]: Analyzing trace with hash 352724648, now seen corresponding path program 1 times [2022-11-23 15:12:09,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:09,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55470562] [2022-11-23 15:12:09,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:09,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:10,065 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-23 15:12:10,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:10,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55470562] [2022-11-23 15:12:10,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55470562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:10,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:10,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:12:10,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016139108] [2022-11-23 15:12:10,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:10,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:12:10,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:10,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:12:10,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:12:10,088 INFO L87 Difference]: Start difference. First operand 55 states and 76 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:12:10,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:10,314 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2022-11-23 15:12:10,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:12:10,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-23 15:12:10,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:10,320 INFO L225 Difference]: With dead ends: 93 [2022-11-23 15:12:10,321 INFO L226 Difference]: Without dead ends: 90 [2022-11-23 15:12:10,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:12:10,331 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:10,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 27 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:12:10,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-23 15:12:10,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 71. [2022-11-23 15:12:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.728813559322034) internal successors, (102), 70 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-23 15:12:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2022-11-23 15:12:10,358 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 5 [2022-11-23 15:12:10,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:10,359 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2022-11-23 15:12:10,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:12:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2022-11-23 15:12:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 15:12:10,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:10,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 15:12:10,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 15:12:10,361 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-23 15:12:10,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:10,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1950437567, now seen corresponding path program 1 times [2022-11-23 15:12:10,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:10,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113299084] [2022-11-23 15:12:10,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:10,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:10,757 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-23 15:12:10,758 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:10,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113299084] [2022-11-23 15:12:10,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113299084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:10,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:10,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:12:10,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972261152] [2022-11-23 15:12:10,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:10,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:12:10,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:10,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:12:10,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:12:10,760 INFO L87 Difference]: Start difference. First operand 71 states and 102 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-23 15:12:10,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:10,918 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2022-11-23 15:12:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:12:10,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-23 15:12:10,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:10,926 INFO L225 Difference]: With dead ends: 89 [2022-11-23 15:12:10,927 INFO L226 Difference]: Without dead ends: 86 [2022-11-23 15:12:10,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:12:10,936 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:10,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 30 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:12:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-23 15:12:10,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2022-11-23 15:12:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 71 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-23 15:12:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2022-11-23 15:12:10,960 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 6 [2022-11-23 15:12:10,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:10,961 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2022-11-23 15:12:10,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-23 15:12:10,961 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2022-11-23 15:12:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 15:12:10,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:10,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:12:10,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 15:12:10,965 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-23 15:12:10,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:10,967 INFO L85 PathProgramCache]: Analyzing trace with hash -334022198, now seen corresponding path program 1 times [2022-11-23 15:12:10,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:10,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436022130] [2022-11-23 15:12:10,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:10,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:11,574 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-23 15:12:11,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:11,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436022130] [2022-11-23 15:12:11,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436022130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:11,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:11,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:12:11,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408724063] [2022-11-23 15:12:11,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:11,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:12:11,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:11,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:12:11,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:12:11,580 INFO L87 Difference]: Start difference. First operand 72 states and 101 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 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-23 15:12:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:11,733 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2022-11-23 15:12:11,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:12:11,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-23 15:12:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:11,735 INFO L225 Difference]: With dead ends: 86 [2022-11-23 15:12:11,735 INFO L226 Difference]: Without dead ends: 83 [2022-11-23 15:12:11,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:12:11,737 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:11,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 33 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:12:11,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-23 15:12:11,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2022-11-23 15:12:11,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.639344262295082) internal successors, (100), 72 states have internal predecessors, (100), 0 states have call successors, (0), 0 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-23 15:12:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2022-11-23 15:12:11,757 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 7 [2022-11-23 15:12:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:11,758 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2022-11-23 15:12:11,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 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-23 15:12:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2022-11-23 15:12:11,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 15:12:11,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:11,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:12:11,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 15:12:11,760 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-23 15:12:11,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:11,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1764753309, now seen corresponding path program 1 times [2022-11-23 15:12:11,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:11,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442556613] [2022-11-23 15:12:11,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:11,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:12,141 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-23 15:12:12,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:12,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442556613] [2022-11-23 15:12:12,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442556613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:12,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:12,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:12:12,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382952067] [2022-11-23 15:12:12,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:12,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:12:12,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:12,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:12:12,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:12:12,146 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:12:12,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:12,299 INFO L93 Difference]: Finished difference Result 134 states and 184 transitions. [2022-11-23 15:12:12,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:12:12,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-23 15:12:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:12,301 INFO L225 Difference]: With dead ends: 134 [2022-11-23 15:12:12,301 INFO L226 Difference]: Without dead ends: 80 [2022-11-23 15:12:12,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:12:12,307 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:12,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 37 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:12:12,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-23 15:12:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2022-11-23 15:12:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 73 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:12:12,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2022-11-23 15:12:12,335 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 8 [2022-11-23 15:12:12,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:12,336 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2022-11-23 15:12:12,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:12:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-11-23 15:12:12,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 15:12:12,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:12,342 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:12:12,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 15:12:12,343 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-23 15:12:12,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2077909877, now seen corresponding path program 1 times [2022-11-23 15:12:12,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:12,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201692414] [2022-11-23 15:12:12,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:12,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:12,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:12:12,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:12,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201692414] [2022-11-23 15:12:12,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201692414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:12,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:12,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:12:12,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426907371] [2022-11-23 15:12:12,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:12,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:12:12,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:12,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:12:12,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:12:12,556 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:12:12,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:12,622 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2022-11-23 15:12:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:12:12,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 15:12:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:12,624 INFO L225 Difference]: With dead ends: 155 [2022-11-23 15:12:12,624 INFO L226 Difference]: Without dead ends: 96 [2022-11-23 15:12:12,625 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-23 15:12:12,627 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 20 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:12,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 64 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:12:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-23 15:12:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2022-11-23 15:12:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.6111111111111112) internal successors, (116), 83 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:12:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2022-11-23 15:12:12,656 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 16 [2022-11-23 15:12:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:12,657 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2022-11-23 15:12:12,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:12:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2022-11-23 15:12:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 15:12:12,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:12,659 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:12:12,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 15:12:12,660 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-23 15:12:12,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:12,660 INFO L85 PathProgramCache]: Analyzing trace with hash -946674433, now seen corresponding path program 1 times [2022-11-23 15:12:12,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:12,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118277665] [2022-11-23 15:12:12,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:12,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:12:12,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:12,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118277665] [2022-11-23 15:12:12,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118277665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:12,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:12,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:12:12,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761233438] [2022-11-23 15:12:12,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:12,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:12:12,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:12,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:12:12,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:12:12,788 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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-23 15:12:12,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:12,829 INFO L93 Difference]: Finished difference Result 155 states and 198 transitions. [2022-11-23 15:12:12,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:12:12,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-23 15:12:12,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:12,831 INFO L225 Difference]: With dead ends: 155 [2022-11-23 15:12:12,831 INFO L226 Difference]: Without dead ends: 85 [2022-11-23 15:12:12,833 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-23 15:12:12,834 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 85 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-23 15:12:12,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 85 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:12:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-23 15:12:12,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2022-11-23 15:12:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 69 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:12:12,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2022-11-23 15:12:12,855 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 20 [2022-11-23 15:12:12,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:12,855 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2022-11-23 15:12:12,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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-23 15:12:12,856 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2022-11-23 15:12:12,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 15:12:12,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:12,857 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:12:12,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 15:12:12,858 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-23 15:12:12,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:12,859 INFO L85 PathProgramCache]: Analyzing trace with hash 751304214, now seen corresponding path program 1 times [2022-11-23 15:12:12,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:12,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709331815] [2022-11-23 15:12:12,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:12,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:12:13,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:13,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709331815] [2022-11-23 15:12:13,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709331815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:12:13,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133093609] [2022-11-23 15:12:13,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:13,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:13,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:13,685 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:13,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 15:12:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:13,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 15:12:13,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:15,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:12:15,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:12:15,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133093609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:15,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:12:15,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 7 [2022-11-23 15:12:15,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43376491] [2022-11-23 15:12:15,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:15,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:12:15,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:15,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:12:15,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:12:15,418 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:12:15,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:15,630 INFO L93 Difference]: Finished difference Result 129 states and 170 transitions. [2022-11-23 15:12:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:12:15,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-23 15:12:15,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:15,635 INFO L225 Difference]: With dead ends: 129 [2022-11-23 15:12:15,636 INFO L226 Difference]: Without dead ends: 75 [2022-11-23 15:12:15,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:12:15,637 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:15,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 46 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:12:15,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-23 15:12:15,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-11-23 15:12:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 69 states have internal predecessors, (90), 0 states have call successors, (0), 0 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-23 15:12:15,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2022-11-23 15:12:15,650 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 22 [2022-11-23 15:12:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:15,650 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2022-11-23 15:12:15,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:12:15,651 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2022-11-23 15:12:15,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 15:12:15,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:15,653 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:12:15,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-23 15:12:15,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:15,860 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-23 15:12:15,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:15,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1098712592, now seen corresponding path program 1 times [2022-11-23 15:12:15,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:15,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609061067] [2022-11-23 15:12:15,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:15,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:12:16,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:16,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609061067] [2022-11-23 15:12:16,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609061067] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:12:16,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243024565] [2022-11-23 15:12:16,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:16,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:16,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:16,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:16,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 15:12:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:16,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-23 15:12:16,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:12:18,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:12:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:12:21,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243024565] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:12:21,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1332468914] [2022-11-23 15:12:21,117 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-23 15:12:21,117 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:12:21,121 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:12:21,127 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:12:21,128 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:12:32,363 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:12:39,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1332468914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:39,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:12:39,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [3, 7, 8] total 30 [2022-11-23 15:12:39,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164195524] [2022-11-23 15:12:39,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:39,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 15:12:39,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:39,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 15:12:39,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2022-11-23 15:12:39,095 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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-23 15:12:48,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:48,666 INFO L93 Difference]: Finished difference Result 174 states and 248 transitions. [2022-11-23 15:12:48,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 15:12:48,667 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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 23 [2022-11-23 15:12:48,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:48,668 INFO L225 Difference]: With dead ends: 174 [2022-11-23 15:12:48,668 INFO L226 Difference]: Without dead ends: 120 [2022-11-23 15:12:48,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=517, Invalid=1043, Unknown=0, NotChecked=0, Total=1560 [2022-11-23 15:12:48,670 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 88 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:48,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 44 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 15:12:48,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-23 15:12:48,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2022-11-23 15:12:48,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.396039603960396) internal successors, (141), 112 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-23 15:12:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 141 transitions. [2022-11-23 15:12:48,700 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 141 transitions. Word has length 23 [2022-11-23 15:12:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:48,700 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 141 transitions. [2022-11-23 15:12:48,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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-23 15:12:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions. [2022-11-23 15:12:48,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 15:12:48,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:48,702 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:12:48,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 15:12:48,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-23 15:12:48,903 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-23 15:12:48,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:48,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1351812139, now seen corresponding path program 1 times [2022-11-23 15:12:48,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:48,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142844739] [2022-11-23 15:12:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:48,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:49,163 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:12:49,164 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:49,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142844739] [2022-11-23 15:12:49,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142844739] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:12:49,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996038171] [2022-11-23 15:12:49,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:49,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:49,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:49,166 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:49,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 15:12:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:49,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 15:12:49,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:49,351 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:12:49,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:12:49,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996038171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:49,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:12:49,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-23 15:12:49,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354560622] [2022-11-23 15:12:49,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:49,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:12:49,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:49,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:12:49,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:12:49,355 INFO L87 Difference]: Start difference. First operand 113 states and 141 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:12:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:49,472 INFO L93 Difference]: Finished difference Result 180 states and 216 transitions. [2022-11-23 15:12:49,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:12:49,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-23 15:12:49,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:49,474 INFO L225 Difference]: With dead ends: 180 [2022-11-23 15:12:49,474 INFO L226 Difference]: Without dead ends: 125 [2022-11-23 15:12:49,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:12:49,478 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 29 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:49,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 147 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:12:49,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-23 15:12:49,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 113. [2022-11-23 15:12:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 112 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-23 15:12:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2022-11-23 15:12:49,512 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 32 [2022-11-23 15:12:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:49,515 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2022-11-23 15:12:49,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:12:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2022-11-23 15:12:49,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 15:12:49,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:49,518 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:12:49,525 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-23 15:12:49,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 15:12:49,725 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-23 15:12:49,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:49,726 INFO L85 PathProgramCache]: Analyzing trace with hash -249000925, now seen corresponding path program 1 times [2022-11-23 15:12:49,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:49,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355187239] [2022-11-23 15:12:49,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:49,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 15:12:49,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:49,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355187239] [2022-11-23 15:12:49,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355187239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:49,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:49,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:12:49,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109143095] [2022-11-23 15:12:49,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:49,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:12:49,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:49,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:12:49,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:12:49,798 INFO L87 Difference]: Start difference. First operand 113 states and 137 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:12:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:49,868 INFO L93 Difference]: Finished difference Result 188 states and 234 transitions. [2022-11-23 15:12:49,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:12:49,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-23 15:12:49,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:49,871 INFO L225 Difference]: With dead ends: 188 [2022-11-23 15:12:49,871 INFO L226 Difference]: Without dead ends: 134 [2022-11-23 15:12:49,872 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-23 15:12:49,873 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 25 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 67 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-23 15:12:49,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 67 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:12:49,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-23 15:12:49,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2022-11-23 15:12:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 113 states have (on average 1.345132743362832) internal successors, (152), 124 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-23 15:12:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2022-11-23 15:12:49,907 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 34 [2022-11-23 15:12:49,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:49,907 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2022-11-23 15:12:49,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:12:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2022-11-23 15:12:49,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-23 15:12:49,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:49,915 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-11-23 15:12:49,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 15:12:49,916 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-23 15:12:49,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:49,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2053411338, now seen corresponding path program 1 times [2022-11-23 15:12:49,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:49,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297437812] [2022-11-23 15:12:49,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:49,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:12:50,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:50,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297437812] [2022-11-23 15:12:50,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297437812] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:12:50,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701382389] [2022-11-23 15:12:50,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:50,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:50,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:50,169 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:50,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 15:12:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:50,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-23 15:12:50,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:12:51,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:12:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:12:53,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701382389] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:12:53,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [39534523] [2022-11-23 15:12:53,205 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 15:12:53,205 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:12:53,206 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:12:53,206 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:12:53,206 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:13:11,791 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:13:23,048 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3494#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (= ~nomsg~0 ~p1_new~0) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (<= 0 ~id1~0) (= ~p2~0 0) (<= |ULTIMATE.start_init_~tmp~0#1| 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= ~p3_new~0 ~nomsg~0) (<= |ULTIMATE.start_init_#res#1| 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= |ULTIMATE.start_main_~i2~0#1| 0) (or (and (<= 0 (+ ~p3_old~0 1)) (or (and (not (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|)) (or (= ~st3~0 1) (and (<= 0 ~st3~0) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|)))) (<= 0 ~send3~0)) (and (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|) (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|) (<= 0 ~st3~0))) (<= (+ ~p3_old~0 1) 0) (= ~mode3~0 0)) (and (= ~mode3~0 1) (exists ((v_~p3_new~0_48 Int)) (and (<= 0 (+ v_~p3_new~0_48 1)) (= ~p3_old~0 (ite (<= (mod (ite (and (= v_~p3_new~0_48 ~nomsg~0) (not (= ~send3~0 ~nomsg~0))) ~send3~0 v_~p3_new~0_48) 256) 127) (mod (ite (and (= v_~p3_new~0_48 ~nomsg~0) (not (= ~send3~0 ~nomsg~0))) ~send3~0 v_~p3_new~0_48) 256) (+ (mod (ite (and (= v_~p3_new~0_48 ~nomsg~0) (not (= ~send3~0 ~nomsg~0))) ~send3~0 v_~p3_new~0_48) 256) (- 256)))) (<= (+ v_~p3_new~0_48 1) 0))) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (<= 0 ~st3~0) (<= 0 ~send3~0))) (<= |ULTIMATE.start_main_~c1~0#1| 1) (<= ~id1~0 127) (= ~nomsg~0 ~p2_new~0) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= 1 |ULTIMATE.start_init_#res#1|) (not (<= 0 (+ ~st2~0 ~st1~0 2147483648))) (or (and (= ~mode2~0 0) (<= 0 (+ ~p2_old~0 1)) (or (and (<= 0 ~st2~0) (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|)) (and (<= 0 ~send2~0) (or (= ~st2~0 1) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) (<= 0 ~st2~0))) (not (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|)))) (<= (+ ~p2_old~0 1) 0)) (and (= ~mode2~0 1) (<= 0 ~st2~0) (<= 0 ~send2~0) (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|) (exists ((v_~p2_new~0_56 Int)) (and (= (ite (<= (mod (ite (and (= v_~p2_new~0_56 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_56) 256) 127) (mod (ite (and (= v_~p2_new~0_56 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_56) 256) (+ (- 256) (mod (ite (and (= v_~p2_new~0_56 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_56) 256))) ~p2_old~0) (<= (+ v_~p2_new~0_56 1) 0) (<= 0 (+ v_~p2_new~0_56 1)))))) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 127) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-23 15:13:23,049 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:13:23,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:13:23,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 22 [2022-11-23 15:13:23,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462346395] [2022-11-23 15:13:23,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:13:23,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-23 15:13:23,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:13:23,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-23 15:13:23,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2022-11-23 15:13:23,052 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 23 states have internal predecessors, (113), 0 states have call successors, (0), 0 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-23 15:13:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:13:23,912 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2022-11-23 15:13:23,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 15:13:23,913 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 23 states have internal predecessors, (113), 0 states have call successors, (0), 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-23 15:13:23,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:13:23,914 INFO L225 Difference]: With dead ends: 166 [2022-11-23 15:13:23,914 INFO L226 Difference]: Without dead ends: 163 [2022-11-23 15:13:23,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=407, Invalid=2245, Unknown=0, NotChecked=0, Total=2652 [2022-11-23 15:13:23,917 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 235 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:13:23,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 53 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 15:13:23,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-23 15:13:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 122. [2022-11-23 15:13:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 113 states have (on average 1.2831858407079646) internal successors, (145), 121 states have internal predecessors, (145), 0 states have call successors, (0), 0 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-23 15:13:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2022-11-23 15:13:23,957 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 38 [2022-11-23 15:13:23,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:13:23,959 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2022-11-23 15:13:23,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 23 states have internal predecessors, (113), 0 states have call successors, (0), 0 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-23 15:13:23,960 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2022-11-23 15:13:23,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-23 15:13:23,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:13:23,961 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:13:23,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 15:13:24,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:13:24,168 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-23 15:13:24,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:13:24,168 INFO L85 PathProgramCache]: Analyzing trace with hash 768758195, now seen corresponding path program 1 times [2022-11-23 15:13:24,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:13:24,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563965264] [2022-11-23 15:13:24,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:13:24,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:13:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:13:24,402 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:13:24,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:13:24,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563965264] [2022-11-23 15:13:24,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563965264] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:13:24,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472800077] [2022-11-23 15:13:24,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:13:24,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:13:24,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:13:24,406 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:13:24,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 15:13:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:13:24,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-23 15:13:24,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:13:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:13:26,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:13:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:13:27,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472800077] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:13:27,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1127468490] [2022-11-23 15:13:27,275 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 15:13:27,276 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:13:27,276 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:13:27,277 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:13:27,277 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:13:44,519 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:13:55,247 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4139#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (<= 0 (+ ~p3_new~0 1)) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (<= 0 ~id1~0) (= ~p2~0 0) (<= (+ ~p1_new~0 1) 0) (<= |ULTIMATE.start_init_~tmp~0#1| 1) (<= 0 ~mode3~0) (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start_init_#res#1| 1) (<= ~mode2~0 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= ~mode3~0 1) (<= |ULTIMATE.start_main_~c1~0#1| 1) (<= 0 ~send2~0) (<= ~id1~0 127) (<= ~st1~0 1) (<= 0 (+ ~p2_new~0 1)) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= (+ ~p2_new~0 1) 0) (<= 1 |ULTIMATE.start_init_#res#1|) (not (<= (+ ~st2~0 ~st1~0) 2147483647)) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 ~mode2~0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= (+ ~p3_new~0 1) 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (<= 0 (+ ~p1_new~0 1)) (<= 0 ~send3~0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-23 15:13:55,247 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:13:55,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:13:55,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 22 [2022-11-23 15:13:55,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038834858] [2022-11-23 15:13:55,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:13:55,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-23 15:13:55,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:13:55,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-23 15:13:55,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1550, Unknown=0, NotChecked=0, Total=1806 [2022-11-23 15:13:55,251 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 23 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:13:57,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:13:57,067 INFO L93 Difference]: Finished difference Result 258 states and 286 transitions. [2022-11-23 15:13:57,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 15:13:57,075 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 23 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-23 15:13:57,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:13:57,077 INFO L225 Difference]: With dead ends: 258 [2022-11-23 15:13:57,078 INFO L226 Difference]: Without dead ends: 255 [2022-11-23 15:13:57,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=478, Invalid=3304, Unknown=0, NotChecked=0, Total=3782 [2022-11-23 15:13:57,080 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 599 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 15:13:57,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 111 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 15:13:57,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-23 15:13:57,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 120. [2022-11-23 15:13:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 113 states have (on average 1.2300884955752212) internal successors, (139), 119 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-23 15:13:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2022-11-23 15:13:57,106 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 39 [2022-11-23 15:13:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:13:57,106 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2022-11-23 15:13:57,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 23 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:13:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2022-11-23 15:13:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-23 15:13:57,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:13:57,107 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:13:57,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 15:13:57,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-23 15:13:57,311 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-23 15:13:57,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:13:57,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1938299496, now seen corresponding path program 1 times [2022-11-23 15:13:57,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:13:57,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803180223] [2022-11-23 15:13:57,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:13:57,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:13:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:13:57,930 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 15:13:57,931 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:13:57,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803180223] [2022-11-23 15:13:57,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803180223] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:13:57,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687674145] [2022-11-23 15:13:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:13:57,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:13:57,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:13:57,933 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:13:57,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 15:13:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:13:58,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-23 15:13:58,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:14:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:14:03,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:14:10,602 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:14:10,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687674145] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:14:10,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [143052141] [2022-11-23 15:14:10,605 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 15:14:10,605 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:14:10,606 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:14:10,606 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:14:10,606 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:14:27,505 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:14:37,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [143052141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:14:37,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:14:37,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [3, 9, 9] total 39 [2022-11-23 15:14:37,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602579474] [2022-11-23 15:14:37,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:14:37,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 15:14:37,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:14:37,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 15:14:37,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1380, Unknown=0, NotChecked=0, Total=1640 [2022-11-23 15:14:37,866 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:15:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:15:00,276 INFO L93 Difference]: Finished difference Result 186 states and 225 transitions. [2022-11-23 15:15:00,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 15:15:00,277 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-23 15:15:00,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:15:00,278 INFO L225 Difference]: With dead ends: 186 [2022-11-23 15:15:00,278 INFO L226 Difference]: Without dead ends: 125 [2022-11-23 15:15:00,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=657, Invalid=2649, Unknown=0, NotChecked=0, Total=3306 [2022-11-23 15:15:00,280 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 187 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 15:15:00,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 14 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 15:15:00,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-23 15:15:00,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 105. [2022-11-23 15:15:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 103 states have (on average 1.1262135922330097) internal successors, (116), 104 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:15:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2022-11-23 15:15:00,338 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 40 [2022-11-23 15:15:00,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:15:00,339 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2022-11-23 15:15:00,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:15:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2022-11-23 15:15:00,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 15:15:00,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:15:00,340 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:15:00,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 15:15:00,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 15:15:00,559 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-23 15:15:00,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:15:00,560 INFO L85 PathProgramCache]: Analyzing trace with hash 42258005, now seen corresponding path program 1 times [2022-11-23 15:15:00,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:15:00,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848727953] [2022-11-23 15:15:00,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:15:00,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:15:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:15:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:15:01,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:15:01,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848727953] [2022-11-23 15:15:01,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848727953] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:15:01,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042951783] [2022-11-23 15:15:01,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:15:01,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:15:01,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:15:01,331 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:15:01,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 15:15:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:15:01,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-23 15:15:01,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:15:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:15:07,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:15:15,376 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:15:15,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042951783] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:15:15,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1187392434] [2022-11-23 15:15:15,380 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 15:15:15,380 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:15:15,381 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:15:15,381 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:15:15,381 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:15:31,941 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:15:42,663 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5599#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (<= 0 (+ ~p3_new~0 1)) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (<= 0 ~id1~0) (= ~p2~0 0) (<= (+ ~p1_new~0 1) 0) (<= |ULTIMATE.start_init_~tmp~0#1| 1) (<= 0 ~mode3~0) (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start_init_#res#1| 1) (<= ~mode2~0 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= 0 ~st2~0) (<= ~mode3~0 1) (<= |ULTIMATE.start_main_~c1~0#1| 1) (<= 0 ~send2~0) (<= ~id1~0 127) (<= ~st1~0 1) (not (<= (+ ~st3~0 ~st2~0 ~st1~0) 2147483647)) (<= 0 (+ ~p2_new~0 1)) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= (+ ~p2_new~0 1) 0) (<= 1 |ULTIMATE.start_init_#res#1|) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 ~mode2~0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= (+ ~p3_new~0 1) 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (<= 0 (+ ~p1_new~0 1)) (<= 0 ~send3~0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-23 15:15:42,663 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:15:42,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:15:42,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 23 [2022-11-23 15:15:42,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701401739] [2022-11-23 15:15:42,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:15:42,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 15:15:42,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:15:42,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 15:15:42,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=1597, Unknown=0, NotChecked=0, Total=1980 [2022-11-23 15:15:42,666 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 25 states, 24 states have (on average 5.125) internal successors, (123), 24 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-23 15:15:47,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:15:47,810 INFO L93 Difference]: Finished difference Result 315 states and 351 transitions. [2022-11-23 15:15:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 15:15:47,810 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.125) internal successors, (123), 24 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-23 15:15:47,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:15:47,812 INFO L225 Difference]: With dead ends: 315 [2022-11-23 15:15:47,812 INFO L226 Difference]: Without dead ends: 259 [2022-11-23 15:15:47,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1533 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=698, Invalid=3592, Unknown=0, NotChecked=0, Total=4290 [2022-11-23 15:15:47,814 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 766 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:15:47,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 109 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 15:15:47,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-11-23 15:15:47,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 169. [2022-11-23 15:15:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 167 states have (on average 1.0718562874251496) internal successors, (179), 168 states have internal predecessors, (179), 0 states have call successors, (0), 0 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-23 15:15:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 179 transitions. [2022-11-23 15:15:47,907 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 179 transitions. Word has length 41 [2022-11-23 15:15:47,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:15:47,907 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 179 transitions. [2022-11-23 15:15:47,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.125) internal successors, (123), 24 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-23 15:15:47,908 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 179 transitions. [2022-11-23 15:15:47,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-23 15:15:47,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:15:47,909 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:15:47,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 15:15:48,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 15:15:48,116 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-23 15:15:48,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:15:48,116 INFO L85 PathProgramCache]: Analyzing trace with hash -596050014, now seen corresponding path program 2 times [2022-11-23 15:15:48,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:15:48,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089382872] [2022-11-23 15:15:48,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:15:48,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:15:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:15:49,833 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:15:49,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:15:49,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089382872] [2022-11-23 15:15:49,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089382872] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:15:49,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340634306] [2022-11-23 15:15:49,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:15:49,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:15:49,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:15:49,836 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:15:49,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 15:15:50,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 15:15:50,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:15:50,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-23 15:15:50,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:15:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:15:56,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:16:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:16:06,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340634306] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:16:06,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2060051361] [2022-11-23 15:16:06,353 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 15:16:06,353 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:16:06,353 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:16:06,354 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:16:06,354 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:16:22,661 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:16:33,009 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6623#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (<= 0 (+ ~p3_new~0 1)) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (<= 0 ~id1~0) (= ~p2~0 0) (<= (+ ~p1_new~0 1) 0) (<= |ULTIMATE.start_init_~tmp~0#1| 1) (<= 0 ~mode3~0) (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start_init_#res#1| 1) (<= ~mode2~0 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= ~mode3~0 1) (<= |ULTIMATE.start_main_~c1~0#1| 1) (<= 0 ~send2~0) (<= ~id1~0 127) (<= ~st1~0 1) (<= 0 (+ ~p2_new~0 1)) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= (+ ~p2_new~0 1) 0) (<= 1 |ULTIMATE.start_init_#res#1|) (not (<= (+ ~st2~0 ~st1~0) 2147483647)) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 ~mode2~0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= (+ ~p3_new~0 1) 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (<= 0 (+ ~p1_new~0 1)) (<= 0 ~send3~0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-23 15:16:33,009 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:16:33,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:16:33,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 12] total 30 [2022-11-23 15:16:33,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061647218] [2022-11-23 15:16:33,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:16:33,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-23 15:16:33,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:16:33,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-23 15:16:33,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=2170, Unknown=0, NotChecked=0, Total=2652 [2022-11-23 15:16:33,012 INFO L87 Difference]: Start difference. First operand 169 states and 179 transitions. Second operand has 32 states, 31 states have (on average 5.419354838709677) internal successors, (168), 31 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-23 15:16:34,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:16:34,460 INFO L93 Difference]: Finished difference Result 224 states and 236 transitions. [2022-11-23 15:16:34,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 15:16:34,460 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 5.419354838709677) internal successors, (168), 31 states have internal predecessors, (168), 0 states have call successors, (0), 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 56 [2022-11-23 15:16:34,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:16:34,462 INFO L225 Difference]: With dead ends: 224 [2022-11-23 15:16:34,462 INFO L226 Difference]: Without dead ends: 223 [2022-11-23 15:16:34,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1522 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=618, Invalid=2688, Unknown=0, NotChecked=0, Total=3306 [2022-11-23 15:16:34,463 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 507 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 15:16:34,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 150 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 15:16:34,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-23 15:16:34,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 168. [2022-11-23 15:16:34,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.0598802395209581) internal successors, (177), 167 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:16:34,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 177 transitions. [2022-11-23 15:16:34,536 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 177 transitions. Word has length 56 [2022-11-23 15:16:34,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:16:34,536 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 177 transitions. [2022-11-23 15:16:34,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 5.419354838709677) internal successors, (168), 31 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-23 15:16:34,537 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 177 transitions. [2022-11-23 15:16:34,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-23 15:16:34,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:16:34,538 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:16:34,550 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-23 15:16:34,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:16:34,745 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-23 15:16:34,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:16:34,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1558908173, now seen corresponding path program 2 times [2022-11-23 15:16:34,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:16:34,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093246756] [2022-11-23 15:16:34,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:16:34,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:16:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:16:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:16:38,871 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:16:38,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093246756] [2022-11-23 15:16:38,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093246756] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:16:38,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985918896] [2022-11-23 15:16:38,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:16:38,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:16:38,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:16:38,873 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:16:38,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 15:16:39,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-23 15:16:39,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:16:39,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-23 15:16:39,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:17:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:17:30,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:18:53,436 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 4 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:18:53,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985918896] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:18:53,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [828038868] [2022-11-23 15:18:53,441 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 15:18:53,454 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:18:53,455 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:18:53,455 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:18:53,455 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:19:08,986 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:19:20,953 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7734#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (<= 0 (+ ~p3_new~0 1)) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (<= 0 ~id1~0) (= ~p2~0 0) (<= (+ ~p1_new~0 1) 0) (<= |ULTIMATE.start_init_~tmp~0#1| 1) (<= 0 ~mode3~0) (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start_init_#res#1| 1) (<= ~mode2~0 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= 0 ~st2~0) (<= ~mode3~0 1) (<= |ULTIMATE.start_main_~c1~0#1| 1) (<= 0 ~send2~0) (<= ~id1~0 127) (<= ~st1~0 1) (not (<= (+ ~st3~0 ~st2~0 ~st1~0) 2147483647)) (<= 0 (+ ~p2_new~0 1)) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= (+ ~p2_new~0 1) 0) (<= 1 |ULTIMATE.start_init_#res#1|) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 ~mode2~0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= (+ ~p3_new~0 1) 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (<= 0 (+ ~p1_new~0 1)) (<= 0 ~send3~0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-23 15:19:20,953 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:19:20,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:19:20,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 22] total 51 [2022-11-23 15:19:20,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847947844] [2022-11-23 15:19:20,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:19:20,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-23 15:19:20,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:19:20,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-23 15:19:20,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=4362, Unknown=0, NotChecked=0, Total=5256 [2022-11-23 15:19:20,957 INFO L87 Difference]: Start difference. First operand 168 states and 177 transitions. Second operand has 53 states, 52 states have (on average 5.1923076923076925) internal successors, (270), 52 states have internal predecessors, (270), 0 states have call successors, (0), 0 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-23 15:19:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:19:34,980 INFO L93 Difference]: Finished difference Result 371 states and 391 transitions. [2022-11-23 15:19:34,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-23 15:19:34,981 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 5.1923076923076925) internal successors, (270), 52 states have internal predecessors, (270), 0 states have call successors, (0), 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 90 [2022-11-23 15:19:34,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:19:34,981 INFO L225 Difference]: With dead ends: 371 [2022-11-23 15:19:34,982 INFO L226 Difference]: Without dead ends: 0 [2022-11-23 15:19:34,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 199 SyntacticMatches, 8 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3809 ImplicationChecksByTransitivity, 40.1s TimeCoverageRelationStatistics Valid=2000, Invalid=8920, Unknown=0, NotChecked=0, Total=10920 [2022-11-23 15:19:34,986 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1878 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:19:34,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1878 Valid, 302 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-23 15:19:34,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-23 15:19:34,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-23 15:19:34,988 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-23 15:19:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-23 15:19:34,988 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2022-11-23 15:19:34,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:19:34,989 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 15:19:34,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 5.1923076923076925) internal successors, (270), 52 states have internal predecessors, (270), 0 states have call successors, (0), 0 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-23 15:19:34,989 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-23 15:19:34,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-23 15:19:34,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-23 15:19:34,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-23 15:19:34,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-23 15:19:34,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-23 15:19:34,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-23 15:19:34,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-23 15:19:34,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-23 15:19:34,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-23 15:19:34,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-23 15:19:34,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-23 15:19:34,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-23 15:19:34,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-23 15:19:34,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-23 15:19:34,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-23 15:19:35,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 15:19:35,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 15:19:35,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-23 15:19:40,952 WARN L233 SmtUtils]: Spent 5.75s on a formula simplification. DAG size of input: 581 DAG size of output: 575 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-23 15:19:48,291 WARN L233 SmtUtils]: Spent 7.33s on a formula simplification. DAG size of input: 575 DAG size of output: 525 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-23 15:20:01,122 WARN L233 SmtUtils]: Spent 12.83s on a formula simplification. DAG size of input: 554 DAG size of output: 550 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-23 15:20:13,810 WARN L233 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 575 DAG size of output: 234 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-23 15:20:20,091 WARN L233 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 525 DAG size of output: 171 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-23 15:20:27,241 WARN L233 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 550 DAG size of output: 165 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-23 15:20:31,808 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-23 15:20:31,808 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-23 15:20:31,809 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-23 15:20:31,809 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-23 15:20:31,809 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-23 15:20:31,809 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-23 15:20:31,809 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-23 15:20:31,809 INFO L899 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-11-23 15:20:31,809 INFO L899 garLoopResultBuilder]: For program point L207-1(line 207) no Hoare annotation was computed. [2022-11-23 15:20:31,810 INFO L899 garLoopResultBuilder]: For program point L207-2(line 207) no Hoare annotation was computed. [2022-11-23 15:20:31,810 INFO L899 garLoopResultBuilder]: For program point L207-3(line 207) no Hoare annotation was computed. [2022-11-23 15:20:31,810 INFO L899 garLoopResultBuilder]: For program point L207-4(lines 207 226) no Hoare annotation was computed. [2022-11-23 15:20:31,811 INFO L895 garLoopResultBuilder]: At program point L207-5(lines 207 226) the Hoare annotation is: (let ((.cse39 (= ~mode3~0 1)) (.cse20 (= ~mode3~0 0)) (.cse1 (= ~mode2~0 0)) (.cse40 (= ~mode2~0 1))) (let ((.cse19 (= ~mode1~0 0)) (.cse0 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse2 (<= 0 ~id3~0)) (.cse3 (= ~nomsg~0 ~p1_new~0)) (.cse4 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse5 (<= |ULTIMATE.start_check_~tmp~1#1| 1)) (.cse6 (= ~p2~0 0)) (.cse7 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse8 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse9 (= ~p3_new~0 ~nomsg~0)) (.cse10 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse11 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse12 (<= (+ ~st3~0 ~st2~0 ~st1~0) 1)) (.cse13 (= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse14 (<= |ULTIMATE.start_main_~c1~0#1| 1)) (.cse15 (or (= ~st1~0 1) (= ~st1~0 0))) (.cse16 (<= ~id1~0 127)) (.cse18 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse21 (<= 0 |ULTIMATE.start_check_~tmp~1#1|)) (.cse22 (let ((.cse46 (<= 0 ~st2~0)) (.cse48 (<= 0 ~send2~0))) (or (let ((.cse45 (+ ~p2_old~0 1))) (and .cse1 (<= 0 .cse45) (let ((.cse47 (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|))) (or (and .cse46 (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) .cse47) (and .cse48 (or (= ~st2~0 1) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) .cse46)) (not .cse47)))) (<= .cse45 0))) (and (exists ((v_~p2_new~0_82 Int)) (let ((.cse49 (+ v_~p2_new~0_82 1))) (and (<= .cse49 0) (= (let ((.cse50 (mod (ite (and (= v_~p2_new~0_82 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_82) 256))) (ite (<= .cse50 127) .cse50 (+ (- 256) .cse50))) ~p2_old~0) (<= 0 .cse49)))) .cse40 .cse46 .cse48 (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|))))) (.cse23 (<= ~id3~0 127)) (.cse24 (or (and .cse39 (exists ((v_~p3_new~0_74 Int)) (let ((.cse41 (+ v_~p3_new~0_74 1))) (and (<= 0 .cse41) (<= .cse41 0) (= (let ((.cse42 (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_74 ~nomsg~0)) ~send3~0 v_~p3_new~0_74) 256))) (ite (<= .cse42 127) .cse42 (+ (- 256) .cse42))) ~p3_old~0)))) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|)) (let ((.cse43 (+ ~p3_old~0 1))) (and (<= 0 .cse43) (<= .cse43 0) (let ((.cse44 (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (or (and .cse44 (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|)) (and (or (= ~st3~0 1) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (not .cse44)))) .cse20)))) (.cse25 (<= 0 ~id2~0)) (.cse26 (= |#NULL.offset| 0)) (.cse27 (<= ~id2~0 127)) (.cse28 (<= 0 ~st3~0)) (.cse29 (<= (+ ~p3_new~0 1) 0)) (.cse30 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse31 (= ~p3~0 0)) (.cse32 (<= 0 (+ ~p1_new~0 1))) (.cse33 (<= 0 ~send3~0)) (.cse34 (= ~p1~0 0)) (.cse35 (<= 0 |#StackHeapBarrier|)) (.cse36 (<= 0 ~send1~0)) (.cse37 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse38 (= |#NULL.base| 0))) (or (let ((.cse17 (+ ~p2_new~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 ~id1~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~nomsg~0 ~p1_old~0) (<= 0 .cse17) (<= .cse17 0) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38)) (and (= |ULTIMATE.start_check_~tmp~1#1| 0) .cse19) (and .cse0 .cse39 .cse2 .cse3 .cse40 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ ~nomsg~0 1) ~id1~0) (= ~mode1~0 1) .cse15 .cse16 (= ~nomsg~0 ~p2_new~0) .cse18 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38)))) [2022-11-23 15:20:31,812 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-23 15:20:31,812 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 75) no Hoare annotation was computed. [2022-11-23 15:20:31,813 INFO L895 garLoopResultBuilder]: At program point L59-2(lines 53 78) the Hoare annotation is: (let ((.cse50 (+ ~nomsg~0 1)) (.cse51 (+ ~p2_new~0 1)) (.cse44 (= ~st1~0 0)) (.cse49 (+ ~p3_new~0 1)) (.cse47 (= ~st2~0 0))) (let ((.cse4 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse0 (or (= ~st2~0 1) .cse47)) (.cse5 (<= 0 ~id3~0)) (.cse6 (<= 0 .cse49)) (.cse9 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse10 (<= 0 ~id1~0)) (.cse40 (= ~p2~0 0)) (.cse13 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse14 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse15 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse17 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse42 (= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse1 (<= |ULTIMATE.start_main_~c1~0#1| 1)) (.cse2 (<= 0 ~send2~0)) (.cse43 (= ~mode1~0 1)) (.cse3 (or (= ~st1~0 1) .cse44)) (.cse22 (<= ~id1~0 127)) (.cse45 (= ~nomsg~0 ~p1_old~0)) (.cse23 (<= 0 .cse51)) (.cse46 (<= .cse50 0)) (.cse24 (<= .cse51 0)) (.cse25 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse26 (<= ~id3~0 127)) (.cse27 (<= 0 ~id2~0)) (.cse28 (= |#NULL.offset| 0)) (.cse48 (<= 0 .cse50)) (.cse29 (<= ~id2~0 127)) (.cse30 (<= 0 ~st3~0)) (.cse31 (<= .cse49 0)) (.cse32 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse33 (= ~p3~0 0)) (.cse34 (<= 0 ~send3~0)) (.cse35 (= ~p1~0 0)) (.cse36 (<= 0 |#StackHeapBarrier|)) (.cse37 (<= 0 ~send1~0)) (.cse38 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse39 (= |#NULL.base| 0))) (or (let ((.cse21 (+ ~p1_new~0 1))) (and (= ~mode3~0 1) .cse0 (= ~nomsg~0 ~p1_new~0) (= ~mode2~0 1) (<= |ULTIMATE.start_check_~tmp~1#1| 1) .cse1 .cse2 .cse3 (let ((.cse7 (<= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse11 (<= 0 |ULTIMATE.start_main_~i2~0#1|)) (.cse12 (<= .cse21 0)) (.cse18 (<= 0 ~p2~0)) (.cse20 (<= ~p2~0 0))) (or (let ((.cse16 (+ ~p3_old~0 1)) (.cse19 (+ ~p2_old~0 1)) (.cse8 (+ ~p1_old~0 1))) (and .cse4 (<= ~send3~0 127) .cse5 .cse6 (<= ~st3~0 0) .cse7 (<= 0 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~send1~0 127) .cse14 (<= ~st1~0 0) .cse15 (<= 0 .cse16) .cse17 .cse18 (<= 0 .cse19) (<= .cse16 0) (<= ~send2~0 127) (<= ~st2~0 0) .cse20 (<= |ULTIMATE.start_main_~c1~0#1| 0) (<= .cse19 0) (<= .cse8 0))) (and .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_assert_#in~arg#1| 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 |ULTIMATE.start_assert_~arg#1|) .cse17 .cse18 (<= |ULTIMATE.start_assert_~arg#1| 1) (<= 0 |ULTIMATE.start_check_#res#1|) .cse20 (<= |ULTIMATE.start_check_#res#1| 1) (<= 0 |ULTIMATE.start_assert_#in~arg#1|)))) .cse22 .cse23 .cse24 .cse25 (= ~mode1~0 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|) .cse26 (<= ~st3~0 1) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (<= 0 .cse21) .cse34 .cse35 .cse36 .cse37 .cse38 .cse39)) (let ((.cse41 (+ ~st3~0 ~st1~0))) (and .cse4 .cse6 .cse9 (= (mod ~mode2~0 256) 0) .cse40 .cse13 .cse14 (= ~send3~0 ~id3~0) .cse15 (not (= ~id3~0 ~id2~0)) (<= 0 .cse41) .cse17 (not (= ~id1~0 ~id3~0)) .cse42 (= (* 256 (div ~mode3~0 256)) ~mode3~0) .cse1 .cse43 .cse22 .cse44 (not (= ~id1~0 ~id2~0)) .cse45 .cse23 .cse46 .cse24 .cse25 (= ~send1~0 ~id1~0) (<= .cse41 0) (<= ~r1~0 (* (div ~r1~0 256) 256)) .cse26 .cse27 .cse28 .cse47 .cse48 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 (= ~send2~0 ~id2~0) .cse39)) (and .cse4 (= ~mode2~0 0) .cse0 .cse5 .cse6 .cse9 .cse10 .cse40 .cse13 .cse14 .cse15 (= ~nomsg~0 ~p2_old~0) .cse17 (<= (+ ~st3~0 ~st2~0 ~st1~0) 1) .cse42 .cse1 .cse2 .cse43 .cse3 .cse22 .cse45 .cse23 .cse46 .cse24 .cse25 (= ~mode3~0 0) .cse26 .cse27 .cse28 .cse48 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39)))) [2022-11-23 15:20:31,814 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 223) no Hoare annotation was computed. [2022-11-23 15:20:31,814 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-23 15:20:31,814 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2022-11-23 15:20:31,814 INFO L899 garLoopResultBuilder]: For program point L60-1(line 60) no Hoare annotation was computed. [2022-11-23 15:20:31,815 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-23 15:20:31,816 INFO L895 garLoopResultBuilder]: At program point L259-2(lines 259 273) the Hoare annotation is: (let ((.cse83 (+ ~p2_old~0 1)) (.cse84 (+ ~p3_old~0 1)) (.cse68 (+ ~p1_new~0 1)) (.cse69 (+ ~p3_new~0 1)) (.cse73 (+ ~p1_old~0 1))) (let ((.cse71 (+ ~p2_new~0 1)) (.cse70 (+ ~nomsg~0 1)) (.cse37 (<= ~st3~0 0)) (.cse45 (<= ~st1~0 0)) (.cse50 (<= 0 ~st1~0)) (.cse65 (<= |ULTIMATE.start_main_~c1~0#1| 0)) (.cse67 (<= .cse73 0)) (.cse61 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse35 (<= 0 .cse69)) (.cse38 (<= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse39 (<= |ULTIMATE.start_assert_#in~arg#1| 1)) (.cse40 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse41 (<= 0 |ULTIMATE.start_main_~i2~0#1|)) (.cse42 (<= .cse68 0)) (.cse43 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse44 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse46 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse48 (<= 0 |ULTIMATE.start_assert_~arg#1|)) (.cse49 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse52 (<= 0 ~p2~0)) (.cse54 (<= |ULTIMATE.start_assert_~arg#1| 1)) (.cse56 (<= ~p2~0 0)) (.cse58 (<= |ULTIMATE.start_check_#res#1| 1)) (.cse60 (<= 0 |ULTIMATE.start_assert_#in~arg#1|)) (.cse30 (= ~mode3~0 1)) (.cse62 (<= 0 .cse84)) (.cse64 (<= .cse84 0)) (.cse10 (= ~mode3~0 0)) (.cse0 (= ~mode2~0 0)) (.cse63 (<= 0 .cse83)) (.cse66 (<= .cse83 0)) (.cse31 (= ~mode2~0 1))) (let ((.cse2 (<= (+ ~st3~0 ~st2~0 ~st1~0) 1)) (.cse4 (or (= ~st1~0 1) (= ~st1~0 0))) (.cse11 (<= 0 |ULTIMATE.start_check_~tmp~1#1|)) (.cse12 (let ((.cse78 (<= 0 ~st2~0)) (.cse80 (<= 0 ~send2~0))) (or (and .cse0 .cse63 (let ((.cse79 (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|))) (or (and .cse78 (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) .cse79) (and .cse80 (or (= ~st2~0 1) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) .cse78)) (not .cse79)))) .cse66) (and (exists ((v_~p2_new~0_82 Int)) (let ((.cse81 (+ v_~p2_new~0_82 1))) (and (<= .cse81 0) (= (let ((.cse82 (mod (ite (and (= v_~p2_new~0_82 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_82) 256))) (ite (<= .cse82 127) .cse82 (+ (- 256) .cse82))) ~p2_old~0) (<= 0 .cse81)))) .cse31 .cse78 .cse80 (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|))))) (.cse14 (or (and .cse30 (exists ((v_~p3_new~0_74 Int)) (let ((.cse75 (+ v_~p3_new~0_74 1))) (and (<= 0 .cse75) (<= .cse75 0) (= (let ((.cse76 (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_74 ~nomsg~0)) ~send3~0 v_~p3_new~0_74) 256))) (ite (<= .cse76 127) .cse76 (+ (- 256) .cse76))) ~p3_old~0)))) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|)) (and .cse62 .cse64 (let ((.cse77 (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (or (and .cse77 (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|)) (and (or (= ~st3~0 1) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (not .cse77)))) .cse10))) (.cse16 (= |#NULL.offset| 0)) (.cse21 (= ~p3~0 0)) (.cse24 (let ((.cse72 (<= 0 ~id3~0)) (.cse74 (<= 0 ~id1~0))) (or (and .cse61 (<= ~send3~0 127) .cse72 .cse35 .cse37 .cse38 (<= 0 .cse73) .cse40 .cse74 .cse41 .cse42 .cse43 (<= ~send1~0 127) .cse44 .cse45 .cse46 .cse49 .cse50 .cse52 .cse64 (<= ~send2~0 127) (<= ~st2~0 0) .cse56 .cse65 .cse66 .cse67) (and .cse61 .cse72 .cse35 .cse38 .cse39 .cse40 .cse74 .cse41 .cse42 .cse43 .cse44 .cse46 .cse48 .cse49 .cse52 .cse54 (<= 0 |ULTIMATE.start_check_#res#1|) .cse56 .cse58 .cse60)))) (.cse25 (= ~p1~0 0)) (.cse29 (= |#NULL.base| 0)) (.cse1 (<= |ULTIMATE.start_check_~tmp~1#1| 1)) (.cse3 (<= |ULTIMATE.start_main_~c1~0#1| 1)) (.cse32 (<= .cse70 0)) (.cse5 (<= ~id1~0 127)) (.cse7 (<= 0 .cse71)) (.cse8 (<= .cse71 0)) (.cse9 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse13 (<= ~id3~0 127)) (.cse33 (<= 0 .cse70)) (.cse17 (<= ~id2~0 127)) (.cse18 (<= 0 ~st3~0)) (.cse19 (<= .cse69 0)) (.cse20 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse22 (<= 0 .cse68)) (.cse23 (<= 0 ~send3~0)) (.cse26 (<= 0 |#StackHeapBarrier|)) (.cse27 (<= 0 ~send1~0)) (.cse28 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse6 (= ~nomsg~0 ~p1_old~0)) (.cse15 (<= 0 ~id2~0))) (or (and .cse0 .cse1 (= ~p3_new~0 ~nomsg~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~mode1~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse30 .cse31 .cse1 .cse2 .cse3 (= ~mode1~0 1) .cse4 .cse5 .cse7 .cse32 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse33 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and (= (mod ~mode2~0 256) 0) (= ~send3~0 ~id3~0) (not (= ~id3~0 ~id2~0)) (= (mod ~mode1~0 256) 0) (not (= ~id1~0 ~id3~0)) (let ((.cse34 (<= ~p3~0 0)) (.cse36 (<= 0 |#NULL.base|)) (.cse47 (<= |#NULL.offset| 0)) (.cse51 (<= ~p1~0 0)) (.cse53 (<= 0 ~p3~0)) (.cse55 (<= |#NULL.base| 0)) (.cse57 (<= 0 |#NULL.offset|)) (.cse59 (<= 0 ~p1~0))) (or (and .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse1 (<= 1 |ULTIMATE.start_check_#res#1|) .cse41 .cse42 .cse43 (<= 0 ~mode3~0) .cse44 .cse45 .cse46 .cse47 .cse48 (<= ~mode2~0 1) .cse49 .cse50 .cse51 (<= ~mode3~0 1) .cse52 .cse53 .cse3 (<= 1 |ULTIMATE.start_check_~tmp~1#1|) (<= 1 |ULTIMATE.start_main_~c1~0#1|) .cse5 .cse7 .cse54 .cse32 (<= ~mode1~0 1) .cse8 .cse9 .cse55 .cse13 .cse33 .cse56 (<= 0 ~mode2~0) .cse17 .cse18 .cse19 .cse57 .cse20 .cse22 .cse23 .cse58 .cse59 .cse26 .cse27 .cse28 .cse60) (and .cse61 .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse62 .cse47 .cse49 .cse50 .cse51 .cse52 .cse53 .cse63 .cse5 .cse64 .cse7 .cse8 .cse9 .cse55 .cse13 .cse33 .cse56 .cse17 .cse18 .cse19 .cse57 .cse20 .cse65 .cse66 .cse22 .cse67 .cse23 .cse59 .cse26 .cse27 .cse28))) (= (* 256 (div ~mode3~0 256)) ~mode3~0) (not (= ~id1~0 ~id2~0)) .cse6 (= ~send1~0 ~id1~0) (<= ~r1~0 (* (div ~r1~0 256) 256)) .cse15 (= ~st2~0 0) (= ~send2~0 ~id2~0)))))) [2022-11-23 15:20:31,817 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 60) no Hoare annotation was computed. [2022-11-23 15:20:31,817 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 60) no Hoare annotation was computed. [2022-11-23 15:20:31,817 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-23 15:20:31,817 INFO L899 garLoopResultBuilder]: For program point L211-1(line 211) no Hoare annotation was computed. [2022-11-23 15:20:31,817 INFO L899 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2022-11-23 15:20:31,818 INFO L899 garLoopResultBuilder]: For program point L211-3(line 211) no Hoare annotation was computed. [2022-11-23 15:20:31,818 INFO L899 garLoopResultBuilder]: For program point L211-4(lines 211 223) no Hoare annotation was computed. [2022-11-23 15:20:31,819 INFO L895 garLoopResultBuilder]: At program point L212(lines 208 223) the Hoare annotation is: (let ((.cse39 (+ ~p1_new~0 1)) (.cse37 (= ~mode3~0 1)) (.cse19 (= ~mode3~0 0)) (.cse1 (= ~mode2~0 0)) (.cse38 (= ~mode2~0 1)) (.cse50 (+ ~p2_new~0 1))) (let ((.cse0 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse2 (<= 0 ~id3~0)) (.cse3 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse4 (<= 0 ~id1~0)) (.cse5 (= ~p2~0 0)) (.cse6 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse7 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse8 (= ~p3_new~0 ~nomsg~0)) (.cse9 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse10 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse11 (<= (+ ~st3~0 ~st2~0 ~st1~0) 1)) (.cse12 (= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse13 (<= |ULTIMATE.start_main_~c1~0#1| 1)) (.cse14 (or (= ~st1~0 1) (= ~st1~0 0))) (.cse15 (<= ~id1~0 127)) (.cse16 (<= 0 .cse50)) (.cse17 (<= .cse50 0)) (.cse18 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse20 (let ((.cse45 (<= 0 ~st2~0)) (.cse47 (<= 0 ~send2~0))) (or (let ((.cse44 (+ ~p2_old~0 1))) (and .cse1 (<= 0 .cse44) (let ((.cse46 (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|))) (or (and .cse45 (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) .cse46) (and .cse47 (or (= ~st2~0 1) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) .cse45)) (not .cse46)))) (<= .cse44 0))) (and (exists ((v_~p2_new~0_82 Int)) (let ((.cse48 (+ v_~p2_new~0_82 1))) (and (<= .cse48 0) (= (let ((.cse49 (mod (ite (and (= v_~p2_new~0_82 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_82) 256))) (ite (<= .cse49 127) .cse49 (+ (- 256) .cse49))) ~p2_old~0) (<= 0 .cse48)))) .cse38 .cse45 .cse47 (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|))))) (.cse21 (<= ~id3~0 127)) (.cse22 (or (and .cse37 (exists ((v_~p3_new~0_74 Int)) (let ((.cse40 (+ v_~p3_new~0_74 1))) (and (<= 0 .cse40) (<= .cse40 0) (= (let ((.cse41 (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_74 ~nomsg~0)) ~send3~0 v_~p3_new~0_74) 256))) (ite (<= .cse41 127) .cse41 (+ (- 256) .cse41))) ~p3_old~0)))) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|)) (let ((.cse42 (+ ~p3_old~0 1))) (and (<= 0 .cse42) (<= .cse42 0) (let ((.cse43 (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (or (and .cse43 (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|)) (and (or (= ~st3~0 1) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (not .cse43)))) .cse19)))) (.cse23 (<= 0 ~id2~0)) (.cse24 (= |#NULL.offset| 0)) (.cse25 (<= ~id2~0 127)) (.cse26 (<= 0 ~st3~0)) (.cse27 (<= (+ ~p3_new~0 1) 0)) (.cse28 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse29 (= ~p3~0 0)) (.cse30 (<= 0 .cse39)) (.cse31 (<= 0 ~send3~0)) (.cse32 (= ~p1~0 0)) (.cse33 (<= 0 |#StackHeapBarrier|)) (.cse34 (<= 0 ~send1~0)) (.cse35 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse36 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 (= ~nomsg~0 ~p1_new~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~nomsg~0 ~p1_old~0) .cse16 .cse17 .cse18 (= ~mode1~0 0) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) (and .cse0 .cse37 .cse2 .cse38 .cse3 .cse4 .cse5 (<= .cse39 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~mode1~0 1) .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 (<= 0 (+ ~nomsg~0 1)) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36)))) [2022-11-23 15:20:31,819 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-23 15:20:31,819 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-23 15:20:31,819 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-23 15:20:31,820 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-23 15:20:31,820 INFO L899 garLoopResultBuilder]: For program point L216(line 216) no Hoare annotation was computed. [2022-11-23 15:20:31,820 INFO L899 garLoopResultBuilder]: For program point L216-1(line 216) no Hoare annotation was computed. [2022-11-23 15:20:31,820 INFO L899 garLoopResultBuilder]: For program point L216-2(line 216) no Hoare annotation was computed. [2022-11-23 15:20:31,820 INFO L899 garLoopResultBuilder]: For program point L216-3(line 216) no Hoare annotation was computed. [2022-11-23 15:20:31,823 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:20:31,826 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 15:20:31,838 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,839 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,839 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,840 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,840 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,840 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,841 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,841 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,841 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,842 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,842 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,842 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,842 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,843 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,843 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,843 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,844 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,844 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,845 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,845 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,845 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,846 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,846 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,846 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,847 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,847 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,847 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,847 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,848 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,848 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,848 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,849 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,863 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,863 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,863 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,864 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,864 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,864 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,865 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,865 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,865 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,866 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,866 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,866 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,866 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,867 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,867 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,867 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,868 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,868 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,869 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,869 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,869 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,870 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,870 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,870 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,870 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,871 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,871 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,871 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,872 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,872 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,872 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,872 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,880 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,880 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,880 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,881 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,881 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,881 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,882 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,882 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,882 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,882 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,883 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,883 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,883 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,884 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,884 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,884 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,885 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,885 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,885 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,886 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,886 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,886 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,887 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,887 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,887 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,887 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,888 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,888 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,888 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,888 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,889 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,889 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,891 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,892 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,892 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,892 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,893 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,893 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,893 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,894 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,894 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,894 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,894 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,895 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,895 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,895 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,895 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,896 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,896 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,897 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,897 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,897 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,897 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,898 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,898 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,898 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,899 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,899 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,899 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,899 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,900 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,900 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,900 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,900 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,906 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,906 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,906 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,907 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,907 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,907 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,908 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,908 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,908 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,909 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,909 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,909 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,909 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,910 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,910 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,910 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,911 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,911 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,911 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,911 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,912 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,912 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,912 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,913 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,913 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,913 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,913 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,914 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,914 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,914 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,918 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,918 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,918 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,918 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,919 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,919 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,919 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,920 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,920 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,920 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,920 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,921 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,921 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,921 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,922 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,922 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,922 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,922 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,923 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,923 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,923 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:31,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:31,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:20:31 BoogieIcfgContainer [2022-11-23 15:20:31,927 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 15:20:31,928 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 15:20:31,928 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 15:20:31,928 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 15:20:31,929 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:12:08" (3/4) ... [2022-11-23 15:20:31,932 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-23 15:20:31,943 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2022-11-23 15:20:31,944 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-23 15:20:31,944 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-23 15:20:31,945 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-23 15:20:31,970 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((mode2 == 0 && tmp <= 1) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && c1 <= 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && mode3 == 0) && 0 <= tmp) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && unknown-#in~cond-unknown <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && ((((((((((((((((((((((((((0 <= c1 && send3 <= 127) && 0 <= id3) && 0 <= p3_new + 1) && st3 <= 0) && i2 <= 0) && 0 <= p1_\old + 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && send1 <= 127) && 1 <= cond) && st1 <= 0) && \result <= 1) && 1 <= unknown-#in~cond-unknown) && 0 <= st1) && 0 <= p2) && p3_\old + 1 <= 0) && send2 <= 127) && st2 <= 0) && p2 <= 0) && c1 <= 0) && p2_\old + 1 <= 0) && p1_\old + 1 <= 0) || (((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && i2 <= 0) && unknown-#in~arg-unknown <= 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && 0 <= arg) && 1 <= unknown-#in~cond-unknown) && 0 <= p2) && arg <= 1) && 0 <= \result) && p2 <= 0) && \result <= 1) && 0 <= unknown-#in~arg-unknown))) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((mode3 == 1 && mode2 == 1) && tmp <= 1) && st3 + st2 + st1 <= 1) && c1 <= 1) && mode1 == 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && 0 <= tmp) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && unknown-#in~cond-unknown <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && ((((((((((((((((((((((((((0 <= c1 && send3 <= 127) && 0 <= id3) && 0 <= p3_new + 1) && st3 <= 0) && i2 <= 0) && 0 <= p1_\old + 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && send1 <= 127) && 1 <= cond) && st1 <= 0) && \result <= 1) && 1 <= unknown-#in~cond-unknown) && 0 <= st1) && 0 <= p2) && p3_\old + 1 <= 0) && send2 <= 127) && st2 <= 0) && p2 <= 0) && c1 <= 0) && p2_\old + 1 <= 0) && p1_\old + 1 <= 0) || (((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && i2 <= 0) && unknown-#in~arg-unknown <= 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && 0 <= arg) && 1 <= unknown-#in~cond-unknown) && 0 <= p2) && arg <= 1) && 0 <= \result) && p2 <= 0) && \result <= 1) && 0 <= unknown-#in~arg-unknown))) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0)) || (((((((((((((mode2 % 256 == 0 && send3 == id3) && !(id3 == id2)) && mode1 % 256 == 0) && !(id1 == id3)) && (((((((((((((((((((((((((((((((((((((((((((((((((((((p3 <= 0 && 0 <= p3_new + 1) && 0 <= #NULL) && st3 <= 0) && i2 <= 0) && unknown-#in~arg-unknown <= 1) && 1 <= tmp) && tmp <= 1) && 1 <= \result) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && st1 <= 0) && \result <= 1) && #NULL <= 0) && 0 <= arg) && mode2 <= 1) && 1 <= unknown-#in~cond-unknown) && 0 <= st1) && p1 <= 0) && mode3 <= 1) && 0 <= p2) && 0 <= p3) && c1 <= 1) && 1 <= tmp) && 1 <= c1) && id1 <= 127) && 0 <= p2_new + 1) && arg <= 1) && nomsg + 1 <= 0) && mode1 <= 1) && p2_new + 1 <= 0) && 1 <= \result) && #NULL <= 0) && id3 <= 127) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && 0 <= #NULL) && unknown-#in~cond-unknown <= 1) && 0 <= p1_new + 1) && 0 <= send3) && \result <= 1) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && 0 <= unknown-#in~arg-unknown) || (((((((((((((((((((((((((((((((((((((((((((0 <= c1 && p3 <= 0) && 0 <= p3_new + 1) && 0 <= #NULL) && st3 <= 0) && i2 <= 0) && 1 <= tmp) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && st1 <= 0) && \result <= 1) && 0 <= p3_\old + 1) && #NULL <= 0) && 1 <= unknown-#in~cond-unknown) && 0 <= st1) && p1 <= 0) && 0 <= p2) && 0 <= p3) && 0 <= p2_\old + 1) && id1 <= 127) && p3_\old + 1 <= 0) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && #NULL <= 0) && id3 <= 127) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && 0 <= #NULL) && unknown-#in~cond-unknown <= 1) && c1 <= 0) && p2_\old + 1 <= 0) && 0 <= p1_new + 1) && p1_\old + 1 <= 0) && 0 <= send3) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1))) && 256 * (mode3 / 256) == mode3) && !(id1 == id2)) && nomsg == p1_\old) && send1 == id1) && r1 <= r1 / 256 * 256) && 0 <= id2) && st2 == 0) && send2 == id2) [2022-11-23 15:20:31,971 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((mode3 == 1 && (st2 == 1 || st2 == 0)) && nomsg == p1_new) && mode2 == 1) && tmp <= 1) && c1 <= 1) && 0 <= send2) && (st1 == 1 || st1 == 0)) && (((((((((((((((((((((((((((0 <= c1 && send3 <= 127) && 0 <= id3) && 0 <= p3_new + 1) && st3 <= 0) && i2 <= 0) && 0 <= p1_\old + 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && send1 <= 127) && 1 <= cond) && st1 <= 0) && \result <= 1) && 0 <= p3_\old + 1) && 1 <= unknown-#in~cond-unknown) && 0 <= p2) && 0 <= p2_\old + 1) && p3_\old + 1 <= 0) && send2 <= 127) && st2 <= 0) && p2 <= 0) && c1 <= 0) && p2_\old + 1 <= 0) && p1_\old + 1 <= 0) || (((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && i2 <= 0) && unknown-#in~arg-unknown <= 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && 0 <= arg) && 1 <= unknown-#in~cond-unknown) && 0 <= p2) && arg <= 1) && 0 <= \result) && p2 <= 0) && \result <= 1) && 0 <= unknown-#in~arg-unknown))) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && 0 <= tmp) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && unknown-#in~cond-unknown <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= p3_new + 1) && 1 <= tmp) && mode2 % 256 == 0) && p2 == 0) && tmp <= 1) && 1 <= cond) && send3 == id3) && \result <= 1) && !(id3 == id2)) && 0 <= st3 + st1) && 1 <= unknown-#in~cond-unknown) && !(id1 == id3)) && i2 == 0) && 256 * (mode3 / 256) == mode3) && c1 <= 1) && mode1 == 1) && id1 <= 127) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && send1 == id1) && st3 + st1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && st2 == 0) && 0 <= nomsg + 1) && id2 <= 127) && p3_new + 1 <= 0) && unknown-#in~cond-unknown <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && send2 == id2) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && (st2 == 1 || st2 == 0)) && 0 <= id3) && 0 <= p3_new + 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && nomsg == p2_\old) && 1 <= unknown-#in~cond-unknown) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && 0 <= send2) && mode1 == 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode3 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && unknown-#in~cond-unknown <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) [2022-11-23 15:20:31,972 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && 0 <= id3) && nomsg == p1_new) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= unknown-#in~cond-unknown) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && mode3 == 0) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && unknown-#in~cond-unknown <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((0 <= c1 && mode3 == 1) && 0 <= id3) && mode2 == 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= unknown-#in~cond-unknown) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && mode1 == 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && unknown-#in~cond-unknown <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) [2022-11-23 15:20:31,972 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && 0 <= id3) && nomsg == p1_new) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= unknown-#in~cond-unknown) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && mode3 == 0) && 0 <= tmp) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && unknown-#in~cond-unknown <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (tmp == 0 && mode1 == 0)) || (((((((((((((((((((((((((((((((((((((((0 <= c1 && mode3 == 1) && 0 <= id3) && nomsg == p1_new) && mode2 == 1) && 1 <= tmp) && tmp <= 1) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= unknown-#in~cond-unknown) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && nomsg + 1 <= id1) && mode1 == 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p2_new) && 1 <= \result) && 0 <= tmp) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && unknown-#in~cond-unknown <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) [2022-11-23 15:20:31,995 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 15:20:31,995 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 15:20:31,996 INFO L158 Benchmark]: Toolchain (without parser) took 505278.71ms. Allocated memory was 146.8MB in the beginning and 700.4MB in the end (delta: 553.6MB). Free memory was 104.0MB in the beginning and 410.1MB in the end (delta: -306.1MB). Peak memory consumption was 250.4MB. Max. memory is 16.1GB. [2022-11-23 15:20:31,996 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 113.2MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:20:31,997 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.55ms. Allocated memory is still 146.8MB. Free memory was 103.7MB in the beginning and 91.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 15:20:31,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.64ms. Allocated memory is still 146.8MB. Free memory was 91.1MB in the beginning and 89.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:20:31,997 INFO L158 Benchmark]: Boogie Preprocessor took 50.70ms. Allocated memory is still 146.8MB. Free memory was 89.0MB in the beginning and 87.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:20:31,998 INFO L158 Benchmark]: RCFGBuilder took 1165.03ms. Allocated memory is still 146.8MB. Free memory was 87.3MB in the beginning and 83.4MB in the end (delta: 3.9MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2022-11-23 15:20:31,998 INFO L158 Benchmark]: TraceAbstraction took 503445.98ms. Allocated memory was 146.8MB in the beginning and 700.4MB in the end (delta: 553.6MB). Free memory was 82.6MB in the beginning and 415.4MB in the end (delta: -332.8MB). Peak memory consumption was 412.4MB. Max. memory is 16.1GB. [2022-11-23 15:20:31,998 INFO L158 Benchmark]: Witness Printer took 67.55ms. Allocated memory is still 700.4MB. Free memory was 415.4MB in the beginning and 410.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-23 15:20:32,000 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.34ms. Allocated memory is still 113.2MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 485.55ms. Allocated memory is still 146.8MB. Free memory was 103.7MB in the beginning and 91.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.64ms. Allocated memory is still 146.8MB. Free memory was 91.1MB in the beginning and 89.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.70ms. Allocated memory is still 146.8MB. Free memory was 89.0MB in the beginning and 87.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1165.03ms. Allocated memory is still 146.8MB. Free memory was 87.3MB in the beginning and 83.4MB in the end (delta: 3.9MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * TraceAbstraction took 503445.98ms. Allocated memory was 146.8MB in the beginning and 700.4MB in the end (delta: 553.6MB). Free memory was 82.6MB in the beginning and 415.4MB in the end (delta: -332.8MB). Peak memory consumption was 412.4MB. Max. memory is 16.1GB. * Witness Printer took 67.55ms. Allocated memory is still 700.4MB. Free memory was 415.4MB in the beginning and 410.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] * 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: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: 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, 38 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 503.3s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 56.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 56.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4518 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4518 mSDsluCounter, 1417 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 998 mSDsCounter, 476 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4677 IncrementalHoareTripleChecker+Invalid, 5153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 476 mSolverCounterUnsat, 419 mSDtfsCounter, 4677 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1209 GetRequests, 738 SyntacticMatches, 20 SemanticMatches, 451 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10779 ImplicationChecksByTransitivity, 144.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=15, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 462 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 85 NumberOfFragments, 3341 HoareAnnotationTreeSize, 5 FomulaSimplifications, 334565 FormulaSimplificationTreeSizeReduction, 30.4s HoareSimplificationTime, 5 FomulaSimplificationsInter, 463375 FormulaSimplificationTreeSizeReductionInter, 26.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 200.3s InterpolantComputationTime, 862 NumberOfCodeBlocks, 862 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1156 ConstructedInterpolants, 0 QuantifiedInterpolants, 98166 SizeOfPredicates, 295 NumberOfNonLiveVariables, 1774 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 33 InterpolantComputations, 10 PerfectInterpolantSequences, 88/1032 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: 28.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 72, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 283, TOOLS_POST_TIME: 25.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: 279, TOOLS_QUANTIFIERELIM_TIME: 25.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.9s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 354, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 41, DOMAIN_JOIN_TIME: 1.8s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 4, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 10, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 72, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 6, LOOP_SUMMARIZER_CACHE_MISSES: 6, LOOP_SUMMARIZER_OVERALL_TIME: 17.8s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 17.8s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 10, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 3831, DAG_COMPRESSION_RETAINED_NODES: 213, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 259]: Loop Invariant [2022-11-23 15:20:32,030 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,030 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,030 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,031 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,031 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,031 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,031 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,032 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,032 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,032 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,032 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,033 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,033 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,033 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,033 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,034 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,034 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,034 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,035 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,035 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,035 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,036 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,036 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,036 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,036 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,037 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,037 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,037 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,037 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,038 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,038 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,038 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,041 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,041 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,042 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,042 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,042 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,042 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,047 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,047 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,047 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,048 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,048 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,048 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,048 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,049 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,049 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,049 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,050 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,050 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,051 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,051 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,051 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,051 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,052 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,052 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,053 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,053 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,053 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,053 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,054 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,054 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,054 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,055 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((mode2 == 0 && tmp <= 1) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && c1 <= 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && mode3 == 0) && 0 <= tmp) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && unknown-#in~cond-unknown <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && ((((((((((((((((((((((((((0 <= c1 && send3 <= 127) && 0 <= id3) && 0 <= p3_new + 1) && st3 <= 0) && i2 <= 0) && 0 <= p1_\old + 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && send1 <= 127) && 1 <= cond) && st1 <= 0) && \result <= 1) && 1 <= unknown-#in~cond-unknown) && 0 <= st1) && 0 <= p2) && p3_\old + 1 <= 0) && send2 <= 127) && st2 <= 0) && p2 <= 0) && c1 <= 0) && p2_\old + 1 <= 0) && p1_\old + 1 <= 0) || (((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && i2 <= 0) && unknown-#in~arg-unknown <= 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && 0 <= arg) && 1 <= unknown-#in~cond-unknown) && 0 <= p2) && arg <= 1) && 0 <= \result) && p2 <= 0) && \result <= 1) && 0 <= unknown-#in~arg-unknown))) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((mode3 == 1 && mode2 == 1) && tmp <= 1) && st3 + st2 + st1 <= 1) && c1 <= 1) && mode1 == 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && 0 <= tmp) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && unknown-#in~cond-unknown <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && ((((((((((((((((((((((((((0 <= c1 && send3 <= 127) && 0 <= id3) && 0 <= p3_new + 1) && st3 <= 0) && i2 <= 0) && 0 <= p1_\old + 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && send1 <= 127) && 1 <= cond) && st1 <= 0) && \result <= 1) && 1 <= unknown-#in~cond-unknown) && 0 <= st1) && 0 <= p2) && p3_\old + 1 <= 0) && send2 <= 127) && st2 <= 0) && p2 <= 0) && c1 <= 0) && p2_\old + 1 <= 0) && p1_\old + 1 <= 0) || (((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && i2 <= 0) && unknown-#in~arg-unknown <= 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && 0 <= arg) && 1 <= unknown-#in~cond-unknown) && 0 <= p2) && arg <= 1) && 0 <= \result) && p2 <= 0) && \result <= 1) && 0 <= unknown-#in~arg-unknown))) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0)) || (((((((((((((mode2 % 256 == 0 && send3 == id3) && !(id3 == id2)) && mode1 % 256 == 0) && !(id1 == id3)) && (((((((((((((((((((((((((((((((((((((((((((((((((((((p3 <= 0 && 0 <= p3_new + 1) && 0 <= #NULL) && st3 <= 0) && i2 <= 0) && unknown-#in~arg-unknown <= 1) && 1 <= tmp) && tmp <= 1) && 1 <= \result) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && st1 <= 0) && \result <= 1) && #NULL <= 0) && 0 <= arg) && mode2 <= 1) && 1 <= unknown-#in~cond-unknown) && 0 <= st1) && p1 <= 0) && mode3 <= 1) && 0 <= p2) && 0 <= p3) && c1 <= 1) && 1 <= tmp) && 1 <= c1) && id1 <= 127) && 0 <= p2_new + 1) && arg <= 1) && nomsg + 1 <= 0) && mode1 <= 1) && p2_new + 1 <= 0) && 1 <= \result) && #NULL <= 0) && id3 <= 127) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && 0 <= #NULL) && unknown-#in~cond-unknown <= 1) && 0 <= p1_new + 1) && 0 <= send3) && \result <= 1) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && 0 <= unknown-#in~arg-unknown) || (((((((((((((((((((((((((((((((((((((((((((0 <= c1 && p3 <= 0) && 0 <= p3_new + 1) && 0 <= #NULL) && st3 <= 0) && i2 <= 0) && 1 <= tmp) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && st1 <= 0) && \result <= 1) && 0 <= p3_\old + 1) && #NULL <= 0) && 1 <= unknown-#in~cond-unknown) && 0 <= st1) && p1 <= 0) && 0 <= p2) && 0 <= p3) && 0 <= p2_\old + 1) && id1 <= 127) && p3_\old + 1 <= 0) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && #NULL <= 0) && id3 <= 127) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && 0 <= #NULL) && unknown-#in~cond-unknown <= 1) && c1 <= 0) && p2_\old + 1 <= 0) && 0 <= p1_new + 1) && p1_\old + 1 <= 0) && 0 <= send3) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1))) && 256 * (mode3 / 256) == mode3) && !(id1 == id2)) && nomsg == p1_\old) && send1 == id1) && r1 <= r1 / 256 * 256) && 0 <= id2) && st2 == 0) && send2 == id2) - InvariantResult [Line: 207]: Loop Invariant [2022-11-23 15:20:32,060 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,060 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,060 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,060 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,061 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,061 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,062 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,062 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,062 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,062 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,063 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,063 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,063 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,063 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,064 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,064 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,064 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,065 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,065 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,065 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,065 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,066 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,066 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,066 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,066 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,067 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,067 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,067 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,067 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,068 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,068 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,068 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,071 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,072 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,072 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,072 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,073 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,073 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,073 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,073 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,074 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,074 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,074 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,074 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,075 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,075 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,075 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,075 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,076 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,076 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,076 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,076 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,077 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,077 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,077 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,078 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,078 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,078 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,078 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,079 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,079 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,079 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,079 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,081 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && 0 <= id3) && nomsg == p1_new) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= unknown-#in~cond-unknown) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && mode3 == 0) && 0 <= tmp) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && unknown-#in~cond-unknown <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (tmp == 0 && mode1 == 0)) || (((((((((((((((((((((((((((((((((((((((0 <= c1 && mode3 == 1) && 0 <= id3) && nomsg == p1_new) && mode2 == 1) && 1 <= tmp) && tmp <= 1) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= unknown-#in~cond-unknown) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && nomsg + 1 <= id1) && mode1 == 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p2_new) && 1 <= \result) && 0 <= tmp) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && unknown-#in~cond-unknown <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((mode3 == 1 && (st2 == 1 || st2 == 0)) && nomsg == p1_new) && mode2 == 1) && tmp <= 1) && c1 <= 1) && 0 <= send2) && (st1 == 1 || st1 == 0)) && (((((((((((((((((((((((((((0 <= c1 && send3 <= 127) && 0 <= id3) && 0 <= p3_new + 1) && st3 <= 0) && i2 <= 0) && 0 <= p1_\old + 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && send1 <= 127) && 1 <= cond) && st1 <= 0) && \result <= 1) && 0 <= p3_\old + 1) && 1 <= unknown-#in~cond-unknown) && 0 <= p2) && 0 <= p2_\old + 1) && p3_\old + 1 <= 0) && send2 <= 127) && st2 <= 0) && p2 <= 0) && c1 <= 0) && p2_\old + 1 <= 0) && p1_\old + 1 <= 0) || (((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && i2 <= 0) && unknown-#in~arg-unknown <= 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && 0 <= arg) && 1 <= unknown-#in~cond-unknown) && 0 <= p2) && arg <= 1) && 0 <= \result) && p2 <= 0) && \result <= 1) && 0 <= unknown-#in~arg-unknown))) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && 0 <= tmp) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && unknown-#in~cond-unknown <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= p3_new + 1) && 1 <= tmp) && mode2 % 256 == 0) && p2 == 0) && tmp <= 1) && 1 <= cond) && send3 == id3) && \result <= 1) && !(id3 == id2)) && 0 <= st3 + st1) && 1 <= unknown-#in~cond-unknown) && !(id1 == id3)) && i2 == 0) && 256 * (mode3 / 256) == mode3) && c1 <= 1) && mode1 == 1) && id1 <= 127) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && send1 == id1) && st3 + st1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && st2 == 0) && 0 <= nomsg + 1) && id2 <= 127) && p3_new + 1 <= 0) && unknown-#in~cond-unknown <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && send2 == id2) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && (st2 == 1 || st2 == 0)) && 0 <= id3) && 0 <= p3_new + 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && nomsg == p2_\old) && 1 <= unknown-#in~cond-unknown) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && 0 <= send2) && mode1 == 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode3 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && unknown-#in~cond-unknown <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) - InvariantResult [Line: 208]: Loop Invariant [2022-11-23 15:20:32,088 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,088 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,088 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,088 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,089 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,089 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,089 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,090 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,090 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,090 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,090 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,091 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,091 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,091 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,091 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,092 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,092 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,092 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,092 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,093 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,093 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,093 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,093 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,094 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,095 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,095 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,095 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,095 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,096 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,096 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,096 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,096 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,099 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,100 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,100 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,100 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,100 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,101 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,101 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,101 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,102 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,102 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,103 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,103 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,103 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,103 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,104 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,104 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,104 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,105 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,105 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,106 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,106 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,106 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,107 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,107 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-23 15:20:32,107 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,107 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,109 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-23 15:20:32,109 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && 0 <= id3) && nomsg == p1_new) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= unknown-#in~cond-unknown) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && mode3 == 0) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && unknown-#in~cond-unknown <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((0 <= c1 && mode3 == 1) && 0 <= id3) && mode2 == 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= unknown-#in~cond-unknown) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && mode1 == 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && unknown-#in~cond-unknown <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-23 15:20:32,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbcde2cb-6e72-4d96-8bab-3cd99fd9ca38/bin/utaipan-Q6hlc19bkW/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