./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.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_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/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_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/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_04d135b0-ad7b-4043-8fe0-940d942f4b27/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 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 --- 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 00:19:07,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:19:07,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:19:07,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:19:07,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:19:07,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:19:07,141 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:19:07,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:19:07,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:19:07,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:19:07,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:19:07,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:19:07,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:19:07,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:19:07,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:19:07,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:19:07,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:19:07,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:19:07,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:19:07,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:19:07,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:19:07,168 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:19:07,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:19:07,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:19:07,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:19:07,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:19:07,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:19:07,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:19:07,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:19:07,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:19:07,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:19:07,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:19:07,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:19:07,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:19:07,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:19:07,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:19:07,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:19:07,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:19:07,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:19:07,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:19:07,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:19:07,198 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 00:19:07,227 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:19:07,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:19:07,228 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:19:07,228 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:19:07,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:19:07,229 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:19:07,229 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:19:07,229 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:19:07,230 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:19:07,230 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:19:07,231 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:19:07,231 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:19:07,231 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:19:07,231 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:19:07,232 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:19:07,232 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:19:07,232 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:19:07,232 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:19:07,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:19:07,233 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:19:07,233 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 00:19:07,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:19:07,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:19:07,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:19:07,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 00:19:07,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:19:07,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 00:19:07,235 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 00:19:07,235 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:19:07,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 00:19:07,236 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:19:07,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 00:19:07,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:19:07,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:19:07,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:19:07,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:19:07,238 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:19:07,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:19:07,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 00:19:07,239 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:19:07,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:19:07,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 00:19:07,239 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:19:07,240 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_04d135b0-ad7b-4043-8fe0-940d942f4b27/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_04d135b0-ad7b-4043-8fe0-940d942f4b27/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 -> 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 [2022-11-22 00:19:07,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:19:07,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:19:07,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:19:07,515 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:19:07,516 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:19:07,517 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-11-22 00:19:10,474 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:19:10,748 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:19:10,748 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-11-22 00:19:10,760 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/data/9b90b1dd2/87f2c239002045b98941076fb27cec92/FLAGdfc5de195 [2022-11-22 00:19:10,776 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/data/9b90b1dd2/87f2c239002045b98941076fb27cec92 [2022-11-22 00:19:10,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:19:10,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:19:10,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:19:10,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:19:10,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:19:10,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:19:10" (1/1) ... [2022-11-22 00:19:10,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18bdc65d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:10, skipping insertion in model container [2022-11-22 00:19:10,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:19:10" (1/1) ... [2022-11-22 00:19:10,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:19:10,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:19:11,001 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_04d135b0-ad7b-4043-8fe0-940d942f4b27/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2022-11-22 00:19:11,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:19:11,013 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:19:11,051 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_04d135b0-ad7b-4043-8fe0-940d942f4b27/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2022-11-22 00:19:11,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:19:11,066 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:19:11,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:11 WrapperNode [2022-11-22 00:19:11,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:19:11,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:19:11,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:19:11,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:19:11,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:11" (1/1) ... [2022-11-22 00:19:11,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:11" (1/1) ... [2022-11-22 00:19:11,121 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 222 [2022-11-22 00:19:11,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:19:11,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:19:11,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:19:11,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:19:11,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:11" (1/1) ... [2022-11-22 00:19:11,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:11" (1/1) ... [2022-11-22 00:19:11,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:11" (1/1) ... [2022-11-22 00:19:11,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:11" (1/1) ... [2022-11-22 00:19:11,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:11" (1/1) ... [2022-11-22 00:19:11,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:11" (1/1) ... [2022-11-22 00:19:11,157 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:11" (1/1) ... [2022-11-22 00:19:11,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:11" (1/1) ... [2022-11-22 00:19:11,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:19:11,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:19:11,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:19:11,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:19:11,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:11" (1/1) ... [2022-11-22 00:19:11,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:19:11,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:19:11,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:19:11,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:19:11,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:19:11,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 00:19:11,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:19:11,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:19:11,376 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:19:11,378 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:19:11,801 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:19:12,139 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:19:12,139 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-22 00:19:12,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:19:12 BoogieIcfgContainer [2022-11-22 00:19:12,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:19:12,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:19:12,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:19:12,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:19:12,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:19:10" (1/3) ... [2022-11-22 00:19:12,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6809a2f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:19:12, skipping insertion in model container [2022-11-22 00:19:12,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:11" (2/3) ... [2022-11-22 00:19:12,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6809a2f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:19:12, skipping insertion in model container [2022-11-22 00:19:12,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:19:12" (3/3) ... [2022-11-22 00:19:12,167 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-11-22 00:19:12,197 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:19:12,198 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-22 00:19:12,262 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:19:12,269 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;@18d47861, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:19:12,270 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-22 00:19:12,274 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 00:19:12,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 00:19:12,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:12,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 00:19:12,281 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 00:19:12,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:12,286 INFO L85 PathProgramCache]: Analyzing trace with hash 11472576, now seen corresponding path program 1 times [2022-11-22 00:19:12,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:12,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029650953] [2022-11-22 00:19:12,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:12,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:12,474 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 00:19:12,475 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:12,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029650953] [2022-11-22 00:19:12,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029650953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:12,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:12,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:19:12,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249126322] [2022-11-22 00:19:12,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:12,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 00:19:12,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:12,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 00:19:12,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 00:19:12,534 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 2 states, 1 states have (on average 4.0) 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 00:19:12,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:12,587 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-11-22 00:19:12,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 00:19:12,589 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) 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 00:19:12,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:12,598 INFO L225 Difference]: With dead ends: 38 [2022-11-22 00:19:12,598 INFO L226 Difference]: Without dead ends: 35 [2022-11-22 00:19:12,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 00:19:12,604 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:12,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:19:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-22 00:19:12,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-22 00:19:12,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-11-22 00:19:12,638 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 4 [2022-11-22 00:19:12,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:12,638 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-11-22 00:19:12,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) 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 00:19:12,639 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-11-22 00:19:12,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 00:19:12,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:12,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 00:19:12,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:19:12,640 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 00:19:12,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:12,641 INFO L85 PathProgramCache]: Analyzing trace with hash 355501231, now seen corresponding path program 1 times [2022-11-22 00:19:12,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:12,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096806675] [2022-11-22 00:19:12,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:12,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:12,985 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 00:19:12,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:12,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096806675] [2022-11-22 00:19:12,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096806675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:12,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:12,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:19:12,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776175166] [2022-11-22 00:19:12,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:12,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:19:12,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:12,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:19:12,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:19:12,997 INFO L87 Difference]: Start difference. First operand 35 states and 40 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 00:19:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:13,194 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-11-22 00:19:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:19:13,195 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 00:19:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:13,196 INFO L225 Difference]: With dead ends: 69 [2022-11-22 00:19:13,198 INFO L226 Difference]: Without dead ends: 66 [2022-11-22 00:19:13,199 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 00:19:13,201 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:13,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 24 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:19:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-22 00:19:13,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-11-22 00:19:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 54 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2022-11-22 00:19:13,220 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 5 [2022-11-22 00:19:13,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:13,221 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2022-11-22 00:19:13,225 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 00:19:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2022-11-22 00:19:13,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 00:19:13,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:13,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 00:19:13,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 00:19:13,226 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 00:19:13,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:13,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1864363488, now seen corresponding path program 1 times [2022-11-22 00:19:13,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:13,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28978353] [2022-11-22 00:19:13,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:13,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:13,425 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 00:19:13,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:13,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28978353] [2022-11-22 00:19:13,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28978353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:13,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:13,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:19:13,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865215539] [2022-11-22 00:19:13,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:13,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:19:13,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:13,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:19:13,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:19:13,429 INFO L87 Difference]: Start difference. First operand 55 states and 74 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 00:19:13,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:13,555 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-11-22 00:19:13,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:19:13,556 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 00:19:13,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:13,557 INFO L225 Difference]: With dead ends: 66 [2022-11-22 00:19:13,557 INFO L226 Difference]: Without dead ends: 63 [2022-11-22 00:19:13,557 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 00:19:13,558 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:13,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 27 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:19:13,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-22 00:19:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2022-11-22 00:19:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 54 states have internal predecessors, (71), 0 states have call successors, (0), 0 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 00:19:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2022-11-22 00:19:13,569 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 6 [2022-11-22 00:19:13,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:13,570 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2022-11-22 00:19:13,570 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 00:19:13,570 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2022-11-22 00:19:13,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 00:19:13,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:13,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:13,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 00:19:13,571 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 00:19:13,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:13,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1960693039, now seen corresponding path program 1 times [2022-11-22 00:19:13,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:13,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55805023] [2022-11-22 00:19:13,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:13,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:13,844 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 00:19:13,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:13,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55805023] [2022-11-22 00:19:13,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55805023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:13,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:13,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:19:13,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909965778] [2022-11-22 00:19:13,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:13,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:19:13,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:13,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:19:13,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:19:13,848 INFO L87 Difference]: Start difference. First operand 55 states and 71 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 00:19:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:13,948 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2022-11-22 00:19:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:19:13,949 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 00:19:13,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:13,950 INFO L225 Difference]: With dead ends: 76 [2022-11-22 00:19:13,950 INFO L226 Difference]: Without dead ends: 73 [2022-11-22 00:19:13,950 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 00:19:13,951 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:13,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 16 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:19:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-22 00:19:13,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2022-11-22 00:19:13,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.510204081632653) internal successors, (74), 58 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2022-11-22 00:19:13,960 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 7 [2022-11-22 00:19:13,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:13,961 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2022-11-22 00:19:13,961 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 00:19:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-11-22 00:19:13,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 00:19:13,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:13,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:13,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 00:19:13,962 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:19:13,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:13,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1817491085, now seen corresponding path program 1 times [2022-11-22 00:19:13,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:13,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408745135] [2022-11-22 00:19:13,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:13,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:14,127 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 00:19:14,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:14,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408745135] [2022-11-22 00:19:14,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408745135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:14,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:14,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:19:14,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394168810] [2022-11-22 00:19:14,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:14,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:19:14,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:14,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:19:14,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:19:14,130 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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 00:19:14,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:14,247 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2022-11-22 00:19:14,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:19:14,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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 00:19:14,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:14,248 INFO L225 Difference]: With dead ends: 94 [2022-11-22 00:19:14,248 INFO L226 Difference]: Without dead ends: 91 [2022-11-22 00:19:14,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:19:14,250 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 73 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:14,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 20 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:19:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-22 00:19:14,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2022-11-22 00:19:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.5211267605633803) internal successors, (108), 80 states have internal predecessors, (108), 0 states have call successors, (0), 0 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 00:19:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 108 transitions. [2022-11-22 00:19:14,260 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 108 transitions. Word has length 7 [2022-11-22 00:19:14,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:14,260 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 108 transitions. [2022-11-22 00:19:14,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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 00:19:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 108 transitions. [2022-11-22 00:19:14,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 00:19:14,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:14,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:14,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 00:19:14,262 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:19:14,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:14,262 INFO L85 PathProgramCache]: Analyzing trace with hash -651941822, now seen corresponding path program 1 times [2022-11-22 00:19:14,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:14,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176086795] [2022-11-22 00:19:14,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:14,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:14,486 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 00:19:14,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:14,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176086795] [2022-11-22 00:19:14,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176086795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:14,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:14,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:19:14,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592915981] [2022-11-22 00:19:14,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:14,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:19:14,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:14,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:19:14,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:19:14,490 INFO L87 Difference]: Start difference. First operand 81 states and 108 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 00:19:14,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:14,612 INFO L93 Difference]: Finished difference Result 123 states and 162 transitions. [2022-11-22 00:19:14,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:19:14,613 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 00:19:14,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:14,616 INFO L225 Difference]: With dead ends: 123 [2022-11-22 00:19:14,617 INFO L226 Difference]: Without dead ends: 120 [2022-11-22 00:19:14,617 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 00:19:14,620 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:14,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 27 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:19:14,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-22 00:19:14,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2022-11-22 00:19:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 93 states have (on average 1.4838709677419355) internal successors, (138), 102 states have internal predecessors, (138), 0 states have call successors, (0), 0 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 00:19:14,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 138 transitions. [2022-11-22 00:19:14,653 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 138 transitions. Word has length 8 [2022-11-22 00:19:14,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:14,653 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 138 transitions. [2022-11-22 00:19:14,654 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 00:19:14,654 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 138 transitions. [2022-11-22 00:19:14,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 00:19:14,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:14,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:14,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 00:19:14,656 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:19:14,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:14,656 INFO L85 PathProgramCache]: Analyzing trace with hash -507648548, now seen corresponding path program 1 times [2022-11-22 00:19:14,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:14,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401091618] [2022-11-22 00:19:14,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:14,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:14,830 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 00:19:14,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:14,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401091618] [2022-11-22 00:19:14,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401091618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:14,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:14,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:19:14,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593673100] [2022-11-22 00:19:14,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:14,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:19:14,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:14,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:19:14,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:19:14,833 INFO L87 Difference]: Start difference. First operand 103 states and 138 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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 00:19:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:14,971 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2022-11-22 00:19:14,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:19:14,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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 00:19:14,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:14,972 INFO L225 Difference]: With dead ends: 113 [2022-11-22 00:19:14,972 INFO L226 Difference]: Without dead ends: 110 [2022-11-22 00:19:14,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:19:14,974 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 66 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:14,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 23 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:19:14,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-22 00:19:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 78. [2022-11-22 00:19:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 77 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 00:19:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2022-11-22 00:19:14,983 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 8 [2022-11-22 00:19:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:14,983 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2022-11-22 00:19:14,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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 00:19:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2022-11-22 00:19:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 00:19:14,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:14,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:14,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 00:19:14,985 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:19:14,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:14,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1442764437, now seen corresponding path program 1 times [2022-11-22 00:19:14,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:14,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164342071] [2022-11-22 00:19:14,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:14,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:15,264 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 00:19:15,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:15,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164342071] [2022-11-22 00:19:15,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164342071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:15,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:15,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:19:15,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368784156] [2022-11-22 00:19:15,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:15,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:19:15,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:15,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:19:15,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:19:15,266 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:15,379 INFO L93 Difference]: Finished difference Result 95 states and 120 transitions. [2022-11-22 00:19:15,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:19:15,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-22 00:19:15,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:15,381 INFO L225 Difference]: With dead ends: 95 [2022-11-22 00:19:15,381 INFO L226 Difference]: Without dead ends: 94 [2022-11-22 00:19:15,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:19:15,382 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:15,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 21 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:19:15,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-22 00:19:15,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2022-11-22 00:19:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 81 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2022-11-22 00:19:15,407 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 9 [2022-11-22 00:19:15,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:15,407 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2022-11-22 00:19:15,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2022-11-22 00:19:15,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 00:19:15,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:15,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:15,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 00:19:15,410 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:19:15,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:15,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1776024830, now seen corresponding path program 1 times [2022-11-22 00:19:15,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:15,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557861260] [2022-11-22 00:19:15,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:15,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:15,678 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 00:19:15,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:15,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557861260] [2022-11-22 00:19:15,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557861260] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:15,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:15,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:19:15,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908370177] [2022-11-22 00:19:15,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:15,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:19:15,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:15,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:19:15,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:19:15,681 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 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 00:19:15,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:15,845 INFO L93 Difference]: Finished difference Result 110 states and 135 transitions. [2022-11-22 00:19:15,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:19:15,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-22 00:19:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:15,851 INFO L225 Difference]: With dead ends: 110 [2022-11-22 00:19:15,851 INFO L226 Difference]: Without dead ends: 107 [2022-11-22 00:19:15,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:19:15,854 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 58 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:15,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 41 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:19:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-22 00:19:15,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 78. [2022-11-22 00:19:15,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 77 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 00:19:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2022-11-22 00:19:15,868 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 10 [2022-11-22 00:19:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:15,869 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2022-11-22 00:19:15,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 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 00:19:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2022-11-22 00:19:15,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:19:15,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:15,871 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:15,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 00:19:15,871 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:19:15,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:15,877 INFO L85 PathProgramCache]: Analyzing trace with hash -405485141, now seen corresponding path program 1 times [2022-11-22 00:19:15,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:15,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749038201] [2022-11-22 00:19:15,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:15,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:15,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:19:15,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:15,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749038201] [2022-11-22 00:19:15,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749038201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:15,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:15,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:19:15,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621159362] [2022-11-22 00:19:15,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:15,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:19:15,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:15,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:19:15,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:19:15,962 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 00:19:15,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:15,996 INFO L93 Difference]: Finished difference Result 197 states and 249 transitions. [2022-11-22 00:19:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:19:15,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 00:19:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:15,998 INFO L225 Difference]: With dead ends: 197 [2022-11-22 00:19:15,998 INFO L226 Difference]: Without dead ends: 135 [2022-11-22 00:19:15,998 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 00:19:15,999 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:15,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 75 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:19:16,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-22 00:19:16,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2022-11-22 00:19:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 106 states have (on average 1.4811320754716981) internal successors, (157), 115 states have internal predecessors, (157), 0 states have call successors, (0), 0 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 00:19:16,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions. [2022-11-22 00:19:16,011 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 157 transitions. Word has length 16 [2022-11-22 00:19:16,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:16,011 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 157 transitions. [2022-11-22 00:19:16,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 00:19:16,012 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2022-11-22 00:19:16,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:19:16,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:16,013 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:16,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 00:19:16,013 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 00:19:16,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:16,014 INFO L85 PathProgramCache]: Analyzing trace with hash -262283187, now seen corresponding path program 1 times [2022-11-22 00:19:16,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:16,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948035137] [2022-11-22 00:19:16,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:16,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 00:19:16,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:16,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948035137] [2022-11-22 00:19:16,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948035137] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:19:16,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115475903] [2022-11-22 00:19:16,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:16,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:19:16,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:19:16,346 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:19:16,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 00:19:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:16,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-22 00:19:16,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:19:17,872 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 00:19:17,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:19:17,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115475903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:17,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:19:17,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 7 [2022-11-22 00:19:17,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832520354] [2022-11-22 00:19:17,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:17,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:19:17,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:17,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:19:17,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:19:17,874 INFO L87 Difference]: Start difference. First operand 116 states and 157 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 00:19:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:17,987 INFO L93 Difference]: Finished difference Result 189 states and 257 transitions. [2022-11-22 00:19:17,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:19:17,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 00:19:17,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:17,989 INFO L225 Difference]: With dead ends: 189 [2022-11-22 00:19:17,989 INFO L226 Difference]: Without dead ends: 87 [2022-11-22 00:19:17,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:19:17,990 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:17,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 32 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:19:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-22 00:19:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2022-11-22 00:19:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 79 states have internal predecessors, (107), 0 states have call successors, (0), 0 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 00:19:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 107 transitions. [2022-11-22 00:19:17,999 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 107 transitions. Word has length 16 [2022-11-22 00:19:17,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:17,999 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 107 transitions. [2022-11-22 00:19:17,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 00:19:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 107 transitions. [2022-11-22 00:19:18,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 00:19:18,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:18,001 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:18,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 00:19:18,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:19:18,211 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 00:19:18,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:18,211 INFO L85 PathProgramCache]: Analyzing trace with hash -621849275, now seen corresponding path program 1 times [2022-11-22 00:19:18,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:18,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804653292] [2022-11-22 00:19:18,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:18,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:18,260 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 00:19:18,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:18,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804653292] [2022-11-22 00:19:18,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804653292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:18,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:18,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:19:18,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298732537] [2022-11-22 00:19:18,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:18,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:19:18,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:18,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:19:18,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:19:18,263 INFO L87 Difference]: Start difference. First operand 80 states and 107 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 00:19:18,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:18,309 INFO L93 Difference]: Finished difference Result 160 states and 216 transitions. [2022-11-22 00:19:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:19:18,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-11-22 00:19:18,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:18,311 INFO L225 Difference]: With dead ends: 160 [2022-11-22 00:19:18,311 INFO L226 Difference]: Without dead ends: 98 [2022-11-22 00:19:18,313 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 00:19:18,314 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 22 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:18,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 65 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:19:18,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-22 00:19:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2022-11-22 00:19:18,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 81 states have (on average 1.5061728395061729) internal successors, (122), 90 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 00:19:18,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2022-11-22 00:19:18,325 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 122 transitions. Word has length 18 [2022-11-22 00:19:18,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:18,325 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 122 transitions. [2022-11-22 00:19:18,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 00:19:18,326 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 122 transitions. [2022-11-22 00:19:18,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:19:18,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:18,328 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 00:19:18,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 00:19:18,328 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:19:18,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:18,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1881005135, now seen corresponding path program 1 times [2022-11-22 00:19:18,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:18,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498712118] [2022-11-22 00:19:18,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:18,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:18,767 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 00:19:18,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:18,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498712118] [2022-11-22 00:19:18,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498712118] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:19:18,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921778212] [2022-11-22 00:19:18,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:18,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:19:18,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:19:18,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:19:18,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 00:19:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:18,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-22 00:19:18,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:19:19,206 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 00:19:19,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:19:19,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921778212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:19,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:19:19,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2022-11-22 00:19:19,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796437387] [2022-11-22 00:19:19,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:19,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:19:19,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:19,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:19:19,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:19:19,209 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 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 00:19:19,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:19,254 INFO L93 Difference]: Finished difference Result 168 states and 228 transitions. [2022-11-22 00:19:19,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:19:19,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 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 00:19:19,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:19,255 INFO L225 Difference]: With dead ends: 168 [2022-11-22 00:19:19,256 INFO L226 Difference]: Without dead ends: 93 [2022-11-22 00:19:19,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:19:19,257 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 9 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 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 00:19:19,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:19:19,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-22 00:19:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-11-22 00:19:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 78 states have (on average 1.5) internal successors, (117), 87 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 00:19:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2022-11-22 00:19:19,268 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 22 [2022-11-22 00:19:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:19,268 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2022-11-22 00:19:19,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 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 00:19:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2022-11-22 00:19:19,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 00:19:19,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:19,270 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 00:19:19,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 00:19:19,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:19:19,476 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:19:19,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:19,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1005393701, now seen corresponding path program 1 times [2022-11-22 00:19:19,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:19,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046465323] [2022-11-22 00:19:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:19,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:19,930 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 00:19:19,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:19,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046465323] [2022-11-22 00:19:19,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046465323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:19:19,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400631167] [2022-11-22 00:19:19,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:19,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:19:19,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:19:19,933 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:19:19,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 00:19:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:20,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-22 00:19:20,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:19:21,065 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 00:19:21,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:19:22,003 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 00:19:22,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400631167] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:19:22,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1926127752] [2022-11-22 00:19:22,022 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-22 00:19:22,022 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:19:22,025 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:19:22,031 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:19:22,031 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:19:30,965 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:19:35,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1926127752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:35,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:19:35,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 6, 6] total 26 [2022-11-22 00:19:35,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015922934] [2022-11-22 00:19:35,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:35,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 00:19:35,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:35,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 00:19:35,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=511, Unknown=0, NotChecked=0, Total=756 [2022-11-22 00:19:35,870 INFO L87 Difference]: Start difference. First operand 88 states and 117 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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 00:19:38,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:38,567 INFO L93 Difference]: Finished difference Result 210 states and 297 transitions. [2022-11-22 00:19:38,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-22 00:19:38,568 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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 00:19:38,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:38,569 INFO L225 Difference]: With dead ends: 210 [2022-11-22 00:19:38,569 INFO L226 Difference]: Without dead ends: 138 [2022-11-22 00:19:38,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=328, Invalid=664, Unknown=0, NotChecked=0, Total=992 [2022-11-22 00:19:38,571 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:38,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 33 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-22 00:19:38,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-22 00:19:38,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 127. [2022-11-22 00:19:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 117 states have (on average 1.393162393162393) internal successors, (163), 126 states have internal predecessors, (163), 0 states have call successors, (0), 0 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 00:19:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 163 transitions. [2022-11-22 00:19:38,596 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 163 transitions. Word has length 23 [2022-11-22 00:19:38,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:38,597 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 163 transitions. [2022-11-22 00:19:38,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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 00:19:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 163 transitions. [2022-11-22 00:19:38,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-22 00:19:38,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:38,598 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 00:19:38,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 00:19:38,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-22 00:19:38,805 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:19:38,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:38,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1550018723, now seen corresponding path program 1 times [2022-11-22 00:19:38,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:38,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000394519] [2022-11-22 00:19:38,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:38,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:38,965 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 00:19:38,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:38,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000394519] [2022-11-22 00:19:38,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000394519] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:19:38,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162989392] [2022-11-22 00:19:38,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:38,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:19:38,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:19:38,968 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:19:38,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 00:19:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:39,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-22 00:19:39,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:19:39,111 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 00:19:39,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:19:39,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162989392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:39,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:19:39,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-22 00:19:39,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629533699] [2022-11-22 00:19:39,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:39,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:19:39,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:39,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:19:39,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:19:39,114 INFO L87 Difference]: Start difference. First operand 127 states and 163 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 00:19:39,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:39,175 INFO L93 Difference]: Finished difference Result 250 states and 312 transitions. [2022-11-22 00:19:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:19:39,176 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 00:19:39,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:39,177 INFO L225 Difference]: With dead ends: 250 [2022-11-22 00:19:39,177 INFO L226 Difference]: Without dead ends: 137 [2022-11-22 00:19:39,180 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 00:19:39,181 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 28 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:39,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 110 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:19:39,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-22 00:19:39,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2022-11-22 00:19:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 117 states have (on average 1.3333333333333333) internal successors, (156), 126 states have internal predecessors, (156), 0 states have call successors, (0), 0 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 00:19:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 156 transitions. [2022-11-22 00:19:39,204 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 156 transitions. Word has length 32 [2022-11-22 00:19:39,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:39,204 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 156 transitions. [2022-11-22 00:19:39,204 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 00:19:39,205 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 156 transitions. [2022-11-22 00:19:39,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-22 00:19:39,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:39,209 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 00:19:39,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 00:19:39,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-22 00:19:39,416 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 00:19:39,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:39,416 INFO L85 PathProgramCache]: Analyzing trace with hash -130196257, now seen corresponding path program 1 times [2022-11-22 00:19:39,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:39,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051590214] [2022-11-22 00:19:39,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:39,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:39,601 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 00:19:39,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:39,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051590214] [2022-11-22 00:19:39,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051590214] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:19:39,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055348495] [2022-11-22 00:19:39,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:39,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:19:39,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:19:39,603 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:19:39,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 00:19:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:39,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-22 00:19:39,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:19:40,842 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 00:19:40,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:19:41,853 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 00:19:41,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055348495] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:19:41,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1447897444] [2022-11-22 00:19:41,858 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-22 00:19:41,858 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:19:41,858 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:19:41,859 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:19:41,859 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:19:49,796 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:19:59,041 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4535#(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|) (<= 0 ~st1~0) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= ~id1~0 127) (= ~nomsg~0 ~p2_new~0) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= 1 |ULTIMATE.start_init_#res#1|) (not (<= (+ ~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_44 Int)) (and (= (ite (<= (mod (ite (and (= v_~p2_new~0_44 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_44) 256) 127) (mod (ite (and (= v_~p2_new~0_44 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_44) 256) (+ (- 256) (mod (ite (and (= v_~p2_new~0_44 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_44) 256))) ~p2_old~0) (<= (+ v_~p2_new~0_44 1) 0) (<= 0 (+ v_~p2_new~0_44 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|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (or (and (= ~mode3~0 1) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (exists ((v_~p3_new~0_44 Int)) (and (<= 0 (+ v_~p3_new~0_44 1)) (= ~p3_old~0 (ite (<= (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_44 ~nomsg~0)) ~send3~0 v_~p3_new~0_44) 256) 127) (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_44 ~nomsg~0)) ~send3~0 v_~p3_new~0_44) 256) (+ (- 256) (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_44 ~nomsg~0)) ~send3~0 v_~p3_new~0_44) 256)))) (<= (+ v_~p3_new~0_44 1) 0))) (<= 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))) (= |#NULL.base| 0))' at error location [2022-11-22 00:19:59,041 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 00:19:59,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:19:59,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 22 [2022-11-22 00:19:59,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183563729] [2022-11-22 00:19:59,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:19:59,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-22 00:19:59,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:59,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-22 00:19:59,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2022-11-22 00:19:59,044 INFO L87 Difference]: Start difference. First operand 127 states and 156 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 00:20:00,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:20:00,820 INFO L93 Difference]: Finished difference Result 268 states and 303 transitions. [2022-11-22 00:20:00,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-22 00:20:00,821 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 00:20:00,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:20:00,822 INFO L225 Difference]: With dead ends: 268 [2022-11-22 00:20:00,823 INFO L226 Difference]: Without dead ends: 265 [2022-11-22 00:20:00,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 80 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=423, Invalid=2657, Unknown=0, NotChecked=0, Total=3080 [2022-11-22 00:20:00,825 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 705 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 00:20:00,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 110 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 00:20:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-11-22 00:20:00,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 125. [2022-11-22 00:20:00,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 117 states have (on average 1.264957264957265) internal successors, (148), 124 states have internal predecessors, (148), 0 states have call successors, (0), 0 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 00:20:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2022-11-22 00:20:00,856 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 38 [2022-11-22 00:20:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:20:00,857 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2022-11-22 00:20:00,857 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 00:20:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2022-11-22 00:20:00,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-22 00:20:00,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:20:00,858 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 00:20:00,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 00:20:01,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:20:01,070 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:20:01,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:20:01,071 INFO L85 PathProgramCache]: Analyzing trace with hash 258883568, now seen corresponding path program 1 times [2022-11-22 00:20:01,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:20:01,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705305530] [2022-11-22 00:20:01,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:20:01,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:20:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:20:01,265 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 00:20:01,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:20:01,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705305530] [2022-11-22 00:20:01,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705305530] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:20:01,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165648389] [2022-11-22 00:20:01,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:20:01,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:20:01,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:20:01,268 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:20:01,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 00:20:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:20:01,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-22 00:20:01,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:20:02,754 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 00:20:02,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:20:03,765 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 00:20:03,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165648389] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:20:03,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [126832858] [2022-11-22 00:20:03,768 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-22 00:20:03,768 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:20:03,768 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:20:03,768 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:20:03,768 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:20:11,486 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:20:19,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [126832858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:20:19,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:20:19,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 9, 9] total 34 [2022-11-22 00:20:19,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649720883] [2022-11-22 00:20:19,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:20:19,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 00:20:19,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:20:19,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 00:20:19,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2022-11-22 00:20:19,241 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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 00:20:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:20:30,376 INFO L93 Difference]: Finished difference Result 260 states and 326 transitions. [2022-11-22 00:20:30,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-22 00:20:30,377 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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 39 [2022-11-22 00:20:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:20:30,378 INFO L225 Difference]: With dead ends: 260 [2022-11-22 00:20:30,378 INFO L226 Difference]: Without dead ends: 190 [2022-11-22 00:20:30,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 77 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=618, Invalid=1832, Unknown=0, NotChecked=0, Total=2450 [2022-11-22 00:20:30,380 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 192 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-22 00:20:30,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 29 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-22 00:20:30,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-22 00:20:30,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2022-11-22 00:20:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 165 states have (on average 1.2303030303030302) internal successors, (203), 172 states have internal predecessors, (203), 0 states have call successors, (0), 0 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 00:20:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2022-11-22 00:20:30,421 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 39 [2022-11-22 00:20:30,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:20:30,421 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2022-11-22 00:20:30,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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 00:20:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2022-11-22 00:20:30,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-22 00:20:30,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:20:30,422 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 00:20:30,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 00:20:30,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-22 00:20:30,626 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 00:20:30,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:20:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash -564543743, now seen corresponding path program 1 times [2022-11-22 00:20:30,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:20:30,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275908723] [2022-11-22 00:20:30,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:20:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:20:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:20:31,316 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 00:20:31,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:20:31,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275908723] [2022-11-22 00:20:31,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275908723] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:20:31,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751720810] [2022-11-22 00:20:31,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:20:31,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:20:31,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:20:31,319 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:20:31,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 00:20:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:20:31,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-22 00:20:31,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:20:35,774 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 00:20:35,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:20:41,543 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 00:20:41,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751720810] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:20:41,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1593215778] [2022-11-22 00:20:41,546 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-22 00:20:41,546 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:20:41,547 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:20:41,547 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:20:41,547 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:20:48,955 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:20:57,915 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6150#(and (or (and (= ~mode2~0 1) (exists ((v_~p2_new~0_58 Int)) (and (<= (+ v_~p2_new~0_58 1) 0) (<= 0 (+ v_~p2_new~0_58 1)) (= (ite (<= (mod (ite (and (= v_~p2_new~0_58 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_58) 256) 127) (mod (ite (and (= v_~p2_new~0_58 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_58) 256) (+ (mod (ite (and (= v_~p2_new~0_58 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_58) 256) (- 256))) ~p2_old~0))) (<= 0 ~st2~0) (<= 0 ~send2~0) (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|)) (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))) (<= 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|) (<= (+ ~st2~0 ~st1~0) 2147483647) (<= 0 ~st1~0) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= ~id1~0 127) (= ~nomsg~0 ~p2_new~0) (not (<= (+ ~st3~0 ~st2~0 ~st1~0) 2147483647)) (<= (+ ~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)) (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_58 Int)) (and (= ~p3_old~0 (ite (<= (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_58 ~nomsg~0)) ~send3~0 v_~p3_new~0_58) 256) 127) (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_58 ~nomsg~0)) ~send3~0 v_~p3_new~0_58) 256) (+ (- 256) (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_58 ~nomsg~0)) ~send3~0 v_~p3_new~0_58) 256)))) (<= 0 (+ v_~p3_new~0_58 1)) (<= (+ v_~p3_new~0_58 1) 0))) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (<= 0 ~send3~0))) (<= ~id2~0 127) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-22 00:20:57,915 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 00:20:57,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:20:57,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 23 [2022-11-22 00:20:57,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114111493] [2022-11-22 00:20:57,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:20:57,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-22 00:20:57,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:20:57,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-22 00:20:57,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1085, Unknown=0, NotChecked=0, Total=1406 [2022-11-22 00:20:57,918 INFO L87 Difference]: Start difference. First operand 173 states and 203 transitions. Second operand has 25 states, 24 states have (on average 5.0) internal successors, (120), 24 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:21:03,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:21:03,495 INFO L93 Difference]: Finished difference Result 407 states and 467 transitions. [2022-11-22 00:21:03,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-22 00:21:03,496 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.0) internal successors, (120), 24 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-22 00:21:03,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:21:03,497 INFO L225 Difference]: With dead ends: 407 [2022-11-22 00:21:03,498 INFO L226 Difference]: Without dead ends: 337 [2022-11-22 00:21:03,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 77 SyntacticMatches, 10 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1259 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=716, Invalid=2706, Unknown=0, NotChecked=0, Total=3422 [2022-11-22 00:21:03,499 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 896 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:21:03,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 105 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-22 00:21:03,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-11-22 00:21:03,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 181. [2022-11-22 00:21:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 173 states have (on average 1.1791907514450868) internal successors, (204), 180 states have internal predecessors, (204), 0 states have call successors, (0), 0 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 00:21:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 204 transitions. [2022-11-22 00:21:03,565 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 204 transitions. Word has length 40 [2022-11-22 00:21:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:21:03,565 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 204 transitions. [2022-11-22 00:21:03,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.0) internal successors, (120), 24 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:21:03,566 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 204 transitions. [2022-11-22 00:21:03,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-22 00:21:03,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:21:03,566 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 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 00:21:03,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 00:21:03,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-22 00:21:03,773 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:21:03,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:21:03,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1266303391, now seen corresponding path program 1 times [2022-11-22 00:21:03,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:21:03,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493397431] [2022-11-22 00:21:03,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:21:03,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:21:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:21:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 85 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-22 00:21:05,048 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:21:05,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493397431] [2022-11-22 00:21:05,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493397431] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:21:05,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302122189] [2022-11-22 00:21:05,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:21:05,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:21:05,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:21:05,050 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:21:05,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 00:21:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:21:05,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-22 00:21:05,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:21:05,243 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 40 proven. 37 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-22 00:21:05,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:21:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-22 00:21:05,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302122189] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 00:21:05,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 00:21:05,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 4] total 12 [2022-11-22 00:21:05,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210147627] [2022-11-22 00:21:05,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:21:05,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:21:05,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:21:05,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:21:05,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-22 00:21:05,268 INFO L87 Difference]: Start difference. First operand 181 states and 204 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 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 00:21:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:21:05,359 INFO L93 Difference]: Finished difference Result 237 states and 265 transitions. [2022-11-22 00:21:05,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:21:05,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-11-22 00:21:05,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:21:05,360 INFO L225 Difference]: With dead ends: 237 [2022-11-22 00:21:05,360 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 00:21:05,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-22 00:21:05,362 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:21:05,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:21:05,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 00:21:05,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 00:21:05,363 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 00:21:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 00:21:05,363 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2022-11-22 00:21:05,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:21:05,364 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 00:21:05,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 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 00:21:05,364 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 00:21:05,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 00:21:05,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-22 00:21:05,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-22 00:21:05,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-22 00:21:05,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-22 00:21:05,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-22 00:21:05,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-22 00:21:05,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-22 00:21:05,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-22 00:21:05,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-22 00:21:05,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-22 00:21:05,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-22 00:21:05,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-22 00:21:05,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-22 00:21:05,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-22 00:21:05,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 00:21:05,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:21:05,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 00:21:25,567 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 210) no Hoare annotation was computed. [2022-11-22 00:21:25,568 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-22 00:21:25,568 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2022-11-22 00:21:25,568 INFO L899 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-11-22 00:21:25,568 INFO L899 garLoopResultBuilder]: For program point L219-1(line 219) no Hoare annotation was computed. [2022-11-22 00:21:25,568 INFO L899 garLoopResultBuilder]: For program point L219-2(line 219) no Hoare annotation was computed. [2022-11-22 00:21:25,568 INFO L899 garLoopResultBuilder]: For program point L219-3(line 219) no Hoare annotation was computed. [2022-11-22 00:21:25,568 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2022-11-22 00:21:25,569 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 78) no Hoare annotation was computed. [2022-11-22 00:21:25,569 INFO L895 garLoopResultBuilder]: At program point L57-2(lines 51 81) the Hoare annotation is: (let ((.cse22 (+ ~nomsg~0 1)) (.cse34 (+ ~p2_new~0 1)) (.cse33 (+ ~p3_new~0 1))) (let ((.cse0 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse1 (<= 0 ~id3~0)) (.cse2 (<= 0 .cse33)) (.cse3 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse4 (<= 0 ~id1~0)) (.cse6 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse7 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse8 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse9 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse10 (<= 0 ~st1~0)) (.cse12 (<= 0 ~st2~0)) (.cse13 (<= 0 ~send2~0)) (.cse14 (<= ~id1~0 127)) (.cse15 (<= 0 .cse34)) (.cse16 (<= .cse22 0)) (.cse17 (<= .cse34 0)) (.cse18 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse19 (<= ~id3~0 127)) (.cse20 (<= 0 ~id2~0)) (.cse23 (<= ~id2~0 127)) (.cse24 (<= 0 ~st3~0)) (.cse25 (<= .cse33 0)) (.cse26 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse27 (= ~p3~0 0)) (.cse5 (= ~p2~0 0)) (.cse11 (= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse21 (= |#NULL.offset| 0)) (.cse29 (= ~p1~0 0)) (.cse28 (<= 0 ~send3~0)) (.cse30 (<= 0 |#StackHeapBarrier|)) (.cse31 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse32 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (or (= ~mode2~0 1) (= ~nomsg~0 ~p2_old~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ ~st3~0 ~st2~0 ~st1~0) 1) .cse10 .cse11 .cse12 .cse13 (= ~mode1~0 1) .cse14 (= ~nomsg~0 ~p1_old~0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= 0 .cse22) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse0 .cse1 (= ~nomsg~0 ~p1_new~0) .cse2 .cse3 (<= ~st2~0 1) .cse4 .cse6 (<= 0 ~mode3~0) .cse7 .cse8 (<= ~mode2~0 1) .cse9 .cse10 .cse12 (<= ~mode3~0 1) (<= |ULTIMATE.start_main_~c1~0#1| 1) .cse13 .cse14 (<= ~st1~0 1) .cse15 .cse16 .cse17 .cse18 (= ~mode1~0 0) .cse19 (<= ~st3~0 1) .cse20 (<= 0 ~mode2~0) .cse23 .cse24 .cse25 .cse26 .cse27 (<= 0 (+ ~p1_new~0 1)) (or (and (= |ULTIMATE.start_check_~tmp~1#1| 0) .cse5 .cse11 .cse21 .cse29) (and (= |ULTIMATE.start_check_~tmp~1#1| 1) .cse5 .cse11 .cse21 .cse29)) .cse28 .cse30 .cse31 .cse32)))) [2022-11-22 00:21:25,569 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 219) no Hoare annotation was computed. [2022-11-22 00:21:25,569 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 00:21:25,569 INFO L899 garLoopResultBuilder]: For program point L58-2(lines 58 60) no Hoare annotation was computed. [2022-11-22 00:21:25,569 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 219) no Hoare annotation was computed. [2022-11-22 00:21:25,569 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 210) no Hoare annotation was computed. [2022-11-22 00:21:25,570 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2022-11-22 00:21:25,570 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2022-11-22 00:21:25,570 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-11-22 00:21:25,570 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-11-22 00:21:25,570 INFO L899 garLoopResultBuilder]: For program point L210(line 210) no Hoare annotation was computed. [2022-11-22 00:21:25,570 INFO L899 garLoopResultBuilder]: For program point L210-1(line 210) no Hoare annotation was computed. [2022-11-22 00:21:25,570 INFO L899 garLoopResultBuilder]: For program point L210-2(line 210) no Hoare annotation was computed. [2022-11-22 00:21:25,570 INFO L899 garLoopResultBuilder]: For program point L210-3(line 210) no Hoare annotation was computed. [2022-11-22 00:21:25,570 INFO L899 garLoopResultBuilder]: For program point L210-4(lines 210 229) no Hoare annotation was computed. [2022-11-22 00:21:25,572 INFO L895 garLoopResultBuilder]: At program point L210-5(lines 210 229) the Hoare annotation is: (let ((.cse39 (+ ~p1_new~0 1)) (.cse40 (+ ~p2_new~0 1)) (.cse38 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse37 (= |ULTIMATE.start_check_~tmp~1#1| 0))) (let ((.cse2 (= ~nomsg~0 ~p1_new~0)) (.cse11 (<= (+ ~st2~0 ~st1~0) 2147483647)) (.cse16 (= ~mode1~0 1)) (.cse0 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse1 (<= 0 ~id3~0)) (.cse3 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse4 (<= 0 ~id1~0)) (.cse5 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse6 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse7 (= ~p3_new~0 ~nomsg~0)) (.cse8 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse9 (let ((.cse49 (= ~p2~0 0)) (.cse50 (= |ULTIMATE.start_main_~i2~0#1| 0))) (or (and .cse37 .cse49 .cse50) (and (= |ULTIMATE.start_check_~tmp~1#1| 1) .cse49 .cse50)))) (.cse10 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse12 (<= .cse38 1)) (.cse13 (<= 0 ~st1~0)) (.cse14 (<= 0 ~st2~0)) (.cse15 (<= 0 ~send2~0)) (.cse17 (or (and (= ~mode3~0 1) (exists ((v_~p3_new~0_51 Int)) (let ((.cse46 (+ v_~p3_new~0_51 1))) (and (= ~p3_old~0 (let ((.cse45 (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_51 ~nomsg~0)) ~send3~0 v_~p3_new~0_51) 256))) (ite (<= .cse45 127) .cse45 (+ .cse45 (- 256))))) (<= .cse46 0) (<= 0 .cse46)))) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|)) (let ((.cse47 (+ ~p3_old~0 1))) (and (<= 0 .cse47) (<= .cse47 0) (let ((.cse48 (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (or (and .cse48 (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|)) (and (or (= ~st3~0 1) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (not .cse48)))) (= ~mode3~0 0))))) (.cse18 (or (let ((.cse42 (+ ~p2_old~0 1))) (and (= ~mode2~0 0) (let ((.cse41 (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|))) (or (and (or (= ~st2~0 1) (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0))) (not .cse41)) (and (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) .cse41))) (<= 0 .cse42) (<= .cse42 0))) (and (= ~mode2~0 1) (exists ((v_~p2_new~0_51 Int)) (let ((.cse43 (+ v_~p2_new~0_51 1))) (and (<= .cse43 0) (<= 0 .cse43) (= (let ((.cse44 (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= v_~p2_new~0_51 ~nomsg~0)) ~send2~0 v_~p2_new~0_51) 256))) (ite (<= .cse44 127) .cse44 (+ (- 256) .cse44))) ~p2_old~0)))) (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|)))) (.cse19 (<= ~id1~0 127)) (.cse20 (<= 0 .cse40)) (.cse21 (<= .cse40 0)) (.cse22 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse23 (<= ~id3~0 127)) (.cse24 (<= 0 ~id2~0)) (.cse25 (= |#NULL.offset| 0)) (.cse26 (<= ~id2~0 127)) (.cse27 (<= 0 ~st3~0)) (.cse28 (<= (+ ~p3_new~0 1) 0)) (.cse29 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse30 (= ~p3~0 0)) (.cse31 (<= 0 .cse39)) (.cse32 (<= 0 ~send3~0)) (.cse33 (= ~p1~0 0)) (.cse34 (<= 0 |#StackHeapBarrier|)) (.cse35 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse36 (= |#NULL.base| 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) (and .cse37 (= ~mode1~0 0)) (and .cse2 .cse37 .cse11 .cse16 (= ~nomsg~0 ~p2_new~0) (<= .cse38 130) (<= 0 (+ ~st3~0 128))) (and .cse0 .cse1 (<= 0 ~mode1~0) .cse3 .cse4 (<= .cse39 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 (<= |ULTIMATE.start_main_~c1~0#1| 1) .cse15 .cse17 .cse18 .cse19 (= ~nomsg~0 ~p1_old~0) .cse20 (<= ~mode1~0 1) .cse21 .cse22 .cse23 .cse24 .cse25 (<= 0 (+ ~nomsg~0 1)) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36)))) [2022-11-22 00:21:25,572 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-11-22 00:21:25,572 INFO L899 garLoopResultBuilder]: For program point L211(lines 211 226) no Hoare annotation was computed. [2022-11-22 00:21:25,572 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 219) no Hoare annotation was computed. [2022-11-22 00:21:25,573 INFO L895 garLoopResultBuilder]: At program point L262-2(lines 262 276) the Hoare annotation is: (let ((.cse1 (+ ~p3_new~0 1)) (.cse15 (+ ~nomsg~0 1)) (.cse43 (+ ~p2_new~0 1)) (.cse4 (= ~p2~0 0)) (.cse10 (= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse42 (+ ~p1_new~0 1))) (let ((.cse0 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse32 (<= 0 ~id3~0)) (.cse2 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse3 (<= 0 ~id1~0)) (.cse5 (<= .cse42 0)) (.cse6 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse7 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse33 (= ~p3_new~0 ~nomsg~0)) (.cse8 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse34 (or (and (= |ULTIMATE.start_check_~tmp~1#1| 0) .cse4 .cse10) (and (= |ULTIMATE.start_check_~tmp~1#1| 1) .cse4 .cse10))) (.cse9 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse35 (<= (+ ~st3~0 ~st2~0 ~st1~0) 1)) (.cse36 (<= 0 ~st1~0)) (.cse37 (<= 0 ~st2~0)) (.cse11 (<= |ULTIMATE.start_main_~c1~0#1| 1)) (.cse38 (<= 0 ~send2~0)) (.cse39 (or (and (= ~mode3~0 1) (exists ((v_~p3_new~0_51 Int)) (let ((.cse49 (+ v_~p3_new~0_51 1))) (and (= ~p3_old~0 (let ((.cse48 (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_51 ~nomsg~0)) ~send3~0 v_~p3_new~0_51) 256))) (ite (<= .cse48 127) .cse48 (+ .cse48 (- 256))))) (<= .cse49 0) (<= 0 .cse49)))) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|)) (let ((.cse50 (+ ~p3_old~0 1))) (and (<= 0 .cse50) (<= .cse50 0) (let ((.cse51 (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (or (and .cse51 (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|)) (and (or (= ~st3~0 1) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (not .cse51)))) (= ~mode3~0 0))))) (.cse40 (or (let ((.cse45 (+ ~p2_old~0 1))) (and (= ~mode2~0 0) (let ((.cse44 (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|))) (or (and (or (= ~st2~0 1) (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0))) (not .cse44)) (and (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) .cse44))) (<= 0 .cse45) (<= .cse45 0))) (and (= ~mode2~0 1) (exists ((v_~p2_new~0_51 Int)) (let ((.cse46 (+ v_~p2_new~0_51 1))) (and (<= .cse46 0) (<= 0 .cse46) (= (let ((.cse47 (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= v_~p2_new~0_51 ~nomsg~0)) ~send2~0 v_~p2_new~0_51) 256))) (ite (<= .cse47 127) .cse47 (+ (- 256) .cse47))) ~p2_old~0)))) (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|)))) (.cse12 (<= ~id1~0 127)) (.cse13 (= ~nomsg~0 ~p1_old~0)) (.cse14 (<= 0 .cse43)) (.cse16 (<= .cse43 0)) (.cse17 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse18 (<= ~id3~0 127)) (.cse19 (<= 0 ~id2~0)) (.cse20 (= |#NULL.offset| 0)) (.cse21 (<= 0 .cse15)) (.cse22 (<= ~id2~0 127)) (.cse41 (<= 0 ~st3~0)) (.cse23 (<= .cse1 0)) (.cse24 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse25 (= ~p3~0 0)) (.cse26 (<= 0 .cse42)) (.cse27 (<= 0 ~send3~0)) (.cse28 (= ~p1~0 0)) (.cse29 (<= 0 |#StackHeapBarrier|)) (.cse30 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse31 (= |#NULL.base| 0))) (or (and .cse0 (<= 0 .cse1) .cse2 (= (mod ~mode3~0 256) 0) .cse3 (= (mod ~mode2~0 256) 0) .cse4 .cse5 .cse6 .cse7 (= ~send3~0 ~id3~0) .cse8 (= ~st3~0 0) (= ~nomsg~0 ~p2_old~0) (not (= ~id3~0 ~id2~0)) (= (mod ~mode1~0 256) 0) .cse9 .cse10 .cse11 .cse12 (= ~st1~0 0) .cse13 .cse14 (<= .cse15 0) .cse16 .cse17 .cse18 .cse19 .cse20 (= ~st2~0 0) .cse21 (= ~p3_old~0 ~nomsg~0) .cse22 .cse23 .cse24 .cse25 .cse26 (= (mod ~r1~0 256) 0) .cse27 .cse28 .cse29 .cse30 (= ~send2~0 ~id2~0) .cse31) (and .cse0 .cse32 .cse2 .cse3 .cse5 .cse6 .cse7 .cse33 .cse8 .cse34 .cse9 .cse35 .cse36 .cse37 .cse11 .cse38 (= ~mode1~0 1) .cse39 .cse40 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse41 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) (and .cse0 .cse32 (<= 0 ~mode1~0) .cse2 .cse3 .cse5 .cse6 .cse7 .cse33 .cse8 .cse34 .cse9 .cse35 .cse36 .cse37 .cse11 .cse38 .cse39 .cse40 .cse12 .cse13 .cse14 (<= ~mode1~0 1) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse41 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31)))) [2022-11-22 00:21:25,574 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 219) no Hoare annotation was computed. [2022-11-22 00:21:25,574 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 210) no Hoare annotation was computed. [2022-11-22 00:21:25,574 INFO L899 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-11-22 00:21:25,574 INFO L899 garLoopResultBuilder]: For program point L214-1(line 214) no Hoare annotation was computed. [2022-11-22 00:21:25,574 INFO L899 garLoopResultBuilder]: For program point L214-2(line 214) no Hoare annotation was computed. [2022-11-22 00:21:25,574 INFO L899 garLoopResultBuilder]: For program point L214-3(line 214) no Hoare annotation was computed. [2022-11-22 00:21:25,575 INFO L899 garLoopResultBuilder]: For program point L214-4(lines 214 226) no Hoare annotation was computed. [2022-11-22 00:21:25,575 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 210) no Hoare annotation was computed. [2022-11-22 00:21:25,576 INFO L895 garLoopResultBuilder]: At program point L215(lines 211 226) the Hoare annotation is: (let ((.cse39 (+ ~nomsg~0 1)) (.cse56 (+ ~p2_old~0 1)) (.cse21 (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|)) (.cse9 (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|)) (.cse57 (+ ~p3_old~0 1))) (let ((.cse0 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse1 (<= 0 ~id3~0)) (.cse2 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse16 (<= 0 ~id1~0)) (.cse30 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse31 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse32 (= ~p3_new~0 ~nomsg~0)) (.cse33 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse34 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse35 (<= (+ ~st3~0 ~st2~0 ~st1~0) 1)) (.cse36 (<= 0 ~st1~0)) (.cse37 (= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse19 (<= 0 ~st2~0)) (.cse22 (<= 0 ~send2~0)) (.cse13 (= ~mode3~0 1)) (.cse14 (exists ((v_~p3_new~0_51 Int)) (let ((.cse59 (+ v_~p3_new~0_51 1))) (and (= ~p3_old~0 (let ((.cse58 (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_51 ~nomsg~0)) ~send3~0 v_~p3_new~0_51) 256))) (ite (<= .cse58 127) .cse58 (+ .cse58 (- 256))))) (<= .cse59 0) (<= 0 .cse59))))) (.cse15 (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|)) (.cse3 (<= 0 .cse57)) (.cse11 (<= .cse57 0)) (.cse10 (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|)) (.cse5 (= ~st3~0 1)) (.cse7 (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (.cse4 (not .cse9)) (.cse12 (= ~mode3~0 0)) (.cse17 (= ~mode2~0 0)) (.cse23 (= ~st2~0 1)) (.cse24 (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0))) (.cse25 (not .cse21)) (.cse20 (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|)) (.cse18 (<= 0 .cse56)) (.cse26 (<= .cse56 0)) (.cse27 (= ~mode2~0 1)) (.cse28 (exists ((v_~p2_new~0_51 Int)) (let ((.cse54 (+ v_~p2_new~0_51 1))) (and (<= .cse54 0) (<= 0 .cse54) (= (let ((.cse55 (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= v_~p2_new~0_51 ~nomsg~0)) ~send2~0 v_~p2_new~0_51) 256))) (ite (<= .cse55 127) .cse55 (+ (- 256) .cse55))) ~p2_old~0))))) (.cse29 (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|)) (.cse38 (<= ~id1~0 127)) (.cse40 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse41 (<= ~id3~0 127)) (.cse42 (<= 0 ~id2~0)) (.cse43 (= |#NULL.offset| 0)) (.cse44 (<= 0 .cse39)) (.cse45 (<= ~id2~0 127)) (.cse6 (<= 0 ~st3~0)) (.cse46 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse47 (= ~p3~0 0)) (.cse8 (<= 0 ~send3~0)) (.cse48 (= ~p1~0 0)) (.cse49 (<= 0 |#StackHeapBarrier|)) (.cse50 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse51 (= |#NULL.base| 0))) (or (and .cse0 .cse1 (= ~nomsg~0 ~p1_new~0) .cse2 (or (and .cse3 (or (and .cse4 (or .cse5 (and .cse6 .cse7)) .cse8) (and .cse9 .cse10 .cse6)) .cse11 .cse12) (and .cse13 .cse14 .cse15 .cse6 .cse8)) .cse16 (or (and .cse17 .cse18 (or (and .cse19 .cse20 .cse21) (and .cse22 (or .cse23 (and .cse24 .cse19)) .cse25)) .cse26) (and .cse27 .cse28 .cse19 .cse22 .cse29)) (= ~p2~0 0) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (= ~mode1~0 1) .cse38 (= ~nomsg~0 ~p2_new~0) (<= .cse39 0) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (let ((.cse53 (+ ~p2_new~0 1)) (.cse52 (+ ~p1_new~0 1))) (and .cse0 .cse1 .cse2 .cse16 (<= .cse52 0) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse19 (<= 0 ~p2~0) (<= |ULTIMATE.start_main_~c1~0#1| 1) .cse22 (or (and .cse13 .cse14 .cse15) (and .cse3 .cse11 (or (and .cse9 .cse10) (and (or .cse5 .cse7) .cse4)) .cse12)) (or (and .cse17 (or (and (or .cse23 .cse24) .cse25) (and .cse20 .cse21)) .cse18 .cse26) (and .cse27 .cse28 .cse29)) .cse38 (= ~nomsg~0 ~p1_old~0) (<= 0 .cse53) (<= .cse53 0) .cse40 (= ~mode1~0 0) .cse41 .cse42 .cse43 .cse44 (<= ~p2~0 0) .cse45 .cse6 (<= (+ ~p3_new~0 1) 0) .cse46 .cse47 (<= 0 .cse52) .cse8 .cse48 .cse49 .cse50 .cse51))))) [2022-11-22 00:21:25,579 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:21:25,583 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:21:25,592 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,593 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,594 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,594 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,594 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,595 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,595 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,595 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,596 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,596 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,597 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,597 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,597 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,597 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,598 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,598 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,604 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,628 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,628 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,629 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,629 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,631 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,631 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,632 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,632 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,632 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,633 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,633 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,633 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,633 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,634 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,634 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,634 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,635 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,638 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,638 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,638 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,638 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,639 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,639 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,639 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,639 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,640 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,640 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,640 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,640 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,641 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,641 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,641 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,663 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,664 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,664 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,664 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,665 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,665 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,665 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,667 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,667 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,667 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,668 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,678 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,679 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,679 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,679 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,680 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,680 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,680 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,681 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,681 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,681 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,681 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,682 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,682 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,682 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,683 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,683 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,683 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,687 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,703 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,703 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,703 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,703 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,704 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,704 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,704 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,706 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,706 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,706 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,707 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,707 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,707 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,707 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,708 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,708 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,708 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,709 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,709 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,709 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,710 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,710 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,710 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,710 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,711 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,716 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,720 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,721 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,721 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,721 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,722 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,722 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,722 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,723 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,723 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,723 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,724 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,725 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,725 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,725 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,725 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,726 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,726 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,727 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,727 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,727 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,728 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,728 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,728 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,728 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,729 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,729 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,729 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,730 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,730 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,730 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,731 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,733 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,733 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,734 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,734 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,734 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,735 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,735 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,735 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,736 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,736 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,736 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,737 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,737 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,737 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,738 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,738 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,739 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,739 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,739 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,740 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,740 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,740 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,741 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,741 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,742 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,742 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,742 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,743 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,743 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,743 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,744 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,744 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:21:25 BoogieIcfgContainer [2022-11-22 00:21:25,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:21:25,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:21:25,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:21:25,747 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:21:25,748 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:19:12" (3/4) ... [2022-11-22 00:21:25,751 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 00:21:25,773 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2022-11-22 00:21:25,774 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-11-22 00:21:25,775 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-22 00:21:25,776 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 00:21:25,807 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= p3_new + 1) && 1 <= tmp) && mode3 % 256 == 0) && 0 <= id1) && mode2 % 256 == 0) && p2 == 0) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && send3 == id3) && \result <= 1) && st3 == 0) && nomsg == p2_\old) && !(id3 == id2)) && mode1 % 256 == 0) && 1 <= \old(cond)) && i2 == 0) && c1 <= 1) && id1 <= 127) && st1 == 0) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && 0 <= id2) && #NULL == 0) && st2 == 0) && 0 <= nomsg + 1) && p3_\old == nomsg) && id2 <= 127) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && r1 % 256 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && send2 == id2) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && (((tmp == 0 && p2 == 0) && i2 == 0) || ((tmp == 1 && p2 == 0) && i2 == 0))) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && 0 <= st2) && c1 <= 1) && 0 <= send2) && mode1 == 1) && (((mode3 == 1 && (\exists v_~p3_new~0_51 : int :: (p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 else (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 + -256) && v_~p3_new~0_51 + 1 <= 0) && 0 <= v_~p3_new~0_51 + 1)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && ((((mode2 == 0 && (((st2 == 1 || !(m2 == id2)) && !(id2 < m2)) || (send2 == m2 && id2 < m2))) && 0 <= p2_\old + 1) && p2_\old + 1 <= 0) || ((mode2 == 1 && (\exists v_~p2_new~0_51 : int :: (v_~p2_new~0_51 + 1 <= 0 && 0 <= v_~p2_new~0_51 + 1) && (if (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 else -256 + (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256) == p2_\old)) && nomsg == m2))) && id1 <= 127) && 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) && cond <= 1) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= mode1) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && (((tmp == 0 && p2 == 0) && i2 == 0) || ((tmp == 1 && p2 == 0) && i2 == 0))) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && 0 <= st2) && c1 <= 1) && 0 <= send2) && (((mode3 == 1 && (\exists v_~p3_new~0_51 : int :: (p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 else (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 + -256) && v_~p3_new~0_51 + 1 <= 0) && 0 <= v_~p3_new~0_51 + 1)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && ((((mode2 == 0 && (((st2 == 1 || !(m2 == id2)) && !(id2 < m2)) || (send2 == m2 && id2 < m2))) && 0 <= p2_\old + 1) && p2_\old + 1 <= 0) || ((mode2 == 1 && (\exists v_~p2_new~0_51 : int :: (v_~p2_new~0_51 + 1 <= 0 && 0 <= v_~p2_new~0_51 + 1) && (if (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 else -256 + (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256) == p2_\old)) && nomsg == m2))) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && mode1 <= 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) && cond <= 1) && #NULL == 0) [2022-11-22 00:21:25,808 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && 1 <= tmp) && (mode2 == 1 || nomsg == p2_\old)) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && 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 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && 1 <= tmp) && st2 <= 1) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && mode2 <= 1) && 1 <= \old(cond)) && 0 <= st1) && 0 <= st2) && mode3 <= 1) && c1 <= 1) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && (((((tmp == 0 && p2 == 0) && i2 == 0) && #NULL == 0) && p1 == 0) || ((((tmp == 1 && p2 == 0) && i2 == 0) && #NULL == 0) && p1 == 0))) && 0 <= send3) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && #NULL == 0) [2022-11-22 00:21:25,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && nomsg == p1_new) && 1 <= tmp) && ((((0 <= p3_\old + 1 && (((!(id3 < m3) && (st3 == 1 || (0 <= st3 && !(id3 == m3)))) && 0 <= send3) || ((id3 < m3 && send3 == m3) && 0 <= st3))) && p3_\old + 1 <= 0) && mode3 == 0) || ((((mode3 == 1 && (\exists v_~p3_new~0_51 : int :: (p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 else (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 + -256) && v_~p3_new~0_51 + 1 <= 0) && 0 <= v_~p3_new~0_51 + 1)) && nomsg == m3) && 0 <= st3) && 0 <= send3))) && 0 <= id1) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || ((((mode2 == 1 && (\exists v_~p2_new~0_51 : int :: (v_~p2_new~0_51 + 1 <= 0 && 0 <= v_~p2_new~0_51 + 1) && (if (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 else -256 + (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256) == p2_\old)) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && mode1 == 1) && id1 <= 127) && nomsg == p2_new) && nomsg + 1 <= 0) && 1 <= \result) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && \old(cond) <= 1) && p3 == 0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && 0 <= st2) && 0 <= p2) && c1 <= 1) && 0 <= send2) && (((mode3 == 1 && (\exists v_~p3_new~0_51 : int :: (p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 else (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 + -256) && v_~p3_new~0_51 + 1 <= 0) && 0 <= v_~p3_new~0_51 + 1)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && ((((mode2 == 0 && (((st2 == 1 || !(m2 == id2)) && !(id2 < m2)) || (send2 == m2 && id2 < m2))) && 0 <= p2_\old + 1) && p2_\old + 1 <= 0) || ((mode2 == 1 && (\exists v_~p2_new~0_51 : int :: (v_~p2_new~0_51 + 1 <= 0 && 0 <= v_~p2_new~0_51 + 1) && (if (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 else -256 + (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256) == p2_\old)) && nomsg == m2))) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 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) && cond <= 1) && #NULL == 0) [2022-11-22 00:21:25,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && nomsg == p1_new) && 1 <= tmp) && 0 <= id1) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && (((tmp == 0 && p2 == 0) && i2 == 0) || ((tmp == 1 && p2 == 0) && i2 == 0))) && 1 <= \old(cond)) && st2 + st1 <= 2147483647) && st3 + st2 + st1 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= send2) && mode1 == 1) && (((mode3 == 1 && (\exists v_~p3_new~0_51 : int :: (p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 else (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 + -256) && v_~p3_new~0_51 + 1 <= 0) && 0 <= v_~p3_new~0_51 + 1)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && ((((mode2 == 0 && (((st2 == 1 || !(m2 == id2)) && !(id2 < m2)) || (send2 == m2 && id2 < m2))) && 0 <= p2_\old + 1) && p2_\old + 1 <= 0) || ((mode2 == 1 && (\exists v_~p2_new~0_51 : int :: (v_~p2_new~0_51 + 1 <= 0 && 0 <= v_~p2_new~0_51 + 1) && (if (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 else -256 + (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256) == p2_\old)) && nomsg == m2))) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && 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) && cond <= 1) && #NULL == 0) || (tmp == 0 && mode1 == 0)) || ((((((nomsg == p1_new && tmp == 0) && st2 + st1 <= 2147483647) && mode1 == 1) && nomsg == p2_new) && st3 + st2 + st1 <= 130) && 0 <= st3 + 128)) || (((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= mode1) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && (((tmp == 0 && p2 == 0) && i2 == 0) || ((tmp == 1 && p2 == 0) && i2 == 0))) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && 0 <= st2) && c1 <= 1) && 0 <= send2) && (((mode3 == 1 && (\exists v_~p3_new~0_51 : int :: (p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 else (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 + -256) && v_~p3_new~0_51 + 1 <= 0) && 0 <= v_~p3_new~0_51 + 1)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && ((((mode2 == 0 && (((st2 == 1 || !(m2 == id2)) && !(id2 < m2)) || (send2 == m2 && id2 < m2))) && 0 <= p2_\old + 1) && p2_\old + 1 <= 0) || ((mode2 == 1 && (\exists v_~p2_new~0_51 : int :: (v_~p2_new~0_51 + 1 <= 0 && 0 <= v_~p2_new~0_51 + 1) && (if (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 else -256 + (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256) == p2_\old)) && nomsg == m2))) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && mode1 <= 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) && cond <= 1) && #NULL == 0) [2022-11-22 00:21:25,855 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 00:21:25,856 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:21:25,856 INFO L158 Benchmark]: Toolchain (without parser) took 135076.44ms. Allocated memory was 178.3MB in the beginning and 673.2MB in the end (delta: 494.9MB). Free memory was 147.4MB in the beginning and 287.6MB in the end (delta: -140.2MB). Peak memory consumption was 356.7MB. Max. memory is 16.1GB. [2022-11-22 00:21:25,856 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 115.3MB. Free memory is still 68.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:21:25,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.56ms. Allocated memory is still 178.3MB. Free memory was 147.0MB in the beginning and 134.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-22 00:21:25,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.55ms. Allocated memory is still 178.3MB. Free memory was 134.1MB in the beginning and 132.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:21:25,861 INFO L158 Benchmark]: Boogie Preprocessor took 38.27ms. Allocated memory is still 178.3MB. Free memory was 132.0MB in the beginning and 130.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:21:25,862 INFO L158 Benchmark]: RCFGBuilder took 997.72ms. Allocated memory is still 178.3MB. Free memory was 130.3MB in the beginning and 145.3MB in the end (delta: -15.0MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2022-11-22 00:21:25,865 INFO L158 Benchmark]: TraceAbstraction took 133585.55ms. Allocated memory was 178.3MB in the beginning and 673.2MB in the end (delta: 494.9MB). Free memory was 144.5MB in the beginning and 292.9MB in the end (delta: -148.4MB). Peak memory consumption was 411.5MB. Max. memory is 16.1GB. [2022-11-22 00:21:25,865 INFO L158 Benchmark]: Witness Printer took 108.95ms. Allocated memory is still 673.2MB. Free memory was 292.9MB in the beginning and 287.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-22 00:21:25,869 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 115.3MB. Free memory is still 68.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.56ms. Allocated memory is still 178.3MB. Free memory was 147.0MB in the beginning and 134.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.55ms. Allocated memory is still 178.3MB. Free memory was 134.1MB in the beginning and 132.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.27ms. Allocated memory is still 178.3MB. Free memory was 132.0MB in the beginning and 130.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 997.72ms. Allocated memory is still 178.3MB. Free memory was 130.3MB in the beginning and 145.3MB in the end (delta: -15.0MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. * TraceAbstraction took 133585.55ms. Allocated memory was 178.3MB in the beginning and 673.2MB in the end (delta: 494.9MB). Free memory was 144.5MB in the beginning and 292.9MB in the end (delta: -148.4MB). Peak memory consumption was 411.5MB. Max. memory is 16.1GB. * Witness Printer took 108.95ms. Allocated memory is still 673.2MB. Free memory was 292.9MB in the beginning and 287.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,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: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: 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: 133.3s, OverallIterations: 19, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 20.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2296 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2296 mSDsluCounter, 891 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 519 mSDsCounter, 276 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2826 IncrementalHoareTripleChecker+Invalid, 3102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 276 mSolverCounterUnsat, 372 mSDtfsCounter, 2826 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 779 GetRequests, 501 SyntacticMatches, 36 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3716 ImplicationChecksByTransitivity, 51.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=18, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 505 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 35 NumberOfFragments, 2543 HoareAnnotationTreeSize, 5 FomulaSimplifications, 1056062 FormulaSimplificationTreeSizeReduction, 6.7s HoareSimplificationTime, 5 FomulaSimplificationsInter, 78708 FormulaSimplificationTreeSizeReductionInter, 13.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 23.9s InterpolantComputationTime, 680 NumberOfCodeBlocks, 680 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 869 ConstructedInterpolants, 0 QuantifiedInterpolants, 14935 SizeOfPredicates, 169 NumberOfNonLiveVariables, 1490 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 32 InterpolantComputations, 15 PerfectInterpolantSequences, 403/681 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: 16.7s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 61, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 180, TOOLS_POST_TIME: 15.1s, 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: 180, TOOLS_QUANTIFIERELIM_TIME: 14.9s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.4s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 246, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 26, DOMAIN_JOIN_TIME: 1.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 4, DOMAIN_WIDEN_TIME: 0.3s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 6, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 61, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME: 12.3s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 12.3s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 6, 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: 1323, DAG_COMPRESSION_RETAINED_NODES: 150, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 210]: Loop Invariant [2022-11-22 00:21:25,913 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,914 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,914 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,914 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,914 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,916 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,916 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,916 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,916 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,918 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,918 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,918 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,919 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,919 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,919 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,920 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,920 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,920 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,920 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,921 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,921 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,921 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,921 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,922 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,922 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,926 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,926 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,926 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,928 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,928 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,928 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,929 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,929 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,929 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,929 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,930 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,930 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,931 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,931 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,931 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,932 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,932 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,932 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,932 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,933 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,933 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,934 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,934 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,934 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,934 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,936 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && nomsg == p1_new) && 1 <= tmp) && 0 <= id1) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && (((tmp == 0 && p2 == 0) && i2 == 0) || ((tmp == 1 && p2 == 0) && i2 == 0))) && 1 <= \old(cond)) && st2 + st1 <= 2147483647) && st3 + st2 + st1 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= send2) && mode1 == 1) && (((mode3 == 1 && (\exists v_~p3_new~0_51 : int :: (p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 else (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 + -256) && v_~p3_new~0_51 + 1 <= 0) && 0 <= v_~p3_new~0_51 + 1)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && ((((mode2 == 0 && (((st2 == 1 || !(m2 == id2)) && !(id2 < m2)) || (send2 == m2 && id2 < m2))) && 0 <= p2_\old + 1) && p2_\old + 1 <= 0) || ((mode2 == 1 && (\exists v_~p2_new~0_51 : int :: (v_~p2_new~0_51 + 1 <= 0 && 0 <= v_~p2_new~0_51 + 1) && (if (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 else -256 + (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256) == p2_\old)) && nomsg == m2))) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && 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) && cond <= 1) && #NULL == 0) || (tmp == 0 && mode1 == 0)) || ((((((nomsg == p1_new && tmp == 0) && st2 + st1 <= 2147483647) && mode1 == 1) && nomsg == p2_new) && st3 + st2 + st1 <= 130) && 0 <= st3 + 128)) || (((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= mode1) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && (((tmp == 0 && p2 == 0) && i2 == 0) || ((tmp == 1 && p2 == 0) && i2 == 0))) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && 0 <= st2) && c1 <= 1) && 0 <= send2) && (((mode3 == 1 && (\exists v_~p3_new~0_51 : int :: (p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 else (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 + -256) && v_~p3_new~0_51 + 1 <= 0) && 0 <= v_~p3_new~0_51 + 1)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && ((((mode2 == 0 && (((st2 == 1 || !(m2 == id2)) && !(id2 < m2)) || (send2 == m2 && id2 < m2))) && 0 <= p2_\old + 1) && p2_\old + 1 <= 0) || ((mode2 == 1 && (\exists v_~p2_new~0_51 : int :: (v_~p2_new~0_51 + 1 <= 0 && 0 <= v_~p2_new~0_51 + 1) && (if (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 else -256 + (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256) == p2_\old)) && nomsg == m2))) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && mode1 <= 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) && cond <= 1) && #NULL == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 262]: Loop Invariant [2022-11-22 00:21:25,939 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,939 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,939 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,940 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,940 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,940 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,940 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,941 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,941 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,941 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,942 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,942 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,942 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,942 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,943 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,943 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,943 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,944 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,944 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,944 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,944 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,945 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,945 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,945 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,945 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,946 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,946 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,946 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,946 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,947 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,947 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,948 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,951 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,951 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,951 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,952 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,952 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,952 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,952 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,953 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,953 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,953 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,953 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,954 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,954 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,954 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,954 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,955 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,955 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,955 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,956 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,956 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,956 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,956 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,958 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,958 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,958 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,958 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,959 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,959 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,959 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= p3_new + 1) && 1 <= tmp) && mode3 % 256 == 0) && 0 <= id1) && mode2 % 256 == 0) && p2 == 0) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && send3 == id3) && \result <= 1) && st3 == 0) && nomsg == p2_\old) && !(id3 == id2)) && mode1 % 256 == 0) && 1 <= \old(cond)) && i2 == 0) && c1 <= 1) && id1 <= 127) && st1 == 0) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && 0 <= id2) && #NULL == 0) && st2 == 0) && 0 <= nomsg + 1) && p3_\old == nomsg) && id2 <= 127) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && r1 % 256 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && send2 == id2) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && (((tmp == 0 && p2 == 0) && i2 == 0) || ((tmp == 1 && p2 == 0) && i2 == 0))) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && 0 <= st2) && c1 <= 1) && 0 <= send2) && mode1 == 1) && (((mode3 == 1 && (\exists v_~p3_new~0_51 : int :: (p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 else (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 + -256) && v_~p3_new~0_51 + 1 <= 0) && 0 <= v_~p3_new~0_51 + 1)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && ((((mode2 == 0 && (((st2 == 1 || !(m2 == id2)) && !(id2 < m2)) || (send2 == m2 && id2 < m2))) && 0 <= p2_\old + 1) && p2_\old + 1 <= 0) || ((mode2 == 1 && (\exists v_~p2_new~0_51 : int :: (v_~p2_new~0_51 + 1 <= 0 && 0 <= v_~p2_new~0_51 + 1) && (if (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 else -256 + (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256) == p2_\old)) && nomsg == m2))) && id1 <= 127) && 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) && cond <= 1) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= mode1) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && (((tmp == 0 && p2 == 0) && i2 == 0) || ((tmp == 1 && p2 == 0) && i2 == 0))) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && 0 <= st2) && c1 <= 1) && 0 <= send2) && (((mode3 == 1 && (\exists v_~p3_new~0_51 : int :: (p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 else (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 + -256) && v_~p3_new~0_51 + 1 <= 0) && 0 <= v_~p3_new~0_51 + 1)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && ((((mode2 == 0 && (((st2 == 1 || !(m2 == id2)) && !(id2 < m2)) || (send2 == m2 && id2 < m2))) && 0 <= p2_\old + 1) && p2_\old + 1 <= 0) || ((mode2 == 1 && (\exists v_~p2_new~0_51 : int :: (v_~p2_new~0_51 + 1 <= 0 && 0 <= v_~p2_new~0_51 + 1) && (if (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 else -256 + (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256) == p2_\old)) && nomsg == m2))) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && mode1 <= 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) && cond <= 1) && #NULL == 0) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && 1 <= tmp) && (mode2 == 1 || nomsg == p2_\old)) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && 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 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && 1 <= tmp) && st2 <= 1) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && mode2 <= 1) && 1 <= \old(cond)) && 0 <= st1) && 0 <= st2) && mode3 <= 1) && c1 <= 1) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && (((((tmp == 0 && p2 == 0) && i2 == 0) && #NULL == 0) && p1 == 0) || ((((tmp == 1 && p2 == 0) && i2 == 0) && #NULL == 0) && p1 == 0))) && 0 <= send3) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && #NULL == 0) - InvariantResult [Line: 211]: Loop Invariant [2022-11-22 00:21:25,968 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,968 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,968 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,969 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,969 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,969 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,970 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,970 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,970 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,971 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,971 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,971 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,972 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,972 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,972 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,972 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,973 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,973 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,974 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,974 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,974 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,974 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,975 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,975 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,976 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,976 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,976 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,977 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,977 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,977 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,978 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,978 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,980 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,981 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,981 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,981 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,982 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,982 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,982 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,983 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,984 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,985 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,985 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,985 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,985 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,986 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,986 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,986 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,987 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,987 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,987 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,988 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,988 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,988 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,988 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,989 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,989 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,989 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,990 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,990 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,990 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,990 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,991 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] [2022-11-22 00:21:25,991 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_51,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && nomsg == p1_new) && 1 <= tmp) && ((((0 <= p3_\old + 1 && (((!(id3 < m3) && (st3 == 1 || (0 <= st3 && !(id3 == m3)))) && 0 <= send3) || ((id3 < m3 && send3 == m3) && 0 <= st3))) && p3_\old + 1 <= 0) && mode3 == 0) || ((((mode3 == 1 && (\exists v_~p3_new~0_51 : int :: (p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 else (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 + -256) && v_~p3_new~0_51 + 1 <= 0) && 0 <= v_~p3_new~0_51 + 1)) && nomsg == m3) && 0 <= st3) && 0 <= send3))) && 0 <= id1) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || ((((mode2 == 1 && (\exists v_~p2_new~0_51 : int :: (v_~p2_new~0_51 + 1 <= 0 && 0 <= v_~p2_new~0_51 + 1) && (if (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 else -256 + (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256) == p2_\old)) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && mode1 == 1) && id1 <= 127) && nomsg == p2_new) && nomsg + 1 <= 0) && 1 <= \result) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && \old(cond) <= 1) && p3 == 0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && 0 <= st2) && 0 <= p2) && c1 <= 1) && 0 <= send2) && (((mode3 == 1 && (\exists v_~p3_new~0_51 : int :: (p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 else (if !(send3 == nomsg) && v_~p3_new~0_51 == nomsg then send3 else v_~p3_new~0_51) % 256 + -256) && v_~p3_new~0_51 + 1 <= 0) && 0 <= v_~p3_new~0_51 + 1)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && ((((mode2 == 0 && (((st2 == 1 || !(m2 == id2)) && !(id2 < m2)) || (send2 == m2 && id2 < m2))) && 0 <= p2_\old + 1) && p2_\old + 1 <= 0) || ((mode2 == 1 && (\exists v_~p2_new~0_51 : int :: (v_~p2_new~0_51 + 1 <= 0 && 0 <= v_~p2_new~0_51 + 1) && (if (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 <= 127 then (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256 else -256 + (if !(send2 == nomsg) && v_~p2_new~0_51 == nomsg then send2 else v_~p2_new~0_51) % 256) == p2_\old)) && nomsg == m2))) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 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) && cond <= 1) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-22 00:21:26,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04d135b0-ad7b-4043-8fe0-940d942f4b27/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