./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 b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/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_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba --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-b5237d8 [2022-11-22 02:19:21,843 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:19:21,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:19:21,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:19:21,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:19:21,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:19:21,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:19:21,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:19:21,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:19:21,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:19:21,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:19:21,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:19:21,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:19:21,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:19:21,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:19:21,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:19:21,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:19:21,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:19:21,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:19:21,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:19:21,913 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:19:21,914 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:19:21,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:19:21,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:19:21,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:19:21,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:19:21,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:19:21,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:19:21,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:19:21,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:19:21,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:19:21,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:19:21,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:19:21,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:19:21,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:19:21,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:19:21,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:19:21,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:19:21,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:19:21,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:19:21,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:19:21,943 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 02:19:21,976 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:19:21,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:19:21,980 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:19:21,980 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:19:21,981 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:19:21,981 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:19:21,981 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:19:21,981 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:19:21,982 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:19:21,982 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 02:19:21,983 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:19:21,983 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:19:21,983 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 02:19:21,984 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 02:19:21,984 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:19:21,984 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 02:19:21,984 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 02:19:21,984 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 02:19:21,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:19:21,985 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:19:21,986 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 02:19:21,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:19:21,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:19:21,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:19:21,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 02:19:21,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:19:21,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 02:19:21,987 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 02:19:21,987 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:19:21,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 02:19:21,988 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:19:21,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 02:19:21,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:19:21,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:19:21,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:19:21,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:19:21,990 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 02:19:21,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:19:21,991 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 02:19:21,991 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 02:19:21,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 02:19:21,992 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 02:19:21,992 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:19:21,992 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_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/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_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba 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-22 02:19:22,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:19:22,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:19:22,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:19:22,322 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:19:22,324 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:19:22,326 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-22 02:19:25,342 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:19:25,623 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:19:25,624 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-22 02:19:25,632 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/data/086a51068/db913e5fc02c42b1a59beb8feecf8882/FLAGa51e4a34f [2022-11-22 02:19:25,972 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/data/086a51068/db913e5fc02c42b1a59beb8feecf8882 [2022-11-22 02:19:25,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:19:25,983 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:19:25,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:19:25,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:19:25,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:19:25,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:19:25" (1/1) ... [2022-11-22 02:19:25,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f8c257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:19:25, skipping insertion in model container [2022-11-22 02:19:25,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:19:25" (1/1) ... [2022-11-22 02:19:26,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:19:26,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:19:26,218 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_bb130d76-a0dd-4a40-ad61-fdb853259765/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2022-11-22 02:19:26,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:19:26,234 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:19:26,273 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_bb130d76-a0dd-4a40-ad61-fdb853259765/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2022-11-22 02:19:26,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:19:26,289 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:19:26,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:19:26 WrapperNode [2022-11-22 02:19:26,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:19:26,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:19:26,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:19:26,291 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:19:26,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:19:26" (1/1) ... [2022-11-22 02:19:26,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:19:26" (1/1) ... [2022-11-22 02:19:26,339 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 219 [2022-11-22 02:19:26,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:19:26,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:19:26,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:19:26,341 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:19:26,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:19:26" (1/1) ... [2022-11-22 02:19:26,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:19:26" (1/1) ... [2022-11-22 02:19:26,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:19:26" (1/1) ... [2022-11-22 02:19:26,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:19:26" (1/1) ... [2022-11-22 02:19:26,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:19:26" (1/1) ... [2022-11-22 02:19:26,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:19:26" (1/1) ... [2022-11-22 02:19:26,364 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:19:26" (1/1) ... [2022-11-22 02:19:26,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:19:26" (1/1) ... [2022-11-22 02:19:26,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:19:26,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:19:26,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:19:26,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:19:26,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:19:26" (1/1) ... [2022-11-22 02:19:26,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:19:26,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:19:26,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:19:26,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:19:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:19:26,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 02:19:26,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:19:26,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:19:26,578 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:19:26,581 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:19:27,027 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:19:27,288 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:19:27,288 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-22 02:19:27,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:19:27 BoogieIcfgContainer [2022-11-22 02:19:27,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:19:27,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:19:27,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:19:27,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:19:27,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:19:25" (1/3) ... [2022-11-22 02:19:27,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a733f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:19:27, skipping insertion in model container [2022-11-22 02:19:27,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:19:26" (2/3) ... [2022-11-22 02:19:27,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a733f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:19:27, skipping insertion in model container [2022-11-22 02:19:27,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:19:27" (3/3) ... [2022-11-22 02:19:27,301 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-22 02:19:27,337 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:19:27,337 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-22 02:19:27,387 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:19:27,394 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;@47226e82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:19:27,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-22 02:19:27,398 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-22 02:19:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 02:19:27,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:19:27,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 02:19:27,405 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-22 02:19:27,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:19:27,410 INFO L85 PathProgramCache]: Analyzing trace with hash 11377276, now seen corresponding path program 1 times [2022-11-22 02:19:27,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:19:27,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904252087] [2022-11-22 02:19:27,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:27,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:19:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:27,973 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-22 02:19:27,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:19:27,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904252087] [2022-11-22 02:19:27,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904252087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:19:27,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:19:27,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:19:27,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583298019] [2022-11-22 02:19:27,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:19:27,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:19:27,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:19:28,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:19:28,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:19:28,027 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-22 02:19:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:19:28,092 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2022-11-22 02:19:28,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:19:28,096 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-22 02:19:28,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:19:28,108 INFO L225 Difference]: With dead ends: 104 [2022-11-22 02:19:28,108 INFO L226 Difference]: Without dead ends: 67 [2022-11-22 02:19:28,111 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-22 02:19:28,114 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 34 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:19:28,115 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.0s Time] [2022-11-22 02:19:28,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-22 02:19:28,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-11-22 02:19:28,150 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-22 02:19:28,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2022-11-22 02:19:28,153 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 4 [2022-11-22 02:19:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:19:28,154 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 76 transitions. [2022-11-22 02:19:28,154 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-22 02:19:28,154 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2022-11-22 02:19:28,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 02:19:28,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:19:28,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 02:19:28,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 02:19:28,156 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-22 02:19:28,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:19:28,157 INFO L85 PathProgramCache]: Analyzing trace with hash 352724648, now seen corresponding path program 1 times [2022-11-22 02:19:28,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:19:28,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272174382] [2022-11-22 02:19:28,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:28,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:19:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:19:28,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:19:28,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272174382] [2022-11-22 02:19:28,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272174382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:19:28,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:19:28,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:19:28,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620349296] [2022-11-22 02:19:28,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:19:28,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:19:28,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:19:28,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:19:28,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:19:28,628 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-22 02:19:28,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:19:28,789 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2022-11-22 02:19:28,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:19:28,789 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-22 02:19:28,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:19:28,791 INFO L225 Difference]: With dead ends: 92 [2022-11-22 02:19:28,791 INFO L226 Difference]: Without dead ends: 89 [2022-11-22 02:19:28,791 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-22 02:19:28,793 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:19:28,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 27 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:19:28,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-22 02:19:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2022-11-22 02:19:28,818 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-22 02:19:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2022-11-22 02:19:28,820 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 5 [2022-11-22 02:19:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:19:28,821 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2022-11-22 02:19:28,821 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-22 02:19:28,821 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2022-11-22 02:19:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 02:19:28,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:19:28,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 02:19:28,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 02:19:28,822 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-22 02:19:28,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:19:28,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1950437567, now seen corresponding path program 1 times [2022-11-22 02:19:28,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:19:28,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595049174] [2022-11-22 02:19:28,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:28,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:19:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:29,291 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-22 02:19:29,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:19:29,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595049174] [2022-11-22 02:19:29,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595049174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:19:29,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:19:29,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:19:29,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754110048] [2022-11-22 02:19:29,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:19:29,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:19:29,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:19:29,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:19:29,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:19:29,296 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-22 02:19:29,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:19:29,482 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2022-11-22 02:19:29,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:19:29,483 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-22 02:19:29,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:19:29,491 INFO L225 Difference]: With dead ends: 90 [2022-11-22 02:19:29,491 INFO L226 Difference]: Without dead ends: 87 [2022-11-22 02:19:29,494 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-22 02:19:29,495 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:19:29,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 30 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:19:29,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-22 02:19:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2022-11-22 02:19:29,504 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-22 02:19:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2022-11-22 02:19:29,514 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 6 [2022-11-22 02:19:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:19:29,515 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2022-11-22 02:19:29,515 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-22 02:19:29,515 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2022-11-22 02:19:29,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 02:19:29,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:19:29,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:19:29,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 02:19:29,516 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-22 02:19:29,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:19:29,517 INFO L85 PathProgramCache]: Analyzing trace with hash -334022198, now seen corresponding path program 1 times [2022-11-22 02:19:29,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:19:29,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798720905] [2022-11-22 02:19:29,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:29,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:19:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:29,813 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-22 02:19:29,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:19:29,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798720905] [2022-11-22 02:19:29,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798720905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:19:29,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:19:29,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:19:29,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486791560] [2022-11-22 02:19:29,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:19:29,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:19:29,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:19:29,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:19:29,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:19:29,816 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-22 02:19:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:19:29,981 INFO L93 Difference]: Finished difference Result 137 states and 187 transitions. [2022-11-22 02:19:29,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:19:29,983 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-22 02:19:29,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:19:29,984 INFO L225 Difference]: With dead ends: 137 [2022-11-22 02:19:29,984 INFO L226 Difference]: Without dead ends: 83 [2022-11-22 02:19:29,985 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-22 02:19:29,986 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 27 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:19:29,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 34 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:19:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-22 02:19:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2022-11-22 02:19:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 72 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-22 02:19:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2022-11-22 02:19:30,008 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 99 transitions. Word has length 7 [2022-11-22 02:19:30,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:19:30,009 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 99 transitions. [2022-11-22 02:19:30,009 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-22 02:19:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2022-11-22 02:19:30,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 02:19:30,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:19:30,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:19:30,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 02:19:30,011 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-22 02:19:30,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:19:30,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1764753309, now seen corresponding path program 1 times [2022-11-22 02:19:30,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:19:30,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466829407] [2022-11-22 02:19:30,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:30,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:19:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:30,360 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-22 02:19:30,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:19:30,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466829407] [2022-11-22 02:19:30,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466829407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:19:30,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:19:30,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:19:30,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925777714] [2022-11-22 02:19:30,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:19:30,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:19:30,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:19:30,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:19:30,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:19:30,364 INFO L87 Difference]: Start difference. First operand 73 states and 99 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-22 02:19:30,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:19:30,476 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2022-11-22 02:19:30,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:19:30,477 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-22 02:19:30,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:19:30,477 INFO L225 Difference]: With dead ends: 83 [2022-11-22 02:19:30,478 INFO L226 Difference]: Without dead ends: 80 [2022-11-22 02:19:30,479 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-22 02:19:30,485 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:19:30,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 37 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:19:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-22 02:19:30,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2022-11-22 02:19:30,503 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-22 02:19:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2022-11-22 02:19:30,508 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 8 [2022-11-22 02:19:30,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:19:30,508 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2022-11-22 02:19:30,512 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-22 02:19:30,513 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-11-22 02:19:30,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 02:19:30,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:19:30,514 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:19:30,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 02:19:30,514 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-22 02:19:30,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:19:30,515 INFO L85 PathProgramCache]: Analyzing trace with hash -2077909877, now seen corresponding path program 1 times [2022-11-22 02:19:30,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:19:30,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956803544] [2022-11-22 02:19:30,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:30,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:19:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:30,695 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-22 02:19:30,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:19:30,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956803544] [2022-11-22 02:19:30,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956803544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:19:30,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:19:30,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:19:30,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123896267] [2022-11-22 02:19:30,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:19:30,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:19:30,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:19:30,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:19:30,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:19:30,698 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-22 02:19:30,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:19:30,745 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2022-11-22 02:19:30,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:19:30,746 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-22 02:19:30,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:19:30,747 INFO L225 Difference]: With dead ends: 155 [2022-11-22 02:19:30,747 INFO L226 Difference]: Without dead ends: 96 [2022-11-22 02:19:30,748 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-22 02:19:30,748 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-22 02:19:30,749 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-22 02:19:30,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-22 02:19:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2022-11-22 02:19:30,757 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-22 02:19:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2022-11-22 02:19:30,757 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 16 [2022-11-22 02:19:30,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:19:30,758 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2022-11-22 02:19:30,758 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-22 02:19:30,758 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2022-11-22 02:19:30,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 02:19:30,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:19:30,759 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:19:30,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 02:19:30,760 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-22 02:19:30,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:19:30,760 INFO L85 PathProgramCache]: Analyzing trace with hash -946674433, now seen corresponding path program 1 times [2022-11-22 02:19:30,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:19:30,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882307880] [2022-11-22 02:19:30,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:30,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:19:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:30,862 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-22 02:19:30,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:19:30,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882307880] [2022-11-22 02:19:30,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882307880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:19:30,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:19:30,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:19:30,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046574045] [2022-11-22 02:19:30,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:19:30,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:19:30,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:19:30,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:19:30,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:19:30,865 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-22 02:19:30,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:19:30,901 INFO L93 Difference]: Finished difference Result 155 states and 198 transitions. [2022-11-22 02:19:30,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:19:30,901 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-22 02:19:30,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:19:30,902 INFO L225 Difference]: With dead ends: 155 [2022-11-22 02:19:30,902 INFO L226 Difference]: Without dead ends: 85 [2022-11-22 02:19:30,903 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-22 02:19:30,904 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-22 02:19:30,904 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-22 02:19:30,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-22 02:19:30,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2022-11-22 02:19:30,911 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-22 02:19:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2022-11-22 02:19:30,911 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 20 [2022-11-22 02:19:30,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:19:30,912 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2022-11-22 02:19:30,912 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-22 02:19:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2022-11-22 02:19:30,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 02:19:30,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:19:30,913 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-22 02:19:30,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 02:19:30,913 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-22 02:19:30,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:19:30,914 INFO L85 PathProgramCache]: Analyzing trace with hash 751304214, now seen corresponding path program 1 times [2022-11-22 02:19:30,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:19:30,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129034768] [2022-11-22 02:19:30,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:30,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:19:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:31,590 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-22 02:19:31,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:19:31,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129034768] [2022-11-22 02:19:31,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129034768] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:19:31,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700893671] [2022-11-22 02:19:31,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:31,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:19:31,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:19:31,598 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:19:31,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 02:19:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:31,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-22 02:19:31,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:19:33,201 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-22 02:19:33,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:19:33,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700893671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:19:33,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:19:33,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2022-11-22 02:19:33,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519498477] [2022-11-22 02:19:33,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:19:33,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:19:33,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:19:33,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:19:33,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:19:33,204 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-22 02:19:33,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:19:33,307 INFO L93 Difference]: Finished difference Result 129 states and 170 transitions. [2022-11-22 02:19:33,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:19:33,308 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-22 02:19:33,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:19:33,309 INFO L225 Difference]: With dead ends: 129 [2022-11-22 02:19:33,309 INFO L226 Difference]: Without dead ends: 75 [2022-11-22 02:19:33,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:19:33,310 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:19:33,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 40 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:19:33,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-22 02:19:33,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-11-22 02:19:33,316 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-22 02:19:33,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2022-11-22 02:19:33,317 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 22 [2022-11-22 02:19:33,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:19:33,317 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2022-11-22 02:19:33,317 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-22 02:19:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2022-11-22 02:19:33,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 02:19:33,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:19:33,318 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-22 02:19:33,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 02:19:33,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-22 02:19:33,525 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-22 02:19:33,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:19:33,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1098712592, now seen corresponding path program 1 times [2022-11-22 02:19:33,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:19:33,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570476387] [2022-11-22 02:19:33,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:33,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:19:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:34,074 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-22 02:19:34,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:19:34,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570476387] [2022-11-22 02:19:34,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570476387] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:19:34,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859654787] [2022-11-22 02:19:34,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:34,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:19:34,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:19:34,078 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:19:34,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 02:19:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:34,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-22 02:19:34,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:19:35,413 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-22 02:19:35,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:19:36,483 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-22 02:19:36,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859654787] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:19:36,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1635121127] [2022-11-22 02:19:36,505 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-22 02:19:36,506 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:19:36,510 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:19:36,516 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:19:36,517 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:19:45,414 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:19:51,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1635121127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:19:51,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:19:51,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4, 6, 6] total 27 [2022-11-22 02:19:51,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460884498] [2022-11-22 02:19:51,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:19:51,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 02:19:51,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:19:51,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 02:19:51,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2022-11-22 02:19:51,163 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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-22 02:19:59,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:19:59,429 INFO L93 Difference]: Finished difference Result 174 states and 248 transitions. [2022-11-22 02:19:59,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 02:19:59,430 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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-22 02:19:59,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:19:59,431 INFO L225 Difference]: With dead ends: 174 [2022-11-22 02:19:59,431 INFO L226 Difference]: Without dead ends: 120 [2022-11-22 02:19:59,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=431, Invalid=901, Unknown=0, NotChecked=0, Total=1332 [2022-11-22 02:19:59,432 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 66 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-22 02:19:59,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 54 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-22 02:19:59,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-22 02:19:59,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2022-11-22 02:19:59,457 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-22 02:19:59,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 141 transitions. [2022-11-22 02:19:59,458 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 141 transitions. Word has length 23 [2022-11-22 02:19:59,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:19:59,458 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 141 transitions. [2022-11-22 02:19:59,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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-22 02:19:59,458 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions. [2022-11-22 02:19:59,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-22 02:19:59,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:19:59,459 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-22 02:19:59,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 02:19:59,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-22 02:19:59,665 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-22 02:19:59,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:19:59,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1351812139, now seen corresponding path program 1 times [2022-11-22 02:19:59,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:19:59,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446590080] [2022-11-22 02:19:59,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:59,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:19:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:59,862 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-22 02:19:59,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:19:59,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446590080] [2022-11-22 02:19:59,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446590080] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:19:59,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127987385] [2022-11-22 02:19:59,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:59,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:19:59,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:19:59,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:19:59,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 02:19:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:59,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-22 02:19:59,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:20:00,001 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-22 02:20:00,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:20:00,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127987385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:20:00,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:20:00,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-22 02:20:00,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986975867] [2022-11-22 02:20:00,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:20:00,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:20:00,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:20:00,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:20:00,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:20:00,007 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-22 02:20:00,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:20:00,072 INFO L93 Difference]: Finished difference Result 180 states and 216 transitions. [2022-11-22 02:20:00,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:20:00,072 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-22 02:20:00,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:20:00,073 INFO L225 Difference]: With dead ends: 180 [2022-11-22 02:20:00,073 INFO L226 Difference]: Without dead ends: 125 [2022-11-22 02:20:00,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:20:00,076 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 29 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:20:00,077 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.0s Time] [2022-11-22 02:20:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-22 02:20:00,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 113. [2022-11-22 02:20:00,104 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-22 02:20:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2022-11-22 02:20:00,104 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 32 [2022-11-22 02:20:00,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:20:00,106 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2022-11-22 02:20:00,106 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-22 02:20:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2022-11-22 02:20:00,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 02:20:00,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:20:00,109 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-22 02:20:00,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-22 02:20:00,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:20:00,315 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-22 02:20:00,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:20:00,315 INFO L85 PathProgramCache]: Analyzing trace with hash -249000925, now seen corresponding path program 1 times [2022-11-22 02:20:00,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:20:00,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734773297] [2022-11-22 02:20:00,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:20:00,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:20:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:20:00,380 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-22 02:20:00,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:20:00,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734773297] [2022-11-22 02:20:00,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734773297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:20:00,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:20:00,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:20:00,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377854568] [2022-11-22 02:20:00,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:20:00,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:20:00,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:20:00,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:20:00,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:20:00,382 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-22 02:20:00,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:20:00,441 INFO L93 Difference]: Finished difference Result 188 states and 234 transitions. [2022-11-22 02:20:00,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:20:00,442 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-22 02:20:00,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:20:00,443 INFO L225 Difference]: With dead ends: 188 [2022-11-22 02:20:00,444 INFO L226 Difference]: Without dead ends: 134 [2022-11-22 02:20:00,445 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-22 02:20:00,445 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-22 02:20:00,446 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-22 02:20:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-22 02:20:00,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2022-11-22 02:20:00,481 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-22 02:20:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2022-11-22 02:20:00,482 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 34 [2022-11-22 02:20:00,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:20:00,482 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2022-11-22 02:20:00,482 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-22 02:20:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2022-11-22 02:20:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-22 02:20:00,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:20:00,489 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-22 02:20:00,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 02:20:00,490 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-22 02:20:00,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:20:00,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2053411338, now seen corresponding path program 1 times [2022-11-22 02:20:00,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:20:00,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452524561] [2022-11-22 02:20:00,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:20:00,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:20:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:20:00,697 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-22 02:20:00,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:20:00,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452524561] [2022-11-22 02:20:00,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452524561] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:20:00,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928129921] [2022-11-22 02:20:00,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:20:00,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:20:00,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:20:00,702 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:20:00,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 02:20:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:20:00,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-22 02:20:00,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:20:02,197 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-22 02:20:02,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:20:03,276 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-22 02:20:03,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928129921] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:20:03,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [894401877] [2022-11-22 02:20:03,279 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-22 02:20:03,279 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:20:03,280 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:20:03,280 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:20:03,280 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:20:19,078 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:20:26,800 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3492#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (= ~nomsg~0 ~p1_new~0) (<= 0 ~mode1~0) (or (and (= ~mode2~0 0) (<= 0 (+ ~p2_old~0 1)) (<= (+ ~p2_old~0 1) 0) (or (and (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|)) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) (<= 0 ~send2~0) (not (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|))))) (and (= ~mode2~0 1) (<= 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)))))) (<= 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) (<= ~st1~0 1) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= 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)) (<= ~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-22 02:20:26,800 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:20:26,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:20:26,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 22 [2022-11-22 02:20:26,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598945247] [2022-11-22 02:20:26,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:20:26,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-22 02:20:26,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:20:26,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-22 02:20:26,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1541, Unknown=0, NotChecked=0, Total=1806 [2022-11-22 02:20:26,803 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-22 02:20:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:20:28,498 INFO L93 Difference]: Finished difference Result 269 states and 298 transitions. [2022-11-22 02:20:28,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-22 02:20:28,500 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-22 02:20:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:20:28,501 INFO L225 Difference]: With dead ends: 269 [2022-11-22 02:20:28,502 INFO L226 Difference]: Without dead ends: 266 [2022-11-22 02:20:28,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1329 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=500, Invalid=3406, Unknown=0, NotChecked=0, Total=3906 [2022-11-22 02:20:28,504 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 800 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:20:28,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 94 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 02:20:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-22 02:20:28,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 123. [2022-11-22 02:20:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 122 states have internal predecessors, (146), 0 states have call successors, (0), 0 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-22 02:20:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 146 transitions. [2022-11-22 02:20:28,540 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 146 transitions. Word has length 38 [2022-11-22 02:20:28,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:20:28,540 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 146 transitions. [2022-11-22 02:20:28,540 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-22 02:20:28,540 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 146 transitions. [2022-11-22 02:20:28,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-22 02:20:28,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:20:28,541 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-22 02:20:28,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 02:20:28,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-22 02:20:28,747 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-22 02:20:28,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:20:28,748 INFO L85 PathProgramCache]: Analyzing trace with hash 768758195, now seen corresponding path program 1 times [2022-11-22 02:20:28,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:20:28,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731129324] [2022-11-22 02:20:28,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:20:28,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:20:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:20:28,983 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-22 02:20:28,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:20:28,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731129324] [2022-11-22 02:20:28,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731129324] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:20:28,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616191220] [2022-11-22 02:20:28,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:20:28,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:20:28,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:20:28,986 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:20:28,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 02:20:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:20:29,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-22 02:20:29,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:20:30,493 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-22 02:20:30,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:20:31,436 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-22 02:20:31,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616191220] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:20:31,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1171935507] [2022-11-22 02:20:31,439 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-22 02:20:31,439 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:20:31,439 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:20:31,439 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:20:31,439 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:20:45,139 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:20:52,063 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4287#(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) (<= 0 (+ ~p2_new~0 1)) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= (+ ~p2_new~0 1) 0) (<= 1 |ULTIMATE.start_init_#res#1|) (not (<= 0 (+ ~st2~0 ~st1~0 2147483648))) (<= ~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-22 02:20:52,064 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:20:52,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:20:52,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 22 [2022-11-22 02:20:52,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198497157] [2022-11-22 02:20:52,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:20:52,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-22 02:20:52,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:20:52,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-22 02:20:52,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1540, Unknown=0, NotChecked=0, Total=1806 [2022-11-22 02:20:52,066 INFO L87 Difference]: Start difference. First operand 123 states and 146 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-22 02:20:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:20:52,798 INFO L93 Difference]: Finished difference Result 161 states and 179 transitions. [2022-11-22 02:20:52,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 02:20:52,798 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-22 02:20:52,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:20:52,800 INFO L225 Difference]: With dead ends: 161 [2022-11-22 02:20:52,801 INFO L226 Difference]: Without dead ends: 158 [2022-11-22 02:20:52,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=415, Invalid=2237, Unknown=0, NotChecked=0, Total=2652 [2022-11-22 02:20:52,803 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 341 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:20:52,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 67 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 02:20:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-22 02:20:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 120. [2022-11-22 02:20:52,841 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-22 02:20:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2022-11-22 02:20:52,841 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 39 [2022-11-22 02:20:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:20:52,842 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2022-11-22 02:20:52,842 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-22 02:20:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2022-11-22 02:20:52,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-22 02:20:52,845 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:20:52,845 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-22 02:20:52,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 02:20:53,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 02:20:53,052 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-22 02:20:53,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:20:53,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1938299496, now seen corresponding path program 1 times [2022-11-22 02:20:53,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:20:53,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306814065] [2022-11-22 02:20:53,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:20:53,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:20:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:20:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:20:53,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:20:53,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306814065] [2022-11-22 02:20:53,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306814065] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:20:53,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301422797] [2022-11-22 02:20:53,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:20:53,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:20:53,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:20:53,726 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:20:53,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 02:20:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:20:53,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-22 02:20:53,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:20:58,879 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-22 02:20:58,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:21:04,577 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-22 02:21:04,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301422797] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:21:04,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1803342787] [2022-11-22 02:21:04,579 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-22 02:21:04,580 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:21:04,580 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:21:04,580 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:21:04,580 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:21:17,993 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:21:25,809 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4932#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (= ~nomsg~0 ~p1_new~0) (<= 0 (+ ~st2~0 ~st1~0 2147483648)) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (or (and (<= 0 (+ ~p3_old~0 1)) (or (and (or (= ~st3~0 1) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (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|))) (<= (+ ~p3_old~0 1) 0) (= ~mode3~0 0)) (and (= ~mode3~0 1) (exists ((v_~p3_new~0_74 Int)) (and (<= 0 (+ v_~p3_new~0_74 1)) (<= (+ v_~p3_new~0_74 1) 0) (= (ite (<= (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_74 ~nomsg~0)) ~send3~0 v_~p3_new~0_74) 256) 127) (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_74 ~nomsg~0)) ~send3~0 v_~p3_new~0_74) 256) (+ (- 256) (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_74 ~nomsg~0)) ~send3~0 v_~p3_new~0_74) 256))) ~p3_old~0))) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (<= 0 ~send3~0))) (<= 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|) (<= (+ ~st2~0 ~st1~0) 2147483647) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= |ULTIMATE.start_main_~c1~0#1| 1) (<= ~id1~0 127) (= ~nomsg~0 ~p2_new~0) (<= ~st1~0 1) (not (<= (+ ~st3~0 ~st2~0 ~st1~0) 2147483647)) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= 1 |ULTIMATE.start_init_#res#1|) (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 (exists ((v_~p2_new~0_82 Int)) (and (<= (+ v_~p2_new~0_82 1) 0) (= (ite (<= (mod (ite (and (= v_~p2_new~0_82 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_82) 256) 127) (mod (ite (and (= v_~p2_new~0_82 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_82) 256) (+ (- 256) (mod (ite (and (= v_~p2_new~0_82 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_82) 256))) ~p2_old~0) (<= 0 (+ v_~p2_new~0_82 1)))) (= ~mode2~0 1) (<= 0 ~st2~0) (<= 0 ~send2~0) (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#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-22 02:21:25,810 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:21:25,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:21:25,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 22 [2022-11-22 02:21:25,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477504359] [2022-11-22 02:21:25,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:21:25,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-22 02:21:25,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:21:25,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-22 02:21:25,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=1509, Unknown=0, NotChecked=0, Total=1892 [2022-11-22 02:21:25,812 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand has 24 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:21:30,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:21:30,180 INFO L93 Difference]: Finished difference Result 359 states and 418 transitions. [2022-11-22 02:21:30,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-22 02:21:30,180 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-22 02:21:30,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:21:30,182 INFO L225 Difference]: With dead ends: 359 [2022-11-22 02:21:30,182 INFO L226 Difference]: Without dead ends: 298 [2022-11-22 02:21:30,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1489 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=676, Invalid=3484, Unknown=0, NotChecked=0, Total=4160 [2022-11-22 02:21:30,184 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 750 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-22 02:21:30,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 110 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-22 02:21:30,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-22 02:21:30,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 186. [2022-11-22 02:21:30,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 181 states have (on average 1.143646408839779) internal successors, (207), 185 states have internal predecessors, (207), 0 states have call successors, (0), 0 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-22 02:21:30,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 207 transitions. [2022-11-22 02:21:30,234 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 207 transitions. Word has length 40 [2022-11-22 02:21:30,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:21:30,234 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 207 transitions. [2022-11-22 02:21:30,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:21:30,234 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 207 transitions. [2022-11-22 02:21:30,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-22 02:21:30,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:21:30,235 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-22 02:21:30,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 02:21:30,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:21:30,437 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-22 02:21:30,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:21:30,437 INFO L85 PathProgramCache]: Analyzing trace with hash 42258005, now seen corresponding path program 1 times [2022-11-22 02:21:30,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:21:30,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049900222] [2022-11-22 02:21:30,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:21:30,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:21:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:21:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:21:30,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:21:30,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049900222] [2022-11-22 02:21:30,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049900222] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:21:30,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347402449] [2022-11-22 02:21:30,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:21:30,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:21:30,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:21:30,737 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:21:30,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 02:21:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:21:30,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-22 02:21:30,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:21:35,847 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-22 02:21:35,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:21:41,806 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-22 02:21:41,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347402449] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:21:41,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [721639836] [2022-11-22 02:21:41,808 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-22 02:21:41,808 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:21:41,809 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:21:41,809 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:21:41,809 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:21:54,912 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:22:01,973 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5927#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (<= 0 (+ ~p3_new~0 1)) (not (<= 0 (+ ~st3~0 ~st2~0 ~st1~0 2147483648))) (<= 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) (<= 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-22 02:22:01,974 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:22:01,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:22:01,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 23 [2022-11-22 02:22:01,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300983547] [2022-11-22 02:22:01,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:22:01,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-22 02:22:01,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:22:01,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-22 02:22:01,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1620, Unknown=0, NotChecked=0, Total=1892 [2022-11-22 02:22:01,976 INFO L87 Difference]: Start difference. First operand 186 states and 207 transitions. Second operand has 24 states, 23 states have (on average 5.173913043478261) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-22 02:22:03,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:22:03,406 INFO L93 Difference]: Finished difference Result 186 states and 207 transitions. [2022-11-22 02:22:03,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 02:22:03,406 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.173913043478261) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 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-22 02:22:03,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:22:03,407 INFO L225 Difference]: With dead ends: 186 [2022-11-22 02:22:03,408 INFO L226 Difference]: Without dead ends: 183 [2022-11-22 02:22:03,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=445, Invalid=2417, Unknown=0, NotChecked=0, Total=2862 [2022-11-22 02:22:03,409 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 434 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:22:03,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 71 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:22:03,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-22 02:22:03,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 168. [2022-11-22 02:22:03,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 166 states have (on average 1.1024096385542168) internal successors, (183), 167 states have internal predecessors, (183), 0 states have call successors, (0), 0 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-22 02:22:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 183 transitions. [2022-11-22 02:22:03,462 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 183 transitions. Word has length 41 [2022-11-22 02:22:03,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:22:03,462 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 183 transitions. [2022-11-22 02:22:03,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.173913043478261) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-22 02:22:03,462 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 183 transitions. [2022-11-22 02:22:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-22 02:22:03,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:22:03,463 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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-22 02:22:03,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 02:22:03,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-22 02:22:03,664 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 02:22:03,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:22:03,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1820342745, now seen corresponding path program 2 times [2022-11-22 02:22:03,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:22:03,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925144035] [2022-11-22 02:22:03,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:22:03,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:22:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:22:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:22:05,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:22:05,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925144035] [2022-11-22 02:22:05,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925144035] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:22:05,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097507326] [2022-11-22 02:22:05,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:22:05,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:22:05,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:22:05,146 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:22:05,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 02:22:05,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-22 02:22:05,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:22:05,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-22 02:22:05,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:22:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:22:09,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:22:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:22:11,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097507326] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:22:11,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [128879263] [2022-11-22 02:22:11,486 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-22 02:22:11,486 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:22:11,486 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:22:11,486 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:22:11,487 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:22:24,192 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:22:31,749 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6765#(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) (<= |ULTIMATE.start_main_~c1~0#1| 1) (<= ~id1~0 127) (or (and (= ~mode2~0 0) (<= 0 (+ ~p2_old~0 1)) (<= (+ ~p2_old~0 1) 0) (or (and (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|)) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) (<= 0 ~send2~0) (not (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|))))) (and (= ~mode2~0 1) (exists ((v_~p2_new~0_109 Int)) (and (<= 0 (+ v_~p2_new~0_109 1)) (<= (+ v_~p2_new~0_109 1) 0) (= ~p2_old~0 (ite (<= (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= ~nomsg~0 v_~p2_new~0_109)) ~send2~0 v_~p2_new~0_109) 256) 127) (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= ~nomsg~0 v_~p2_new~0_109)) ~send2~0 v_~p2_new~0_109) 256) (+ (- 256) (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= ~nomsg~0 v_~p2_new~0_109)) ~send2~0 v_~p2_new~0_109) 256)))))) (<= 0 ~send2~0) (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|))) (= ~nomsg~0 ~p2_new~0) (<= ~st1~0 1) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= 1 |ULTIMATE.start_init_#res#1|) (not (<= (+ ~st2~0 ~st1~0) 2147483647)) (or (and (= ~mode3~0 1) (exists ((v_~p3_new~0_101 Int)) (and (<= 0 (+ v_~p3_new~0_101 1)) (= (ite (<= (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= ~nomsg~0 v_~p3_new~0_101)) ~send3~0 v_~p3_new~0_101) 256) 127) (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= ~nomsg~0 v_~p3_new~0_101)) ~send3~0 v_~p3_new~0_101) 256) (+ (- 256) (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= ~nomsg~0 v_~p3_new~0_101)) ~send3~0 v_~p3_new~0_101) 256))) ~p3_old~0) (<= (+ v_~p3_new~0_101 1) 0))) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (<= 0 ~st3~0) (<= 0 ~send3~0)) (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))) (<= ~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-22 02:22:31,750 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:22:31,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:22:31,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 31 [2022-11-22 02:22:31,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205318518] [2022-11-22 02:22:31,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:22:31,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 02:22:31,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:22:31,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 02:22:31,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=2298, Unknown=0, NotChecked=0, Total=2756 [2022-11-22 02:22:31,752 INFO L87 Difference]: Start difference. First operand 168 states and 183 transitions. Second operand has 33 states, 32 states have (on average 5.125) internal successors, (164), 32 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-22 02:22:34,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:22:34,101 INFO L93 Difference]: Finished difference Result 231 states and 249 transitions. [2022-11-22 02:22:34,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-22 02:22:34,101 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 5.125) internal successors, (164), 32 states have internal predecessors, (164), 0 states have call successors, (0), 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 55 [2022-11-22 02:22:34,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:22:34,102 INFO L225 Difference]: With dead ends: 231 [2022-11-22 02:22:34,102 INFO L226 Difference]: Without dead ends: 170 [2022-11-22 02:22:34,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1920 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=904, Invalid=4208, Unknown=0, NotChecked=0, Total=5112 [2022-11-22 02:22:34,105 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 902 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:22:34,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 118 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 02:22:34,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-22 02:22:34,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 145. [2022-11-22 02:22:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.0625) internal successors, (153), 144 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-22 02:22:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2022-11-22 02:22:34,163 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 55 [2022-11-22 02:22:34,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:22:34,164 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2022-11-22 02:22:34,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 5.125) internal successors, (164), 32 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-22 02:22:34,164 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2022-11-22 02:22:34,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-22 02:22:34,165 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:22:34,165 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:22:34,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-22 02:22:34,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-22 02:22:34,371 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 02:22:34,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:22:34,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1650852779, now seen corresponding path program 1 times [2022-11-22 02:22:34,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:22:34,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199263879] [2022-11-22 02:22:34,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:22:34,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:22:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:22:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 54 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:22:35,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:22:35,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199263879] [2022-11-22 02:22:35,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199263879] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:22:35,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247841256] [2022-11-22 02:22:35,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:22:35,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:22:35,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:22:35,542 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:22:35,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 02:22:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:22:35,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-22 02:22:35,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:22:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 50 proven. 37 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-22 02:22:35,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:22:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-22 02:22:35,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247841256] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 02:22:35,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:22:35,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 4] total 11 [2022-11-22 02:22:35,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634758182] [2022-11-22 02:22:35,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:22:35,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:22:35,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:22:35,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:22:35,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:22:35,749 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:22:35,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:22:35,851 INFO L93 Difference]: Finished difference Result 188 states and 197 transitions. [2022-11-22 02:22:35,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:22:35,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-11-22 02:22:35,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:22:35,852 INFO L225 Difference]: With dead ends: 188 [2022-11-22 02:22:35,853 INFO L226 Difference]: Without dead ends: 145 [2022-11-22 02:22:35,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:22:35,854 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:22:35,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:22:35,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-22 02:22:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2022-11-22 02:22:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 0 states have call successors, (0), 0 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-22 02:22:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2022-11-22 02:22:35,921 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 83 [2022-11-22 02:22:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:22:35,921 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2022-11-22 02:22:35,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:22:35,921 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2022-11-22 02:22:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-22 02:22:35,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:22:35,922 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:22:35,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 02:22:36,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-22 02:22:36,130 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 02:22:36,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:22:36,130 INFO L85 PathProgramCache]: Analyzing trace with hash -780996640, now seen corresponding path program 2 times [2022-11-22 02:22:36,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:22:36,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825489279] [2022-11-22 02:22:36,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:22:36,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:22:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:22:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 5 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:22:40,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:22:40,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825489279] [2022-11-22 02:22:40,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825489279] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:22:40,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434711344] [2022-11-22 02:22:40,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:22:40,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:22:40,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:22:40,431 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:22:40,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 02:22:40,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-22 02:22:40,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:22:40,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-22 02:22:40,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:23:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:23:29,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:25:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 12 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:25:06,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434711344] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:25:06,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [968273333] [2022-11-22 02:25:06,077 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-22 02:25:06,077 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:25:06,077 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:25:06,078 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:25:06,078 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:25:18,984 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:25:28,408 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8783#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (= ~nomsg~0 ~p1_new~0) (<= 0 (+ ~st2~0 ~st1~0 2147483648)) (<= 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|) (<= (+ ~st2~0 ~st1~0) 2147483647) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= |ULTIMATE.start_main_~c1~0#1| 1) (<= ~id1~0 127) (or (and (<= 0 (+ ~p3_old~0 1)) (or (and (or (= ~st3~0 1) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (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|))) (<= (+ ~p3_old~0 1) 0) (= ~mode3~0 0)) (and (= ~mode3~0 1) (exists ((v_~p3_new~0_118 Int)) (and (= ~p3_old~0 (ite (<= (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= ~nomsg~0 v_~p3_new~0_118)) ~send3~0 v_~p3_new~0_118) 256) 127) (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= ~nomsg~0 v_~p3_new~0_118)) ~send3~0 v_~p3_new~0_118) 256) (+ (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= ~nomsg~0 v_~p3_new~0_118)) ~send3~0 v_~p3_new~0_118) 256) (- 256)))) (<= (+ v_~p3_new~0_118 1) 0) (<= 0 (+ v_~p3_new~0_118 1)))) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (<= 0 ~send3~0))) (= ~nomsg~0 ~p2_new~0) (<= ~st1~0 1) (not (<= (+ ~st3~0 ~st2~0 ~st1~0) 2147483647)) (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) (exists ((v_~p2_new~0_126 Int)) (and (= (ite (<= (mod (ite (and (= ~nomsg~0 v_~p2_new~0_126) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_126) 256) 127) (mod (ite (and (= ~nomsg~0 v_~p2_new~0_126) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_126) 256) (+ (- 256) (mod (ite (and (= ~nomsg~0 v_~p2_new~0_126) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_126) 256))) ~p2_old~0) (<= (+ v_~p2_new~0_126 1) 0) (<= 0 (+ v_~p2_new~0_126 1)))) (<= 0 ~st2~0) (<= 0 ~send2~0) (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|))) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= 1 |ULTIMATE.start_init_#res#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-22 02:25:28,409 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:25:28,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:25:28,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 48 [2022-11-22 02:25:28,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436112756] [2022-11-22 02:25:28,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:25:28,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-22 02:25:28,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:25:28,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-22 02:25:28,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=3990, Unknown=0, NotChecked=0, Total=4830 [2022-11-22 02:25:28,412 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand has 50 states, 49 states have (on average 5.448979591836735) internal successors, (267), 49 states have internal predecessors, (267), 0 states have call successors, (0), 0 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-22 02:25:39,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:25:39,058 INFO L93 Difference]: Finished difference Result 255 states and 261 transitions. [2022-11-22 02:25:39,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-22 02:25:39,059 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 5.448979591836735) internal successors, (267), 49 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-11-22 02:25:39,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:25:39,059 INFO L225 Difference]: With dead ends: 255 [2022-11-22 02:25:39,059 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 02:25:39,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 206 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3649 ImplicationChecksByTransitivity, 32.0s TimeCoverageRelationStatistics Valid=1823, Invalid=7683, Unknown=0, NotChecked=0, Total=9506 [2022-11-22 02:25:39,064 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1289 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:25:39,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 145 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-22 02:25:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 02:25:39,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 02:25:39,065 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-22 02:25:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 02:25:39,066 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2022-11-22 02:25:39,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:25:39,066 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 02:25:39,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 5.448979591836735) internal successors, (267), 49 states have internal predecessors, (267), 0 states have call successors, (0), 0 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-22 02:25:39,067 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 02:25:39,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 02:25:39,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-22 02:25:39,070 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-22 02:25:39,070 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-22 02:25:39,070 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-22 02:25:39,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-22 02:25:39,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-22 02:25:39,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-22 02:25:39,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-22 02:25:39,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-22 02:25:39,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-22 02:25:39,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-22 02:25:39,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-22 02:25:39,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-22 02:25:39,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-22 02:25:39,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 02:25:39,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-22 02:25:39,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 02:25:49,331 WARN L233 SmtUtils]: Spent 5.72s on a formula simplification. DAG size of input: 502 DAG size of output: 448 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-22 02:25:59,071 WARN L233 SmtUtils]: Spent 9.74s on a formula simplification. DAG size of input: 487 DAG size of output: 482 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-22 02:26:07,012 WARN L233 SmtUtils]: Spent 6.41s on a formula simplification. DAG size of input: 482 DAG size of output: 246 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 02:26:19,564 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-22 02:26:19,564 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-22 02:26:19,564 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-22 02:26:19,564 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-22 02:26:19,565 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-22 02:26:19,565 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 02:26:19,565 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-22 02:26:19,565 INFO L899 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-11-22 02:26:19,565 INFO L899 garLoopResultBuilder]: For program point L207-1(line 207) no Hoare annotation was computed. [2022-11-22 02:26:19,565 INFO L899 garLoopResultBuilder]: For program point L207-2(line 207) no Hoare annotation was computed. [2022-11-22 02:26:19,565 INFO L899 garLoopResultBuilder]: For program point L207-3(line 207) no Hoare annotation was computed. [2022-11-22 02:26:19,566 INFO L899 garLoopResultBuilder]: For program point L207-4(lines 207 226) no Hoare annotation was computed. [2022-11-22 02:26:19,567 INFO L895 garLoopResultBuilder]: At program point L207-5(lines 207 226) the Hoare annotation is: (let ((.cse53 (+ ~st3~0 ~st2~0 ~st1~0))) (let ((.cse43 (= |ULTIMATE.start_check_~tmp~1#1| 0)) (.cse52 (<= 1 .cse53)) (.cse60 (+ ~p2_new~0 1)) (.cse50 (= ~mode3~0 0)) (.cse1 (= ~mode3~0 1)) (.cse59 (+ ~p1_new~0 1))) (let ((.cse0 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse2 (<= 0 ~id3~0)) (.cse3 (= |ULTIMATE.start_check_~tmp~1#1| 1)) (.cse4 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse5 (<= 0 ~id1~0)) (.cse6 (= ~p2~0 0)) (.cse7 (<= .cse59 0)) (.cse8 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse9 (< (mod ~r1~0 256) 3)) (.cse10 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse12 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse13 (= .cse53 0)) (.cse14 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse15 (<= 0 ~st1~0)) (.cse16 (= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse17 (<= 0 ~st2~0)) (.cse18 (<= |ULTIMATE.start_main_~c1~0#1| 1)) (.cse19 (<= 0 ~send2~0)) (.cse21 (<= ~id1~0 127)) (.cse22 (or (let ((.cse62 (+ ~p3_old~0 1))) (and (let ((.cse61 (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (or (and (not .cse61) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (and .cse61 (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|)))) (<= 0 .cse62) (<= .cse62 0) .cse50)) (and .cse1 (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (exists ((v_~p3_new~0_35 Int)) (let ((.cse63 (+ v_~p3_new~0_35 1))) (and (<= .cse63 0) (<= 0 .cse63) (= ~p3_old~0 (let ((.cse64 (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_35 ~nomsg~0)) ~send3~0 v_~p3_new~0_35) 256))) (ite (<= .cse64 127) .cse64 (+ (- 256) .cse64)))))))))) (.cse23 (<= 0 .cse60)) (.cse24 (<= .cse60 0)) (.cse25 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse26 (<= ~id3~0 127)) (.cse27 (<= 0 ~id2~0)) (.cse28 (= |#NULL.offset| 0)) (.cse29 (<= 0 (+ ~nomsg~0 1))) (.cse30 (<= ~id2~0 127)) (.cse31 (<= 0 ~st3~0)) (.cse32 (<= (+ ~p3_new~0 1) 0)) (.cse33 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse34 (= ~p3~0 0)) (.cse35 (<= 0 .cse59)) (.cse36 (<= 0 ~send3~0)) (.cse37 (= ~p1~0 0)) (.cse38 (<= 0 |#StackHeapBarrier|)) (.cse39 (<= 0 ~send1~0)) (.cse40 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse41 (or (and (= ~mode2~0 1) (exists ((v_~p2_new~0_43 Int)) (let ((.cse55 (+ v_~p2_new~0_43 1))) (and (<= .cse55 0) (= (let ((.cse56 (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= v_~p2_new~0_43 ~nomsg~0)) ~send2~0 v_~p2_new~0_43) 256))) (ite (<= .cse56 127) .cse56 (+ .cse56 (- 256)))) ~p2_old~0) (<= 0 .cse55)))) (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|)) (let ((.cse57 (+ ~p2_old~0 1))) (and (= ~mode2~0 0) (<= 0 .cse57) (let ((.cse58 (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|))) (or (and (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) .cse58) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) (not .cse58)))) (<= .cse57 0))))) (.cse42 (= |#NULL.base| 0)) (.cse49 (= ~nomsg~0 ~p1_old~0)) (.cse44 (= ~mode1~0 0)) (.cse45 (let ((.cse54 (or (= ~st3~0 0) (= ~st3~0 1)))) (or (and .cse54 (= ~st2~0 0)) (and (= ~st2~0 1) .cse54)))) (.cse46 (= ~nomsg~0 ~p1_new~0)) (.cse47 (or .cse43 .cse52)) (.cse11 (= ~p3_new~0 ~nomsg~0)) (.cse51 (<= .cse53 1)) (.cse20 (= ~mode1~0 1)) (.cse48 (or (= ~st1~0 1) (= ~st1~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42) (and .cse43 .cse44) (and .cse45 .cse1 .cse46 .cse43 .cse47 .cse11 .cse20 .cse48) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse49 .cse23 .cse24 .cse25 .cse44 .cse50 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42) (and .cse45 (not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 2))) .cse46 .cse11 .cse51 .cse52 .cse48 .cse49 .cse44 .cse50) (and .cse45 .cse1 .cse46 .cse47 .cse11 .cse51 .cse20 .cse48))))) [2022-11-22 02:26:19,567 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-22 02:26:19,567 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 75) no Hoare annotation was computed. [2022-11-22 02:26:19,568 INFO L895 garLoopResultBuilder]: At program point L59-2(lines 53 78) the Hoare annotation is: (let ((.cse50 (+ ~p3_new~0 1)) (.cse52 (+ ~nomsg~0 1)) (.cse53 (+ ~p2_new~0 1)) (.cse46 (= ~st1~0 0)) (.cse3 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse47 (= ~st2~0 0))) (let ((.cse8 (= ~mode3~0 0)) (.cse5 (= ~mode1~0 1)) (.cse7 (= ~nomsg~0 ~p1_old~0)) (.cse0 (* (div ~r1~0 256) 256)) (.cse1 (or (= ~st2~0 1) .cse47)) (.cse2 (= ~p3_new~0 ~nomsg~0)) (.cse4 (<= 1 .cse3)) (.cse6 (or (= ~st1~0 1) .cse46)) (.cse10 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse48 (= ~mode3~0 1)) (.cse11 (<= 0 ~id3~0)) (.cse12 (<= ~st3~0 0)) (.cse13 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse14 (<= 0 ~id1~0)) (.cse15 (= ~p2~0 0)) (.cse16 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse17 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse18 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse19 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse20 (<= 0 ~st1~0)) (.cse21 (= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse22 (<= 0 ~st2~0)) (.cse23 (<= |ULTIMATE.start_main_~c1~0#1| 1)) (.cse24 (<= 0 ~send2~0)) (.cse25 (<= ~id1~0 127)) (.cse26 (<= ~st1~0 1)) (.cse27 (<= 0 .cse53)) (.cse28 (<= ~st2~0 0)) (.cse29 (<= .cse53 0)) (.cse30 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse49 (= ~mode1~0 0)) (.cse31 (<= ~id3~0 127)) (.cse32 (<= 0 ~id2~0)) (.cse33 (= |#NULL.offset| 0)) (.cse34 (<= 0 .cse52)) (.cse35 (<= ~id2~0 127)) (.cse9 (<= 0 ~st3~0)) (.cse36 (<= .cse50 0)) (.cse37 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse38 (= ~p3~0 0)) (.cse39 (<= 0 ~send3~0)) (.cse40 (= ~p1~0 0)) (.cse41 (<= 0 |#StackHeapBarrier|)) (.cse42 (<= 0 ~send1~0)) (.cse43 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse44 (= |#NULL.base| 0))) (or (and (not (<= ~r1~0 (+ .cse0 2))) .cse1 .cse2 (<= .cse3 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse2 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse5 .cse25 .cse26 .cse7 .cse27 .cse28 .cse29 .cse30 .cse8 .cse31 .cse32 .cse33 .cse34 .cse35 .cse9 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44) (let ((.cse45 (+ ~st3~0 ~st1~0))) (and .cse10 .cse13 (= (mod ~mode2~0 256) 0) .cse15 .cse16 .cse17 (= ~send3~0 ~id3~0) .cse2 .cse18 (= ~nomsg~0 ~p2_old~0) (not (= ~id3~0 ~id2~0)) (<= 0 .cse45) .cse19 (not (= ~id1~0 ~id3~0)) .cse21 (= (* 256 (div ~mode3~0 256)) ~mode3~0) .cse23 .cse5 .cse25 .cse46 (not (= ~id1~0 ~id2~0)) .cse7 .cse27 .cse29 .cse30 (= ~send1~0 ~id1~0) (<= .cse45 0) (<= ~r1~0 .cse0) .cse31 .cse32 .cse33 .cse47 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (= ~send2~0 ~id2~0) .cse44)) (and .cse48 .cse1 (= ~nomsg~0 ~p1_new~0) .cse2 .cse4 .cse6 .cse49 (<= ~st3~0 1) .cse9) (let ((.cse51 (+ ~p1_new~0 1))) (and .cse10 .cse48 .cse11 (<= 0 .cse50) .cse12 .cse13 .cse14 .cse15 (<= .cse51 0) .cse16 .cse17 .cse18 (<= ~mode2~0 1) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (<= .cse52 0) .cse28 .cse29 .cse30 .cse49 .cse31 .cse32 .cse33 .cse34 (<= 0 ~mode2~0) .cse35 .cse9 .cse36 .cse37 .cse38 (<= 0 .cse51) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44))))) [2022-11-22 02:26:19,568 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 223) no Hoare annotation was computed. [2022-11-22 02:26:19,569 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-22 02:26:19,569 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2022-11-22 02:26:19,569 INFO L899 garLoopResultBuilder]: For program point L60-1(line 60) no Hoare annotation was computed. [2022-11-22 02:26:19,569 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-22 02:26:19,571 INFO L895 garLoopResultBuilder]: At program point L259-2(lines 259 273) the Hoare annotation is: (let ((.cse92 (+ ~p3_old~0 1)) (.cse83 (+ ~p2_old~0 1)) (.cse79 (+ ~p1_old~0 1)) (.cse87 (+ ~nomsg~0 1)) (.cse93 (+ ~p2_new~0 1)) (.cse85 (+ ~p1_new~0 1)) (.cse86 (+ ~p3_new~0 1))) (let ((.cse52 (<= |ULTIMATE.start_assert_#in~arg#1| 1)) (.cse53 (<= 1 |ULTIMATE.start_check_#res#1|)) (.cse54 (<= 0 |ULTIMATE.start_assert_~arg#1|)) (.cse55 (<= |ULTIMATE.start_main_~c1~0#1| 1)) (.cse56 (<= 1 |ULTIMATE.start_main_~c1~0#1|)) (.cse57 (<= |ULTIMATE.start_assert_~arg#1| 1)) (.cse59 (<= |ULTIMATE.start_check_#res#1| 1)) (.cse60 (<= 0 |ULTIMATE.start_assert_#in~arg#1|)) (.cse11 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse13 (<= 0 .cse86)) (.cse15 (<= ~st3~0 0)) (.cse16 (<= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse17 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse18 (<= 0 |ULTIMATE.start_main_~i2~0#1|)) (.cse19 (<= .cse85 0)) (.cse20 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse21 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse22 (<= ~st1~0 0)) (.cse23 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse26 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse27 (<= 0 ~st1~0)) (.cse29 (<= 0 ~p2~0)) (.cse31 (<= ~id1~0 127)) (.cse33 (<= 0 .cse93)) (.cse58 (<= .cse87 0)) (.cse34 (<= .cse93 0)) (.cse35 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse37 (<= ~id3~0 127)) (.cse39 (<= ~p2~0 0)) (.cse44 (<= |ULTIMATE.start_main_~c1~0#1| 0)) (.cse46 (<= .cse79 0)) (.cse80 (<= .cse83 0)) (.cse24 (<= 0 .cse92)) (.cse32 (<= .cse92 0)) (.cse9 (= ~mode3~0 0)) (.cse63 (= ~mode3~0 1)) (.cse91 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse62 (= ~st2~0 0))) (let ((.cse0 (* (div ~r1~0 256) 256)) (.cse1 (or (= ~st2~0 1) .cse62)) (.cse2 (= ~nomsg~0 ~p1_new~0)) (.cse3 (= ~p3_new~0 ~nomsg~0)) (.cse4 (<= .cse91 1)) (.cse5 (<= 1 .cse91)) (.cse6 (or (= ~st1~0 1) (= ~st1~0 0))) (.cse7 (= ~nomsg~0 ~p1_old~0)) (.cse8 (= ~mode1~0 0)) (.cse65 (= |ULTIMATE.start_check_~tmp~1#1| 1)) (.cse66 (< (mod ~r1~0 256) 3)) (.cse64 (= ~mode1~0 1)) (.cse67 (or (and (let ((.cse88 (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (or (and (not .cse88) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (and .cse88 (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|)))) .cse24 .cse32 .cse9) (and .cse63 (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (exists ((v_~p3_new~0_35 Int)) (let ((.cse89 (+ v_~p3_new~0_35 1))) (and (<= .cse89 0) (<= 0 .cse89) (= ~p3_old~0 (let ((.cse90 (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_35 ~nomsg~0)) ~send3~0 v_~p3_new~0_35) 256))) (ite (<= .cse90 127) .cse90 (+ (- 256) .cse90)))))))))) (.cse61 (<= 0 ~id2~0)) (.cse68 (= |#NULL.offset| 0)) (.cse38 (<= 0 .cse87)) (.cse40 (<= ~id2~0 127)) (.cse10 (<= 0 ~st3~0)) (.cse41 (<= .cse86 0)) (.cse43 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse69 (= ~p3~0 0)) (.cse45 (<= 0 .cse85)) (.cse47 (<= 0 ~send3~0)) (.cse70 (= ~p1~0 0)) (.cse49 (<= 0 |#StackHeapBarrier|)) (.cse50 (<= 0 ~send1~0)) (.cse51 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse71 (or (and (= ~mode2~0 1) (exists ((v_~p2_new~0_43 Int)) (let ((.cse81 (+ v_~p2_new~0_43 1))) (and (<= .cse81 0) (= (let ((.cse82 (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= v_~p2_new~0_43 ~nomsg~0)) ~send2~0 v_~p2_new~0_43) 256))) (ite (<= .cse82 127) .cse82 (+ .cse82 (- 256)))) ~p2_old~0) (<= 0 .cse81)))) (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|)) (and (= ~mode2~0 0) (<= 0 .cse83) (let ((.cse84 (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|))) (or (and (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) .cse84) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) (not .cse84)))) .cse80))) (.cse72 (let ((.cse74 (<= 0 ~id3~0)) (.cse75 (<= 0 ~id1~0)) (.cse76 (<= 0 ~st2~0)) (.cse77 (<= 0 ~send2~0)) (.cse78 (<= ~st2~0 0))) (or (and .cse74 .cse13 .cse15 .cse16 .cse52 .cse17 .cse75 .cse53 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse54 .cse26 .cse27 .cse76 .cse29 .cse55 .cse77 .cse56 .cse31 .cse33 .cse57 .cse58 .cse78 .cse34 .cse35 .cse37 .cse39 .cse59 .cse60) (and .cse11 (<= ~send3~0 127) .cse74 .cse13 .cse15 .cse16 (<= 0 .cse79) .cse17 .cse75 .cse18 .cse19 .cse20 (<= ~send1~0 127) .cse21 .cse22 .cse23 .cse26 .cse27 .cse76 .cse29 .cse77 .cse31 .cse32 (<= ~send2~0 127) .cse33 .cse58 .cse78 .cse34 .cse35 .cse37 .cse39 .cse44 .cse80 .cse46)))) (.cse73 (= |#NULL.base| 0))) (or (and (not (<= ~r1~0 (+ .cse0 2))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (let ((.cse12 (<= ~p3~0 0)) (.cse14 (<= 0 |#NULL.base|)) (.cse25 (<= |#NULL.offset| 0)) (.cse28 (<= ~p1~0 0)) (.cse30 (<= 0 ~p3~0)) (.cse36 (<= |#NULL.base| 0)) (.cse42 (<= 0 |#NULL.offset|)) (.cse48 (<= 0 ~p1~0))) (or (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse10 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse52 .cse17 (<= |ULTIMATE.start_check_~tmp~1#1| 1) .cse53 .cse18 .cse19 .cse20 (<= 0 ~mode3~0) .cse21 .cse22 .cse23 .cse25 .cse54 (<= ~mode2~0 1) .cse26 .cse27 .cse28 (<= ~mode3~0 1) .cse29 .cse30 .cse55 (<= 1 |ULTIMATE.start_check_~tmp~1#1|) .cse56 .cse31 .cse33 .cse57 .cse58 (<= ~mode1~0 1) .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 (<= 0 ~mode2~0) .cse40 .cse10 .cse41 .cse42 .cse43 .cse45 .cse47 .cse59 .cse48 .cse49 .cse50 .cse51 .cse60))) (= (mod ~mode2~0 256) 0) (= ~send3~0 ~id3~0) (= ~nomsg~0 ~p2_old~0) (not (= ~id3~0 ~id2~0)) (= (mod ~mode1~0 256) 0) (not (= ~id1~0 ~id3~0)) (= (* 256 (div ~mode3~0 256)) ~mode3~0) (not (= ~id1~0 ~id2~0)) .cse7 (= ~send1~0 ~id1~0) (<= ~r1~0 .cse0) .cse61 .cse62 (= ~send2~0 ~id2~0)) (and .cse63 .cse1 .cse2 .cse3 .cse4 .cse5 .cse64 .cse6 .cse10) (and .cse65 .cse66 .cse67 .cse7 .cse8 .cse9 .cse61 .cse68 .cse38 .cse40 .cse10 .cse41 .cse43 .cse69 .cse45 .cse47 .cse70 .cse49 .cse50 .cse51 .cse71 .cse72 .cse73) (and .cse63 .cse65 .cse66 .cse64 .cse67 .cse61 .cse68 .cse38 .cse40 .cse10 .cse41 .cse43 .cse69 .cse45 .cse47 .cse70 .cse49 .cse50 .cse51 .cse71 .cse72 .cse73))))) [2022-11-22 02:26:19,571 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 60) no Hoare annotation was computed. [2022-11-22 02:26:19,571 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 60) no Hoare annotation was computed. [2022-11-22 02:26:19,571 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-22 02:26:19,571 INFO L899 garLoopResultBuilder]: For program point L211-1(line 211) no Hoare annotation was computed. [2022-11-22 02:26:19,572 INFO L899 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2022-11-22 02:26:19,572 INFO L899 garLoopResultBuilder]: For program point L211-3(line 211) no Hoare annotation was computed. [2022-11-22 02:26:19,572 INFO L899 garLoopResultBuilder]: For program point L211-4(lines 211 223) no Hoare annotation was computed. [2022-11-22 02:26:19,573 INFO L895 garLoopResultBuilder]: At program point L212(lines 208 223) the Hoare annotation is: (let ((.cse47 (+ ~p1_new~0 1)) (.cse52 (+ ~p2_new~0 1)) (.cse10 (= ~mode3~0 0)) (.cse2 (= ~mode3~0 1)) (.cse57 (+ ~st3~0 ~st2~0 ~st1~0))) (let ((.cse0 (let ((.cse58 (or (= ~st3~0 0) (= ~st3~0 1)))) (or (and .cse58 (= ~st2~0 0)) (and (= ~st2~0 1) .cse58)))) (.cse1 (not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 2)))) (.cse5 (<= .cse57 1)) (.cse7 (or (= ~st1~0 1) (= ~st1~0 0))) (.cse3 (= ~nomsg~0 ~p1_new~0)) (.cse8 (= ~nomsg~0 ~p1_old~0)) (.cse9 (= ~mode1~0 0)) (.cse11 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse12 (<= 0 ~id3~0)) (.cse13 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse14 (<= 0 ~id1~0)) (.cse15 (= ~p2~0 0)) (.cse16 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse17 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse4 (= ~p3_new~0 ~nomsg~0)) (.cse18 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse19 (= .cse57 0)) (.cse20 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse21 (<= 0 ~st1~0)) (.cse22 (= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse23 (<= 0 ~st2~0)) (.cse24 (<= |ULTIMATE.start_main_~c1~0#1| 1)) (.cse25 (<= 0 ~send2~0)) (.cse6 (= ~mode1~0 1)) (.cse26 (<= ~id1~0 127)) (.cse27 (or (let ((.cse54 (+ ~p3_old~0 1))) (and (let ((.cse53 (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (or (and (not .cse53) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (and .cse53 (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|)))) (<= 0 .cse54) (<= .cse54 0) .cse10)) (and .cse2 (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (exists ((v_~p3_new~0_35 Int)) (let ((.cse55 (+ v_~p3_new~0_35 1))) (and (<= .cse55 0) (<= 0 .cse55) (= ~p3_old~0 (let ((.cse56 (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_35 ~nomsg~0)) ~send3~0 v_~p3_new~0_35) 256))) (ite (<= .cse56 127) .cse56 (+ (- 256) .cse56)))))))))) (.cse28 (<= 0 .cse52)) (.cse29 (<= .cse52 0)) (.cse30 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse31 (<= ~id3~0 127)) (.cse32 (<= 0 ~id2~0)) (.cse33 (= |#NULL.offset| 0)) (.cse34 (<= ~id2~0 127)) (.cse35 (<= 0 ~st3~0)) (.cse36 (<= (+ ~p3_new~0 1) 0)) (.cse37 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse38 (= ~p3~0 0)) (.cse39 (<= 0 .cse47)) (.cse40 (<= 0 ~send3~0)) (.cse41 (= ~p1~0 0)) (.cse42 (<= 0 |#StackHeapBarrier|)) (.cse43 (<= 0 ~send1~0)) (.cse44 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse45 (or (and (= ~mode2~0 1) (exists ((v_~p2_new~0_43 Int)) (let ((.cse48 (+ v_~p2_new~0_43 1))) (and (<= .cse48 0) (= (let ((.cse49 (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= v_~p2_new~0_43 ~nomsg~0)) ~send2~0 v_~p2_new~0_43) 256))) (ite (<= .cse49 127) .cse49 (+ .cse49 (- 256)))) ~p2_old~0) (<= 0 .cse48)))) (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|)) (let ((.cse50 (+ ~p2_old~0 1))) (and (= ~mode2~0 0) (<= 0 .cse50) (let ((.cse51 (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|))) (or (and (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) .cse51) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) (not .cse51)))) (<= .cse50 0))))) (.cse46 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse3 .cse13 .cse14 .cse15 .cse16 .cse17 .cse4 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse8 .cse28 .cse29 .cse30 .cse9 .cse10 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse11 .cse2 .cse12 .cse13 .cse14 .cse15 (<= .cse47 0) .cse16 .cse17 .cse4 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse6 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (<= 0 (+ ~nomsg~0 1)) .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46)))) [2022-11-22 02:26:19,573 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-22 02:26:19,573 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-22 02:26:19,574 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-22 02:26:19,574 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-22 02:26:19,574 INFO L899 garLoopResultBuilder]: For program point L216(line 216) no Hoare annotation was computed. [2022-11-22 02:26:19,574 INFO L899 garLoopResultBuilder]: For program point L216-1(line 216) no Hoare annotation was computed. [2022-11-22 02:26:19,574 INFO L899 garLoopResultBuilder]: For program point L216-2(line 216) no Hoare annotation was computed. [2022-11-22 02:26:19,574 INFO L899 garLoopResultBuilder]: For program point L216-3(line 216) no Hoare annotation was computed. [2022-11-22 02:26:19,577 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:26:19,580 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 02:26:19,593 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,594 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,595 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,595 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,595 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,596 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,596 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,596 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,597 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,597 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,597 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,597 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,598 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,598 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,598 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,598 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,617 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,617 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,618 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,618 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,618 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,618 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,619 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,619 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,619 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,620 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,620 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,620 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,620 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,621 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,621 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,621 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,622 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,622 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,622 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,622 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,623 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,623 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,623 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,623 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,624 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,624 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,624 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,624 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,632 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,633 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,633 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,633 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,634 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,634 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,634 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,635 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,635 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,635 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,635 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,636 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,636 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,636 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,636 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,637 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,637 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,637 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,638 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,638 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,638 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,639 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,639 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,639 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,640 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,640 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,640 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,640 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,641 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,641 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,641 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,641 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,645 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,645 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,646 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,646 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,646 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,646 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,647 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,647 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,647 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,648 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,648 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,648 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,648 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,648 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,649 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,649 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,649 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,650 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,650 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,650 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,650 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,651 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,651 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,651 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,652 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,652 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,652 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,652 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,653 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,653 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,653 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,653 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,661 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,661 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,661 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,662 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,662 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,662 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,662 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,663 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,663 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,663 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,663 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,664 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,664 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,664 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,664 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,665 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,665 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,665 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,665 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,667 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,667 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,667 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,668 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,668 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,668 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,668 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,668 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,669 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,671 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,671 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,671 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,672 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,672 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,672 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,672 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,673 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,673 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,673 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,674 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,674 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,674 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,674 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,674 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,676 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,676 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,676 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,677 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,677 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,677 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,677 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,678 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,678 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,678 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,678 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,678 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,679 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:26:19 BoogieIcfgContainer [2022-11-22 02:26:19,681 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 02:26:19,681 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 02:26:19,681 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 02:26:19,682 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 02:26:19,682 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:19:27" (3/4) ... [2022-11-22 02:26:19,685 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 02:26:19,697 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2022-11-22 02:26:19,697 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-22 02:26:19,698 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-22 02:26:19,698 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 02:26:19,724 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(r1 <= r1 / 256 * 256 + 2) && (st2 == 1 || st2 == 0)) && nomsg == p1_new) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && 1 <= st3 + st2 + st1) && (st1 == 1 || st1 == 0)) && nomsg == p1_\old) && mode1 == 0) && mode3 == 0) && 0 <= st3) || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((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 <= \old(cond)) && 0 <= st1) && p1 <= 0) && 0 <= p2) && 0 <= p3) && 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) && \old(cond) <= 1) && c1 <= 0) && 0 <= p1_new + 1) && p1_\old + 1 <= 0) && 0 <= send3) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) || ((((((((((((((((((((((((((((((((((((((((((((((((((((p3 <= 0 && 0 <= p3_new + 1) && 0 <= #NULL) && st3 <= 0) && i2 <= 0) && \old(arg) <= 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 <= \old(cond)) && 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) && \old(cond) <= 1) && 0 <= p1_new + 1) && 0 <= send3) && \result <= 1) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && 0 <= \old(arg))) && mode2 % 256 == 0) && send3 == id3) && nomsg == p2_\old) && !(id3 == id2)) && mode1 % 256 == 0) && !(id1 == id3)) && 256 * (mode3 / 256) == mode3) && !(id1 == id2)) && nomsg == p1_\old) && send1 == id1) && r1 <= r1 / 256 * 256) && 0 <= id2) && st2 == 0) && send2 == id2)) || ((((((((mode3 == 1 && (st2 == 1 || st2 == 0)) && nomsg == p1_new) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && 1 <= st3 + st2 + st1) && mode1 == 1) && (st1 == 1 || st1 == 0)) && 0 <= st3)) || ((((((((((((((((((((((tmp == 1 && r1 % 256 < 3) && ((((((!(id3 < m3) && !(id3 == m3)) || (id3 < m3 && send3 == m3)) && 0 <= p3_\old + 1) && p3_\old + 1 <= 0) && mode3 == 0) || ((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_35 : int :: (v_~p3_new~0_35 + 1 <= 0 && 0 <= v_~p3_new~0_35 + 1) && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256))))) && nomsg == p1_\old) && mode1 == 0) && mode3 == 0) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && (((mode2 == 1 && (\exists v_~p2_new~0_43 : int :: (v_~p2_new~0_43 + 1 <= 0 && (if (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 else (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 + -256) == p2_\old) && 0 <= v_~p2_new~0_43 + 1)) && nomsg == m2) || (((mode2 == 0 && 0 <= p2_\old + 1) && ((send2 == m2 && id2 < m2) || (!(m2 == id2) && !(id2 < m2)))) && p2_\old + 1 <= 0))) && (((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && st3 <= 0) && i2 <= 0) && \old(arg) <= 1) && 1 <= tmp) && 0 <= id1) && 1 <= \result) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && st1 <= 0) && \result <= 1) && 0 <= arg) && 1 <= \old(cond)) && 0 <= st1) && 0 <= st2) && 0 <= p2) && c1 <= 1) && 0 <= send2) && 1 <= c1) && id1 <= 127) && 0 <= p2_new + 1) && arg <= 1) && nomsg + 1 <= 0) && st2 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && p2 <= 0) && \result <= 1) && 0 <= \old(arg)) || (((((((((((((((((((((((((((((((((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 <= \old(cond)) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && p3_\old + 1 <= 0) && send2 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && st2 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && p2 <= 0) && c1 <= 0) && p2_\old + 1 <= 0) && p1_\old + 1 <= 0))) && #NULL == 0)) || (((((((((((((((((((((mode3 == 1 && tmp == 1) && r1 % 256 < 3) && mode1 == 1) && ((((((!(id3 < m3) && !(id3 == m3)) || (id3 < m3 && send3 == m3)) && 0 <= p3_\old + 1) && p3_\old + 1 <= 0) && mode3 == 0) || ((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_35 : int :: (v_~p3_new~0_35 + 1 <= 0 && 0 <= v_~p3_new~0_35 + 1) && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256))))) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && (((mode2 == 1 && (\exists v_~p2_new~0_43 : int :: (v_~p2_new~0_43 + 1 <= 0 && (if (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 else (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 + -256) == p2_\old) && 0 <= v_~p2_new~0_43 + 1)) && nomsg == m2) || (((mode2 == 0 && 0 <= p2_\old + 1) && ((send2 == m2 && id2 < m2) || (!(m2 == id2) && !(id2 < m2)))) && p2_\old + 1 <= 0))) && (((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && st3 <= 0) && i2 <= 0) && \old(arg) <= 1) && 1 <= tmp) && 0 <= id1) && 1 <= \result) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && st1 <= 0) && \result <= 1) && 0 <= arg) && 1 <= \old(cond)) && 0 <= st1) && 0 <= st2) && 0 <= p2) && c1 <= 1) && 0 <= send2) && 1 <= c1) && id1 <= 127) && 0 <= p2_new + 1) && arg <= 1) && nomsg + 1 <= 0) && st2 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && p2 <= 0) && \result <= 1) && 0 <= \old(arg)) || (((((((((((((((((((((((((((((((((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 <= \old(cond)) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && p3_\old + 1 <= 0) && send2 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && st2 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && p2 <= 0) && c1 <= 0) && p2_\old + 1 <= 0) && p1_\old + 1 <= 0))) && #NULL == 0) [2022-11-22 02:26:19,725 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(r1 <= r1 / 256 * 256 + 2) && (st2 == 1 || st2 == 0)) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && 1 <= st3 + st2 + st1) && mode1 == 1) && (st1 == 1 || st1 == 0)) && nomsg == p1_\old) && mode3 == 0) && 0 <= st3) || (((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && st3 <= 0) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= \old(cond)) && 0 <= st1) && i2 == 0) && 0 <= st2) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && st1 <= 1) && nomsg == p1_\old) && 0 <= p2_new + 1) && st2 <= 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) && \old(cond) <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((((((0 <= c1 && 1 <= tmp) && mode2 % 256 == 0) && p2 == 0) && tmp <= 1) && 1 <= cond) && send3 == id3) && p3_new == nomsg) && \result <= 1) && nomsg == p2_\old) && !(id3 == id2)) && 0 <= st3 + st1) && 1 <= \old(cond)) && !(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) && 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) && \old(cond) <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && send2 == id2) && #NULL == 0)) || ((((((((mode3 == 1 && (st2 == 1 || st2 == 0)) && nomsg == p1_new) && p3_new == nomsg) && 1 <= st3 + st2 + st1) && (st1 == 1 || st1 == 0)) && mode1 == 0) && st3 <= 1) && 0 <= st3)) || (((((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode3 == 1) && 0 <= id3) && 0 <= p3_new + 1) && st3 <= 0) && 1 <= tmp) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && mode2 <= 1) && 1 <= \old(cond)) && 0 <= st1) && i2 == 0) && 0 <= st2) && c1 <= 1) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && st2 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) [2022-11-22 02:26:19,726 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((st3 == 0 || st3 == 1) && st2 == 0) || (st2 == 1 && (st3 == 0 || st3 == 1))) && !(r1 <= r1 / 256 * 256 + 2)) && mode3 == 1) && nomsg == p1_new) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && mode1 == 1) && (st1 == 1 || st1 == 0)) || (((((((((((st3 == 0 || st3 == 1) && st2 == 0) || (st2 == 1 && (st3 == 0 || st3 == 1))) && !(r1 <= r1 / 256 * 256 + 2)) && nomsg == p1_new) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && (st1 == 1 || st1 == 0)) && nomsg == p1_\old) && mode1 == 0) && mode3 == 0)) || ((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && nomsg == p1_new) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && st3 + st2 + st1 == 0) && 1 <= \old(cond)) && 0 <= st1) && i2 == 0) && 0 <= st2) && c1 <= 1) && 0 <= send2) && id1 <= 127) && ((((((!(id3 < m3) && !(id3 == m3)) || (id3 < m3 && send3 == m3)) && 0 <= p3_\old + 1) && p3_\old + 1 <= 0) && mode3 == 0) || ((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_35 : int :: (v_~p3_new~0_35 + 1 <= 0 && 0 <= v_~p3_new~0_35 + 1) && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256))))) && nomsg == p1_\old) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && mode3 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && (((mode2 == 1 && (\exists v_~p2_new~0_43 : int :: (v_~p2_new~0_43 + 1 <= 0 && (if (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 else (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 + -256) == p2_\old) && 0 <= v_~p2_new~0_43 + 1)) && nomsg == m2) || (((mode2 == 0 && 0 <= p2_\old + 1) && ((send2 == m2 && id2 < m2) || (!(m2 == id2) && !(id2 < m2)))) && p2_\old + 1 <= 0))) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode3 == 1) && 0 <= id3) && 1 <= tmp) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && st3 + st2 + st1 == 0) && 1 <= \old(cond)) && 0 <= st1) && i2 == 0) && 0 <= st2) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && ((((((!(id3 < m3) && !(id3 == m3)) || (id3 < m3 && send3 == m3)) && 0 <= p3_\old + 1) && p3_\old + 1 <= 0) && mode3 == 0) || ((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_35 : int :: (v_~p3_new~0_35 + 1 <= 0 && 0 <= v_~p3_new~0_35 + 1) && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256))))) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && (((mode2 == 1 && (\exists v_~p2_new~0_43 : int :: (v_~p2_new~0_43 + 1 <= 0 && (if (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 else (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 + -256) == p2_\old) && 0 <= v_~p2_new~0_43 + 1)) && nomsg == m2) || (((mode2 == 0 && 0 <= p2_\old + 1) && ((send2 == m2 && id2 < m2) || (!(m2 == id2) && !(id2 < m2)))) && p2_\old + 1 <= 0))) && #NULL == 0) [2022-11-22 02:26:19,726 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode3 == 1) && 0 <= id3) && tmp == 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && tmp <= 1) && r1 % 256 < 3) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && st3 + st2 + st1 == 0) && 1 <= \old(cond)) && 0 <= st1) && i2 == 0) && 0 <= st2) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && ((((((!(id3 < m3) && !(id3 == m3)) || (id3 < m3 && send3 == m3)) && 0 <= p3_\old + 1) && p3_\old + 1 <= 0) && mode3 == 0) || ((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_35 : int :: (v_~p3_new~0_35 + 1 <= 0 && 0 <= v_~p3_new~0_35 + 1) && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256))))) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && (((mode2 == 1 && (\exists v_~p2_new~0_43 : int :: (v_~p2_new~0_43 + 1 <= 0 && (if (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 else (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 + -256) == p2_\old) && 0 <= v_~p2_new~0_43 + 1)) && nomsg == m2) || (((mode2 == 0 && 0 <= p2_\old + 1) && ((send2 == m2 && id2 < m2) || (!(m2 == id2) && !(id2 < m2)))) && p2_\old + 1 <= 0))) && #NULL == 0) || (tmp == 0 && mode1 == 0)) || ((((((((((st3 == 0 || st3 == 1) && st2 == 0) || (st2 == 1 && (st3 == 0 || st3 == 1))) && mode3 == 1) && nomsg == p1_new) && tmp == 0) && (tmp == 0 || 1 <= st3 + st2 + st1)) && p3_new == nomsg) && mode1 == 1) && (st1 == 1 || st1 == 0))) || (((((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && tmp == 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && tmp <= 1) && r1 % 256 < 3) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && st3 + st2 + st1 == 0) && 1 <= \old(cond)) && 0 <= st1) && i2 == 0) && 0 <= st2) && c1 <= 1) && 0 <= send2) && id1 <= 127) && ((((((!(id3 < m3) && !(id3 == m3)) || (id3 < m3 && send3 == m3)) && 0 <= p3_\old + 1) && p3_\old + 1 <= 0) && mode3 == 0) || ((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_35 : int :: (v_~p3_new~0_35 + 1 <= 0 && 0 <= v_~p3_new~0_35 + 1) && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256))))) && nomsg == p1_\old) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && mode3 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && (((mode2 == 1 && (\exists v_~p2_new~0_43 : int :: (v_~p2_new~0_43 + 1 <= 0 && (if (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 else (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 + -256) == p2_\old) && 0 <= v_~p2_new~0_43 + 1)) && nomsg == m2) || (((mode2 == 0 && 0 <= p2_\old + 1) && ((send2 == m2 && id2 < m2) || (!(m2 == id2) && !(id2 < m2)))) && p2_\old + 1 <= 0))) && #NULL == 0)) || ((((((((((((st3 == 0 || st3 == 1) && st2 == 0) || (st2 == 1 && (st3 == 0 || st3 == 1))) && !(r1 <= r1 / 256 * 256 + 2)) && nomsg == p1_new) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && 1 <= st3 + st2 + st1) && (st1 == 1 || st1 == 0)) && nomsg == p1_\old) && mode1 == 0) && mode3 == 0)) || ((((((((((st3 == 0 || st3 == 1) && st2 == 0) || (st2 == 1 && (st3 == 0 || st3 == 1))) && mode3 == 1) && nomsg == p1_new) && (tmp == 0 || 1 <= st3 + st2 + st1)) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && mode1 == 1) && (st1 == 1 || st1 == 0)) [2022-11-22 02:26:19,749 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 02:26:19,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 02:26:19,750 INFO L158 Benchmark]: Toolchain (without parser) took 413767.03ms. Allocated memory was 176.2MB in the beginning and 851.4MB in the end (delta: 675.3MB). Free memory was 141.6MB in the beginning and 603.3MB in the end (delta: -461.7MB). Peak memory consumption was 215.4MB. Max. memory is 16.1GB. [2022-11-22 02:26:19,751 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 130.0MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:26:19,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.55ms. Allocated memory is still 176.2MB. Free memory was 141.6MB in the beginning and 128.2MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-22 02:26:19,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.59ms. Allocated memory is still 176.2MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:26:19,752 INFO L158 Benchmark]: Boogie Preprocessor took 28.65ms. Allocated memory is still 176.2MB. Free memory was 126.1MB in the beginning and 124.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:26:19,754 INFO L158 Benchmark]: RCFGBuilder took 922.48ms. Allocated memory is still 176.2MB. Free memory was 124.6MB in the beginning and 70.1MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2022-11-22 02:26:19,754 INFO L158 Benchmark]: TraceAbstraction took 412386.89ms. Allocated memory was 176.2MB in the beginning and 851.4MB in the end (delta: 675.3MB). Free memory was 69.5MB in the beginning and 608.6MB in the end (delta: -539.1MB). Peak memory consumption was 460.8MB. Max. memory is 16.1GB. [2022-11-22 02:26:19,755 INFO L158 Benchmark]: Witness Printer took 68.52ms. Allocated memory is still 851.4MB. Free memory was 608.6MB in the beginning and 603.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 02:26:19,756 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.30ms. Allocated memory is still 130.0MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.55ms. Allocated memory is still 176.2MB. Free memory was 141.6MB in the beginning and 128.2MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.59ms. Allocated memory is still 176.2MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.65ms. Allocated memory is still 176.2MB. Free memory was 126.1MB in the beginning and 124.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 922.48ms. Allocated memory is still 176.2MB. Free memory was 124.6MB in the beginning and 70.1MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 412386.89ms. Allocated memory was 176.2MB in the beginning and 851.4MB in the end (delta: 675.3MB). Free memory was 69.5MB in the beginning and 608.6MB in the end (delta: -539.1MB). Peak memory consumption was 460.8MB. Max. memory is 16.1GB. * Witness Printer took 68.52ms. Allocated memory is still 851.4MB. Free memory was 608.6MB in the beginning and 603.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,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: 412.2s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 30.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 40.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4839 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4839 mSDsluCounter, 1333 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 889 mSDsCounter, 532 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4107 IncrementalHoareTripleChecker+Invalid, 4639 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 532 mSolverCounterUnsat, 444 mSDtfsCounter, 4107 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1390 GetRequests, 913 SyntacticMatches, 16 SemanticMatches, 461 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10909 ImplicationChecksByTransitivity, 94.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=14, InterpolantAutomatonStates: 173, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 459 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 74 NumberOfFragments, 3632 HoareAnnotationTreeSize, 5 FomulaSimplifications, 244523 FormulaSimplificationTreeSizeReduction, 21.3s HoareSimplificationTime, 5 FomulaSimplificationsInter, 290930 FormulaSimplificationTreeSizeReductionInter, 18.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 193.6s InterpolantComputationTime, 1024 NumberOfCodeBlocks, 1024 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1396 ConstructedInterpolants, 0 QuantifiedInterpolants, 102262 SizeOfPredicates, 286 NumberOfNonLiveVariables, 2088 ConjunctsInSsa, 219 ConjunctsInUnsatCore, 36 InterpolantComputations, 11 PerfectInterpolantSequences, 411/1458 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: 8.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 24, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 73, TOOLS_POST_TIME: 8.0s, 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: 73, TOOLS_QUANTIFIERELIM_TIME: 8.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.7s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 99, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 9, DOMAIN_JOIN_TIME: 0.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 24, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 4.3s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 4.3s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 974, DAG_COMPRESSION_RETAINED_NODES: 80, 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-22 02:26:19,789 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,789 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,789 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,790 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,790 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,790 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,790 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,791 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,791 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,791 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,791 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,791 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,792 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,792 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,792 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,792 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,793 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,793 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,793 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,793 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,793 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,794 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,794 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,794 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,794 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,795 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,795 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,795 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,795 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,795 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,796 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,796 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,799 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,799 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,799 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,800 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,800 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,800 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,801 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,801 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,801 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,801 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,801 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,802 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,802 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,802 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,802 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,802 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,803 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,803 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,803 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,803 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,804 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,804 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,804 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,804 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] Derived loop invariant: (((((((((((((!(r1 <= r1 / 256 * 256 + 2) && (st2 == 1 || st2 == 0)) && nomsg == p1_new) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && 1 <= st3 + st2 + st1) && (st1 == 1 || st1 == 0)) && nomsg == p1_\old) && mode1 == 0) && mode3 == 0) && 0 <= st3) || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((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 <= \old(cond)) && 0 <= st1) && p1 <= 0) && 0 <= p2) && 0 <= p3) && 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) && \old(cond) <= 1) && c1 <= 0) && 0 <= p1_new + 1) && p1_\old + 1 <= 0) && 0 <= send3) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) || ((((((((((((((((((((((((((((((((((((((((((((((((((((p3 <= 0 && 0 <= p3_new + 1) && 0 <= #NULL) && st3 <= 0) && i2 <= 0) && \old(arg) <= 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 <= \old(cond)) && 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) && \old(cond) <= 1) && 0 <= p1_new + 1) && 0 <= send3) && \result <= 1) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && 0 <= \old(arg))) && mode2 % 256 == 0) && send3 == id3) && nomsg == p2_\old) && !(id3 == id2)) && mode1 % 256 == 0) && !(id1 == id3)) && 256 * (mode3 / 256) == mode3) && !(id1 == id2)) && nomsg == p1_\old) && send1 == id1) && r1 <= r1 / 256 * 256) && 0 <= id2) && st2 == 0) && send2 == id2)) || ((((((((mode3 == 1 && (st2 == 1 || st2 == 0)) && nomsg == p1_new) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && 1 <= st3 + st2 + st1) && mode1 == 1) && (st1 == 1 || st1 == 0)) && 0 <= st3)) || ((((((((((((((((((((((tmp == 1 && r1 % 256 < 3) && ((((((!(id3 < m3) && !(id3 == m3)) || (id3 < m3 && send3 == m3)) && 0 <= p3_\old + 1) && p3_\old + 1 <= 0) && mode3 == 0) || ((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_35 : int :: (v_~p3_new~0_35 + 1 <= 0 && 0 <= v_~p3_new~0_35 + 1) && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256))))) && nomsg == p1_\old) && mode1 == 0) && mode3 == 0) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && (((mode2 == 1 && (\exists v_~p2_new~0_43 : int :: (v_~p2_new~0_43 + 1 <= 0 && (if (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 else (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 + -256) == p2_\old) && 0 <= v_~p2_new~0_43 + 1)) && nomsg == m2) || (((mode2 == 0 && 0 <= p2_\old + 1) && ((send2 == m2 && id2 < m2) || (!(m2 == id2) && !(id2 < m2)))) && p2_\old + 1 <= 0))) && (((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && st3 <= 0) && i2 <= 0) && \old(arg) <= 1) && 1 <= tmp) && 0 <= id1) && 1 <= \result) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && st1 <= 0) && \result <= 1) && 0 <= arg) && 1 <= \old(cond)) && 0 <= st1) && 0 <= st2) && 0 <= p2) && c1 <= 1) && 0 <= send2) && 1 <= c1) && id1 <= 127) && 0 <= p2_new + 1) && arg <= 1) && nomsg + 1 <= 0) && st2 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && p2 <= 0) && \result <= 1) && 0 <= \old(arg)) || (((((((((((((((((((((((((((((((((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 <= \old(cond)) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && p3_\old + 1 <= 0) && send2 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && st2 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && p2 <= 0) && c1 <= 0) && p2_\old + 1 <= 0) && p1_\old + 1 <= 0))) && #NULL == 0)) || (((((((((((((((((((((mode3 == 1 && tmp == 1) && r1 % 256 < 3) && mode1 == 1) && ((((((!(id3 < m3) && !(id3 == m3)) || (id3 < m3 && send3 == m3)) && 0 <= p3_\old + 1) && p3_\old + 1 <= 0) && mode3 == 0) || ((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_35 : int :: (v_~p3_new~0_35 + 1 <= 0 && 0 <= v_~p3_new~0_35 + 1) && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256))))) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && (((mode2 == 1 && (\exists v_~p2_new~0_43 : int :: (v_~p2_new~0_43 + 1 <= 0 && (if (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 else (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 + -256) == p2_\old) && 0 <= v_~p2_new~0_43 + 1)) && nomsg == m2) || (((mode2 == 0 && 0 <= p2_\old + 1) && ((send2 == m2 && id2 < m2) || (!(m2 == id2) && !(id2 < m2)))) && p2_\old + 1 <= 0))) && (((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && st3 <= 0) && i2 <= 0) && \old(arg) <= 1) && 1 <= tmp) && 0 <= id1) && 1 <= \result) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && st1 <= 0) && \result <= 1) && 0 <= arg) && 1 <= \old(cond)) && 0 <= st1) && 0 <= st2) && 0 <= p2) && c1 <= 1) && 0 <= send2) && 1 <= c1) && id1 <= 127) && 0 <= p2_new + 1) && arg <= 1) && nomsg + 1 <= 0) && st2 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && p2 <= 0) && \result <= 1) && 0 <= \old(arg)) || (((((((((((((((((((((((((((((((((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 <= \old(cond)) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && p3_\old + 1 <= 0) && send2 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && st2 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && p2 <= 0) && c1 <= 0) && p2_\old + 1 <= 0) && p1_\old + 1 <= 0))) && #NULL == 0) - InvariantResult [Line: 207]: Loop Invariant [2022-11-22 02:26:19,809 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,810 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,810 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,810 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,810 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,811 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,811 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,811 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,811 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,812 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,812 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,812 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,812 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,812 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,813 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,813 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,813 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,813 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,814 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,814 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,814 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,814 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,815 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,815 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,815 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,815 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,816 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,816 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,816 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,816 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,816 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,817 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,818 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,819 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,819 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,819 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,820 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,820 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,820 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,820 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,821 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,821 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,821 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,821 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,821 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,822 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,822 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,822 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,822 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,823 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,823 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,823 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,823 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,824 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,824 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,824 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,824 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,825 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,825 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,825 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,825 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,825 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,826 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,826 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode3 == 1) && 0 <= id3) && tmp == 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && tmp <= 1) && r1 % 256 < 3) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && st3 + st2 + st1 == 0) && 1 <= \old(cond)) && 0 <= st1) && i2 == 0) && 0 <= st2) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && ((((((!(id3 < m3) && !(id3 == m3)) || (id3 < m3 && send3 == m3)) && 0 <= p3_\old + 1) && p3_\old + 1 <= 0) && mode3 == 0) || ((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_35 : int :: (v_~p3_new~0_35 + 1 <= 0 && 0 <= v_~p3_new~0_35 + 1) && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256))))) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && (((mode2 == 1 && (\exists v_~p2_new~0_43 : int :: (v_~p2_new~0_43 + 1 <= 0 && (if (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 else (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 + -256) == p2_\old) && 0 <= v_~p2_new~0_43 + 1)) && nomsg == m2) || (((mode2 == 0 && 0 <= p2_\old + 1) && ((send2 == m2 && id2 < m2) || (!(m2 == id2) && !(id2 < m2)))) && p2_\old + 1 <= 0))) && #NULL == 0) || (tmp == 0 && mode1 == 0)) || ((((((((((st3 == 0 || st3 == 1) && st2 == 0) || (st2 == 1 && (st3 == 0 || st3 == 1))) && mode3 == 1) && nomsg == p1_new) && tmp == 0) && (tmp == 0 || 1 <= st3 + st2 + st1)) && p3_new == nomsg) && mode1 == 1) && (st1 == 1 || st1 == 0))) || (((((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && tmp == 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && tmp <= 1) && r1 % 256 < 3) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && st3 + st2 + st1 == 0) && 1 <= \old(cond)) && 0 <= st1) && i2 == 0) && 0 <= st2) && c1 <= 1) && 0 <= send2) && id1 <= 127) && ((((((!(id3 < m3) && !(id3 == m3)) || (id3 < m3 && send3 == m3)) && 0 <= p3_\old + 1) && p3_\old + 1 <= 0) && mode3 == 0) || ((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_35 : int :: (v_~p3_new~0_35 + 1 <= 0 && 0 <= v_~p3_new~0_35 + 1) && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256))))) && nomsg == p1_\old) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && mode3 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && (((mode2 == 1 && (\exists v_~p2_new~0_43 : int :: (v_~p2_new~0_43 + 1 <= 0 && (if (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 else (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 + -256) == p2_\old) && 0 <= v_~p2_new~0_43 + 1)) && nomsg == m2) || (((mode2 == 0 && 0 <= p2_\old + 1) && ((send2 == m2 && id2 < m2) || (!(m2 == id2) && !(id2 < m2)))) && p2_\old + 1 <= 0))) && #NULL == 0)) || ((((((((((((st3 == 0 || st3 == 1) && st2 == 0) || (st2 == 1 && (st3 == 0 || st3 == 1))) && !(r1 <= r1 / 256 * 256 + 2)) && nomsg == p1_new) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && 1 <= st3 + st2 + st1) && (st1 == 1 || st1 == 0)) && nomsg == p1_\old) && mode1 == 0) && mode3 == 0)) || ((((((((((st3 == 0 || st3 == 1) && st2 == 0) || (st2 == 1 && (st3 == 0 || st3 == 1))) && mode3 == 1) && nomsg == p1_new) && (tmp == 0 || 1 <= st3 + st2 + st1)) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && mode1 == 1) && (st1 == 1 || st1 == 0)) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((((((((((!(r1 <= r1 / 256 * 256 + 2) && (st2 == 1 || st2 == 0)) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && 1 <= st3 + st2 + st1) && mode1 == 1) && (st1 == 1 || st1 == 0)) && nomsg == p1_\old) && mode3 == 0) && 0 <= st3) || (((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && st3 <= 0) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= \old(cond)) && 0 <= st1) && i2 == 0) && 0 <= st2) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && st1 <= 1) && nomsg == p1_\old) && 0 <= p2_new + 1) && st2 <= 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) && \old(cond) <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((((((0 <= c1 && 1 <= tmp) && mode2 % 256 == 0) && p2 == 0) && tmp <= 1) && 1 <= cond) && send3 == id3) && p3_new == nomsg) && \result <= 1) && nomsg == p2_\old) && !(id3 == id2)) && 0 <= st3 + st1) && 1 <= \old(cond)) && !(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) && 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) && \old(cond) <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && send2 == id2) && #NULL == 0)) || ((((((((mode3 == 1 && (st2 == 1 || st2 == 0)) && nomsg == p1_new) && p3_new == nomsg) && 1 <= st3 + st2 + st1) && (st1 == 1 || st1 == 0)) && mode1 == 0) && st3 <= 1) && 0 <= st3)) || (((((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode3 == 1) && 0 <= id3) && 0 <= p3_new + 1) && st3 <= 0) && 1 <= tmp) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && mode2 <= 1) && 1 <= \old(cond)) && 0 <= st1) && i2 == 0) && 0 <= st2) && c1 <= 1) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && st2 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) - InvariantResult [Line: 208]: Loop Invariant [2022-11-22 02:26:19,830 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,831 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,831 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,831 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,832 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,832 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,832 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,832 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,833 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,833 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,833 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,833 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,833 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,834 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,834 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,834 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,834 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,835 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,835 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,835 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,835 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,835 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,836 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,836 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,836 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,836 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,837 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,837 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,837 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,837 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,837 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,837 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,839 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,839 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,840 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,840 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,840 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,840 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,841 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,841 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,841 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,841 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,842 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,842 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,842 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,842 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,842 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,843 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,843 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,843 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,843 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,844 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,844 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,844 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,844 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,844 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_35,QUANTIFIED] [2022-11-22 02:26:19,845 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,845 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,845 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,845 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,845 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,846 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,846 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] [2022-11-22 02:26:19,846 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_43,QUANTIFIED] Derived loop invariant: ((((((((((((st3 == 0 || st3 == 1) && st2 == 0) || (st2 == 1 && (st3 == 0 || st3 == 1))) && !(r1 <= r1 / 256 * 256 + 2)) && mode3 == 1) && nomsg == p1_new) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && mode1 == 1) && (st1 == 1 || st1 == 0)) || (((((((((((st3 == 0 || st3 == 1) && st2 == 0) || (st2 == 1 && (st3 == 0 || st3 == 1))) && !(r1 <= r1 / 256 * 256 + 2)) && nomsg == p1_new) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && (st1 == 1 || st1 == 0)) && nomsg == p1_\old) && mode1 == 0) && mode3 == 0)) || ((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && nomsg == p1_new) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && st3 + st2 + st1 == 0) && 1 <= \old(cond)) && 0 <= st1) && i2 == 0) && 0 <= st2) && c1 <= 1) && 0 <= send2) && id1 <= 127) && ((((((!(id3 < m3) && !(id3 == m3)) || (id3 < m3 && send3 == m3)) && 0 <= p3_\old + 1) && p3_\old + 1 <= 0) && mode3 == 0) || ((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_35 : int :: (v_~p3_new~0_35 + 1 <= 0 && 0 <= v_~p3_new~0_35 + 1) && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256))))) && nomsg == p1_\old) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && mode3 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && (((mode2 == 1 && (\exists v_~p2_new~0_43 : int :: (v_~p2_new~0_43 + 1 <= 0 && (if (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 else (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 + -256) == p2_\old) && 0 <= v_~p2_new~0_43 + 1)) && nomsg == m2) || (((mode2 == 0 && 0 <= p2_\old + 1) && ((send2 == m2 && id2 < m2) || (!(m2 == id2) && !(id2 < m2)))) && p2_\old + 1 <= 0))) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode3 == 1) && 0 <= id3) && 1 <= tmp) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && st3 + st2 + st1 == 0) && 1 <= \old(cond)) && 0 <= st1) && i2 == 0) && 0 <= st2) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && ((((((!(id3 < m3) && !(id3 == m3)) || (id3 < m3 && send3 == m3)) && 0 <= p3_\old + 1) && p3_\old + 1 <= 0) && mode3 == 0) || ((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_35 : int :: (v_~p3_new~0_35 + 1 <= 0 && 0 <= v_~p3_new~0_35 + 1) && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_35 == nomsg then send3 else v_~p3_new~0_35) % 256))))) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && (((mode2 == 1 && (\exists v_~p2_new~0_43 : int :: (v_~p2_new~0_43 + 1 <= 0 && (if (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 else (if !(send2 == nomsg) && v_~p2_new~0_43 == nomsg then send2 else v_~p2_new~0_43) % 256 + -256) == p2_\old) && 0 <= v_~p2_new~0_43 + 1)) && nomsg == m2) || (((mode2 == 0 && 0 <= p2_\old + 1) && ((send2 == m2 && id2 < m2) || (!(m2 == id2) && !(id2 < m2)))) && p2_\old + 1 <= 0))) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-22 02:26:19,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb130d76-a0dd-4a40-ad61-fdb853259765/bin/utaipan-g80aRyZoba/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