./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f8505e46ba1dfd9d1ec3a293aaba2f619b40b1a80d91e8d871194a57c70c939 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:00:15,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:00:15,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:00:15,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:00:15,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:00:15,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:00:15,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:00:15,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:00:15,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:00:15,288 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:00:15,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:00:15,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:00:15,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:00:15,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:00:15,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:00:15,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:00:15,303 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:00:15,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:00:15,305 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:00:15,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:00:15,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:00:15,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:00:15,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:00:15,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:00:15,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:00:15,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:00:15,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:00:15,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:00:15,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:00:15,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:00:15,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:00:15,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:00:15,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:00:15,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:00:15,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:00:15,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:00:15,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:00:15,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:00:15,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:00:15,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:00:15,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:00:15,345 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:00:15,394 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:00:15,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:00:15,401 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:00:15,401 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:00:15,402 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:00:15,402 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:00:15,403 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:00:15,403 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:00:15,403 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:00:15,403 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:00:15,405 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:00:15,405 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:00:15,405 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:00:15,406 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:00:15,406 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:00:15,406 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:00:15,406 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:00:15,407 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:00:15,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:00:15,408 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:00:15,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:00:15,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:00:15,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:00:15,409 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:00:15,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:00:15,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:00:15,410 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:00:15,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:00:15,411 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:00:15,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:00:15,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:00:15,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:00:15,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:00:15,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:00:15,413 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:00:15,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:00:15,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:00:15,413 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:00:15,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:00:15,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:00:15,415 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:00:15,423 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_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 2f8505e46ba1dfd9d1ec3a293aaba2f619b40b1a80d91e8d871194a57c70c939 [2022-11-26 00:00:15,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:00:15,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:00:15,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:00:15,738 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:00:15,739 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:00:15,740 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/combinations/gcd_2+newton_2_1.i [2022-11-26 00:00:18,897 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:00:19,080 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:00:19,081 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i [2022-11-26 00:00:19,088 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/data/63c204a00/a20db86cf8d240c1bcb666ea62589e96/FLAG4b18a136f [2022-11-26 00:00:19,103 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/data/63c204a00/a20db86cf8d240c1bcb666ea62589e96 [2022-11-26 00:00:19,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:00:19,108 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:00:19,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:00:19,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:00:19,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:00:19,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:00:19" (1/1) ... [2022-11-26 00:00:19,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60bc04a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:19, skipping insertion in model container [2022-11-26 00:00:19,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:00:19" (1/1) ... [2022-11-26 00:00:19,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:00:19,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:00:19,281 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_63ae5aad-2374-437b-b79f-61b575ff7e28/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i[1226,1239] [2022-11-26 00:00:19,305 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_63ae5aad-2374-437b-b79f-61b575ff7e28/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i[2841,2854] [2022-11-26 00:00:19,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:00:19,325 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:00:19,338 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_63ae5aad-2374-437b-b79f-61b575ff7e28/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i[1226,1239] [2022-11-26 00:00:19,349 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_63ae5aad-2374-437b-b79f-61b575ff7e28/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i[2841,2854] [2022-11-26 00:00:19,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:00:19,364 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:00:19,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:19 WrapperNode [2022-11-26 00:00:19,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:00:19,366 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:00:19,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:00:19,366 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:00:19,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:19" (1/1) ... [2022-11-26 00:00:19,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:19" (1/1) ... [2022-11-26 00:00:19,402 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2022-11-26 00:00:19,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:00:19,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:00:19,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:00:19,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:00:19,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:19" (1/1) ... [2022-11-26 00:00:19,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:19" (1/1) ... [2022-11-26 00:00:19,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:19" (1/1) ... [2022-11-26 00:00:19,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:19" (1/1) ... [2022-11-26 00:00:19,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:19" (1/1) ... [2022-11-26 00:00:19,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:19" (1/1) ... [2022-11-26 00:00:19,424 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:19" (1/1) ... [2022-11-26 00:00:19,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:19" (1/1) ... [2022-11-26 00:00:19,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:00:19,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:00:19,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:00:19,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:00:19,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:19" (1/1) ... [2022-11-26 00:00:19,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:00:19,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:00:19,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:00:19,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:00:19,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:00:19,515 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-26 00:00:19,515 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-26 00:00:19,515 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-26 00:00:19,515 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-26 00:00:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:00:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:00:19,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:00:19,586 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:00:19,588 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:00:19,797 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:00:19,961 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:00:19,962 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-26 00:00:19,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:00:19 BoogieIcfgContainer [2022-11-26 00:00:19,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:00:19,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:00:19,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:00:19,972 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:00:19,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:00:19" (1/3) ... [2022-11-26 00:00:19,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0535e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:00:19, skipping insertion in model container [2022-11-26 00:00:19,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:19" (2/3) ... [2022-11-26 00:00:19,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0535e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:00:19, skipping insertion in model container [2022-11-26 00:00:19,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:00:19" (3/3) ... [2022-11-26 00:00:19,976 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_1.i [2022-11-26 00:00:19,998 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:00:19,998 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-26 00:00:20,051 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:00:20,059 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;@6606ddc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:00:20,059 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-26 00:00:20,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-26 00:00:20,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:00:20,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:00:20,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:00:20,073 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:00:20,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:00:20,079 INFO L85 PathProgramCache]: Analyzing trace with hash -499021812, now seen corresponding path program 1 times [2022-11-26 00:00:20,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:00:20,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529792758] [2022-11-26 00:00:20,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:00:20,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:00:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:00:20,531 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-26 00:00:20,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:00:20,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529792758] [2022-11-26 00:00:20,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529792758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:00:20,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:00:20,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:00:20,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207346373] [2022-11-26 00:00:20,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:00:20,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:00:20,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:00:20,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:00:20,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:00:20,574 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-26 00:00:20,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:00:20,681 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-11-26 00:00:20,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:00:20,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-26 00:00:20,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:00:20,702 INFO L225 Difference]: With dead ends: 38 [2022-11-26 00:00:20,702 INFO L226 Difference]: Without dead ends: 21 [2022-11-26 00:00:20,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-26 00:00:20,713 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:00:20,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:00:20,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-26 00:00:20,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-26 00:00:20,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-26 00:00:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-11-26 00:00:20,776 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 6 [2022-11-26 00:00:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:00:20,777 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-11-26 00:00:20,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-26 00:00:20,779 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-11-26 00:00:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-26 00:00:20,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:00:20,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:00:20,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:00:20,782 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:00:20,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:00:20,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1643785969, now seen corresponding path program 1 times [2022-11-26 00:00:20,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:00:20,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341546742] [2022-11-26 00:00:20,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:00:20,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:00:20,829 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 00:00:20,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1983167293] [2022-11-26 00:00:20,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:00:20,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:00:20,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:00:20,853 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:00:20,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:00:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:00:20,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-26 00:00:20,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:00:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:00:21,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:00:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:00:21,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:00:21,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341546742] [2022-11-26 00:00:21,677 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 00:00:21,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983167293] [2022-11-26 00:00:21,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983167293] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:00:21,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1982295822] [2022-11-26 00:00:21,701 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 00:00:21,701 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:00:21,706 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:00:21,719 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:00:21,720 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:00:22,013 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:00:22,455 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '160#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (<= |ULTIMATE.start_gcd_test_#in~a#1| 127) (<= |ULTIMATE.start_main1_~x~0#1| 127) (<= |ULTIMATE.start_gcd_test_#in~b#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (< 0 |ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (ite (<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 (+ |ULTIMATE.start_main1_~x~0#1| 128)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-26 00:00:22,455 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:00:22,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:00:22,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-26 00:00:22,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475309931] [2022-11-26 00:00:22,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:00:22,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 00:00:22,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:00:22,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 00:00:22,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:00:22,484 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-26 00:00:22,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:00:22,818 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-11-26 00:00:22,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:00:22,819 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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-26 00:00:22,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:00:22,820 INFO L225 Difference]: With dead ends: 28 [2022-11-26 00:00:22,820 INFO L226 Difference]: Without dead ends: 23 [2022-11-26 00:00:22,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-11-26 00:00:22,822 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:00:22,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 96 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:00:22,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-26 00:00:22,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-26 00:00:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-26 00:00:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-11-26 00:00:22,830 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 7 [2022-11-26 00:00:22,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:00:22,830 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-11-26 00:00:22,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-26 00:00:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-11-26 00:00:22,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:00:22,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:00:22,832 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2022-11-26 00:00:22,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:00:23,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-26 00:00:23,038 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:00:23,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:00:23,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1300293201, now seen corresponding path program 2 times [2022-11-26 00:00:23,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:00:23,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998787814] [2022-11-26 00:00:23,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:00:23,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:00:23,061 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 00:00:23,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [552472621] [2022-11-26 00:00:23,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:00:23,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:00:23,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:00:23,071 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:00:23,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:00:23,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 00:00:23,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:00:23,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-26 00:00:23,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:00:30,409 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse20 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse11 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (let ((.cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse73 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse74 (mod .cse73 256))) (and (not (<= (mod (+ .cse73 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= .cse11 .cse74) (not (<= .cse74 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0))))))) (.cse31 (not .cse6)) (.cse24 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse72 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse71 (mod .cse72 256))) (and (= .cse11 .cse71) (not (<= .cse71 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (not (<= (mod (+ .cse72 .cse20) 256) 127))))))) (.cse53 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse3 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse2 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (let ((.cse4 (mod .cse2 256))) (let ((.cse5 (<= .cse4 127))) (or (and (let ((.cse0 (+ .cse4 (- 256)))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse0) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse0))) (and (not (= .cse1 0)) (= (mod (+ .cse1 .cse2) 256) .cse3) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (not .cse5) (or (and .cse6 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse7 (mod .cse8 256))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse7) (<= (mod (+ .cse8 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse7 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse9 256)) (= .cse9 0) (<= (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse11) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (not (= .cse10 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0) (<= (mod .cse10 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse12 256)) (= .cse12 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse14 (mod .cse13 256))) (and (not (<= (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse14) (<= .cse14 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse15 (mod .cse16 256))) (and (= .cse11 .cse15) (not (<= .cse15 127)) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse16 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127))))) .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod .cse18 256) 127)) (= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse11) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse19 .cse20) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse19 256)) (= .cse19 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse21 (mod .cse22 256))) (and (= .cse11 .cse21) (not (<= .cse21 127)) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse22 .cse20) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse23 256)) (= .cse23 0) (not (<= (mod (+ .cse23 .cse20) 256) 127))))) .cse24 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= (mod (+ .cse25 .cse20) 256) .cse11) (not (= .cse25 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0) (<= (mod .cse25 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod .cse26 256) 127)) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= (mod (+ .cse26 .cse20) 256) .cse11) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse27 (mod .cse28 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse27) (not (<= (mod (+ .cse28 .cse20) 256) 127)) (<= .cse27 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse30 (mod .cse29 256))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse29 .cse20) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse30) (<= .cse30 127)))))) .cse31))) (and (not (= .cse4 0)) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse32 256)) (= .cse32 0) (not (<= (mod (+ .cse32 .cse20) 256) 127)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ .cse33 .cse20) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse33 256)) (= .cse33 0) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse34 (mod .cse35 256))) (and (= .cse11 .cse34) (not (<= .cse34 127)) (not (<= (mod (+ .cse35 .cse20) 256) 127)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse37 (mod .cse36 256))) (and (<= (mod (+ .cse36 .cse20) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse37) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse37 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse38 (mod .cse39 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse38) (not (<= (mod (+ .cse39 .cse20) 256) 127)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse38 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse40 (mod .cse41 256))) (and (= .cse11 .cse40) (not (<= .cse40 127)) (<= (mod (+ .cse41 .cse20) 256) 127) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse31) (and .cse6 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse42 (mod .cse43 256))) (and (= .cse11 .cse42) (not (<= .cse42 127)) (<= (mod (+ .cse43 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse44 256)) (= .cse44 0) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse45 (mod .cse46 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse45) (<= (mod (+ .cse46 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse45 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse48 (mod .cse47 256))) (and (not (<= (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse48) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse48 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse50 (mod .cse49 256))) (and (not (<= (mod (+ .cse49 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= .cse11 .cse50) (not (<= .cse50 127)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse51 256)) (= .cse51 0) (<= (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4) 256)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (and (= .cse3 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse52) 256)) (not (= .cse52 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) .cse5)))) .cse53) (and (or (and .cse6 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse54 (mod .cse55 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse54) (<= (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse54 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse57 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse56 (mod .cse57 256))) (and (= .cse11 .cse56) (not (<= .cse56 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (<= (mod (+ .cse57 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse58 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse59 (mod .cse58 256))) (and (not (<= (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse59) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse59 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod (+ .cse60 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse60 256)) (= .cse60 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))) .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse61 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse61 256)) (= .cse61 0) (<= (mod (+ .cse61 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) (and .cse31 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ .cse62 .cse20) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse62 256)) (= .cse62 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse64 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse63 (mod .cse64 256))) (and (= .cse11 .cse63) (not (<= .cse63 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (<= (mod (+ .cse64 .cse20) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse65 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse66 (mod .cse65 256))) (and (<= (mod (+ .cse65 .cse20) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse66) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse66 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse68 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse67 (mod .cse68 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse67) (not (<= (mod (+ .cse68 .cse20) 256) 127)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse67 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse69 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse69 256)) (= .cse69 0) (not (<= (mod (+ .cse69 .cse20) 256) 127)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))) .cse24))) (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (not .cse53) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse70 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= .cse3 (mod (+ .cse70 .cse2) 256)) (not (= .cse70 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-26 00:01:20,850 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (let ((.cse10 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (let ((.cse6 (mod .cse10 256))) (let ((.cse24 (<= .cse6 127)) (.cse13 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse16 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse33 (not .cse0)) (.cse19 (not (= .cse6 0))) (.cse28 (not (= |c_ULTIMATE.start_main1_~y~0#1| 0))) (.cse32 (not .cse13)) (.cse3 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse7 (+ .cse6 (- 256))) (.cse14 (not .cse24))) (or (and .cse0 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse2 (mod .cse4 256))) (let ((.cse1 (mod .cse2 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse1 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse1 256)) (not (= .cse2 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse2))) (and (= .cse3 (mod (+ (* .cse4 255) .cse5) 256)) (not (= .cse5 0)) (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse11 (+ (mod (+ .cse9 .cse10) 256) (- 256)))) (let ((.cse12 (mod .cse11 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse11))) (and (not (= .cse8 0)) (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= .cse3 (mod (+ .cse9 .cse10 .cse8) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (= (mod .cse12 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse9 0)) (= .cse12 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))))) .cse13 .cse14) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse18 (+ (mod (+ .cse17 .cse10) 256) (- 256)))) (let ((.cse15 (mod .cse18 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse16) (not (= .cse17 0)) (not (= .cse15 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= .cse3 (mod (+ .cse17 .cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse18)) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse13 .cse14) (and (let ((.cse22 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and .cse13 (or (and .cse19 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse20 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse23) 256)))) (let ((.cse21 (mod .cse20 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse20) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= (mod (+ .cse21 .cse22) 256) .cse16) (not (= .cse21 0)) (not (= .cse23 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse24) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse27 (+ (mod (+ .cse26 .cse10) 256) (- 256)))) (let ((.cse25 (mod .cse27 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse16 (mod (+ .cse25 .cse22) 256)) (not (= .cse26 0)) (not (= .cse25 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse27) 256) |c_ULTIMATE.start_gcd_test_~a#1|))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse14))) (and .cse28 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse31 (+ (- 256) (mod (+ .cse30 .cse10) 256)))) (let ((.cse29 (mod .cse31 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse16 (mod (+ .cse22 .cse29) 256)) (not (= .cse29 0)) (not (= .cse30 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse31) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse32))) .cse33) (and (or (and .cse28 .cse32 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse34) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse34 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse34 0)))))) (and (or (and .cse14 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse35 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse35) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse35 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse35 0)))))) (and .cse19 .cse24 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse36) 256)) (= (mod (mod .cse36 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse36 0)) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse13)) .cse33) (and .cse33 (or (and .cse13 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse39 (+ (mod (+ .cse38 .cse10) 256) (- 256)))) (let ((.cse37 (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod .cse37 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse38 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse39) 256) |c_ULTIMATE.start_gcd_test_~a#1|))) (= .cse37 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse41 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7) 256))) (let ((.cse40 (mod .cse41 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse40 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse41) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse40 256)) (not (= .cse41 0))))))) .cse14) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse42 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse44) 256)))) (let ((.cse43 (mod .cse42 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse42) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= .cse43 0) (not (= .cse44 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse43 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse45 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256))) (let ((.cse46 (mod .cse45 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse45) 256)) (= (mod .cse46 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse45 0)) (= .cse46 0) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse19 .cse24))) (and .cse28 .cse32 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse47 (+ (- 256) (mod (+ .cse49 .cse10) 256)))) (let ((.cse48 (mod .cse47 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse47) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (= .cse48 0) (not (= .cse49 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse48 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse50 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse51 (mod .cse50 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse50) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse51 256)) (= .cse51 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse50 0)))))))))) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse52 (mod .cse53 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse52 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse52 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse54 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse52))) (and (= .cse3 (mod (+ (* .cse53 255) .cse54) 256)) (not (= .cse54 0)) (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))))))) .cse13 .cse14)))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-26 00:01:26,378 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse3 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (let ((.cse1 (mod .cse3 256))) (let ((.cse10 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse19 (<= .cse1 127)) (.cse12 (< |c_ULTIMATE.start_main1_~g~0#1| 0))) (let ((.cse4 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse26 (not .cse12)) (.cse18 (not (= .cse1 0))) (.cse6 (+ .cse1 (- 256))) (.cse11 (not .cse19)) (.cse13 (not (= |c_ULTIMATE.start_main1_~y~0#1| 0))) (.cse14 (not .cse10)) (.cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (= (mod (mod .cse32 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse32) 256) |c_ULTIMATE.start_main1_~g~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse32 0))))))) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse5 (+ (mod (+ .cse2 .cse3) 256) (- 256)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse5))) (and (not (= .cse0 0)) (<= .cse1 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= (mod (+ .cse2 .cse3 .cse0) 256) .cse4) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (= (mod .cse5 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (= .cse2 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse9 (mod .cse7 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse9))) (and (= .cse4 (mod (+ (* .cse7 255) .cse8) 256)) (not (= .cse8 0)) (<= .cse1 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (= (mod .cse9 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse9 0))))))) .cse10 .cse11 .cse12) (and (or (and .cse13 .cse14 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse15 (+ (- 256) (mod (+ .cse16 .cse3) 256)))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse15) 256) |c_ULTIMATE.start_main1_~g~0#1|) (not (= .cse16 0)) (= (mod (mod .cse15 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) .cse17)) (and (or (and .cse18 .cse19 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse20 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse1) 256))) (and (= (mod .cse20 |c_ULTIMATE.start_main1_~g~0#1|) 0) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse20) 256) |c_ULTIMATE.start_main1_~g~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse20 0)) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse1))) (let ((.cse21 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse22) 256)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse21) 256) |c_ULTIMATE.start_main1_~g~0#1|) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (= .cse22 0)) (= (mod .cse21 |c_ULTIMATE.start_main1_~g~0#1|) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256))) (and (= (mod .cse23 |c_ULTIMATE.start_main1_~g~0#1|) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse23) 256) |c_ULTIMATE.start_main1_~g~0#1|))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse23 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse25 (+ (mod (+ .cse24 .cse3) 256) (- 256)))) (and (not (= .cse24 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse25) 256) |c_ULTIMATE.start_main1_~g~0#1|))) (= (mod (mod .cse25 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse11)) .cse10)) .cse26) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse29 (mod .cse27 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse29))) (and (= .cse4 (mod (+ (* .cse27 255) .cse28) 256)) (not (= .cse28 0)) (<= .cse1 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse29 0)) (= (mod (mod .cse29 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0))))) .cse10 .cse11 .cse12) (and .cse26 (or (and .cse10 (or (and .cse18 .cse19 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse1) 256))) (and (= (mod (mod .cse30 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse30) 256) |c_ULTIMATE.start_main1_~g~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse30 0)) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse31 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse31) 256) |c_ULTIMATE.start_main1_~g~0#1|))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse31 0)) (= (mod (mod .cse31 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0)))) .cse11))) (and .cse13 .cse14 .cse17)))))))) (not (= |c_ULTIMATE.start_main1_~g~0#1| 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| 127)) is different from false [2022-11-26 00:01:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-26 00:01:27,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:01:49,541 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse17 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod (+ .cse17 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse21 (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse18 (mod .cse17 256)) (.cse10 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse20 (<= .cse21 127)) (.cse11 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse0 (<= .cse22 127))) (let ((.cse14 (<= .cse22 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse15 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse22) 256) 0))) (.cse16 (not .cse0)) (.cse4 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse21) 256) 0))) (.cse8 (not .cse11)) (.cse9 (not .cse20)) (.cse6 (not .cse10)) (.cse7 (<= .cse21 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse19 (<= .cse18 127))) (and (or (let ((.cse12 (<= .cse18 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse13 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse18) 256) 0)))) (let ((.cse1 (or .cse10 .cse8 .cse12 .cse13)) (.cse5 (= .cse17 0)) (.cse3 (or .cse10 .cse12 .cse13))) (and (or .cse0 (let ((.cse2 (or .cse10 .cse11 .cse12 .cse13))) (and .cse1 .cse2 (or (and (or (and .cse3 (or .cse4 .cse5 .cse6 .cse7)) .cse8) .cse2) .cse9)))) (or (and .cse1 (or .cse9 (and (or (and (or .cse14 .cse15 .cse6) .cse3) .cse11) (or .cse8 (and (or .cse4 .cse6 .cse7) .cse3)))) (or .cse11 (and (or .cse14 .cse5 .cse15 .cse6) .cse3))) .cse16)))) (not .cse19)) (or (and (or (and (or .cse9 (and (or .cse4 .cse8 .cse6 .cse7) (or .cse14 .cse15 .cse11 .cse6))) (or .cse14 .cse15 .cse11 .cse20 .cse6)) .cse16) (or .cse4 .cse8 .cse0 .cse9 .cse6 .cse7)) .cse19)))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) is different from true [2022-11-26 00:06:34,919 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse35 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse0 (not .cse35)) (.cse4 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse3 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod (+ .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse2 (+ (- 256) .cse6))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse2))) (let ((.cse1 (mod .cse5 256))) (or (<= .cse1 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse2 .cse1) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse3 .cse4) 256) 127) (<= (mod .cse3 256) 127) (not (<= (mod (+ (* .cse3 255) .cse4 .cse5) 256) 127)) (<= .cse6 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse10 (mod .cse9 256))) (let ((.cse7 (+ (- 256) .cse10))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse7))) (let ((.cse8 (mod .cse11 256))) (or (not (= (mod (mod .cse7 .cse8) 256) 0)) (<= (mod (+ .cse9 .cse4) 256) 127) (<= .cse10 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse8 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse9 255) .cse11) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse12 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse15 (+ (- 256) .cse16))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse15))) (let ((.cse14 (mod .cse13 256))) (or (<= (mod (+ (* .cse12 255) .cse4 .cse13) 256) 127) (<= .cse14 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse15 .cse14) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse12 .cse4) 256) 127) (<= (mod .cse12 256) 127) (<= .cse16 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod .cse19 256))) (let ((.cse17 (+ (- 256) .cse21))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse17))) (let ((.cse18 (mod .cse20 256))) (or (not (= (mod (mod .cse17 .cse18) 256) 0)) (not (<= (mod (+ (* .cse19 255) .cse20) 256) 127)) (<= (mod (+ .cse19 .cse4) 256) 127) (<= .cse21 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse18 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse22 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod .cse22 256))) (let ((.cse23 (+ (- 256) .cse25))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse23))) (let ((.cse24 (mod .cse26 256))) (or (not (<= (mod (+ .cse22 .cse4) 256) 127)) (not (= (mod (mod .cse23 .cse24) 256) 0)) (not (<= (mod (+ .cse22 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse25 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse24 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse22 255) .cse26) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse27 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse28 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse29) 256))) (or (not (<= (mod (+ .cse27 .cse4) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse28 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse29 127)) (<= (mod .cse27 256) 127) (= 0 .cse29) (not (= (mod (mod .cse29 .cse28) 256) 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse30 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod .cse30 256))) (let ((.cse31 (+ (- 256) .cse33))) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse31))) (let ((.cse32 (mod .cse34 256))) (or (not (<= (mod (+ .cse30 .cse4) 256) 127)) (not (= (mod (mod .cse31 .cse32) 256) 0)) (not (<= (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse33 127) (< 127 (mod (+ (* .cse30 255) .cse34) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse32 |c_ULTIMATE.start_main1_~y~0#1|))))))))))) .cse0) (or .cse35 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse38 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse39 (mod (+ .cse38 .cse4) 256))) (let ((.cse36 (+ (- 256) .cse39))) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse36))) (let ((.cse37 (mod .cse40 256))) (or (not (= (mod (mod .cse36 .cse37) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse39 127) (<= (mod .cse38 256) 127) (<= .cse37 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse38 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse40) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse43 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse44 (mod .cse43 256))) (let ((.cse41 (+ (- 256) .cse44))) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse41))) (let ((.cse42 (mod .cse45 256))) (or (not (= (mod (mod .cse41 .cse42) 256) 0)) (not (<= (mod (+ .cse43 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse43 .cse4) 256) 127) (<= .cse44 127) (< 127 (mod (+ (* .cse43 255) .cse45) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse42 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse48 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod .cse48 256))) (let ((.cse46 (+ (- 256) .cse49))) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse46))) (let ((.cse47 (mod .cse50 256))) (or (not (= (mod (mod .cse46 .cse47) 256) 0)) (not (<= (mod (+ .cse48 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse48 .cse4) 256) 127) (<= .cse49 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse47 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse48 255) .cse50) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse55 (mod (+ .cse51 .cse4) 256))) (let ((.cse53 (+ (- 256) .cse55))) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse53))) (let ((.cse54 (mod .cse52 256))) (or (< 127 (mod (+ (* .cse51 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse52) 256)) (not (= (mod (mod .cse53 .cse54) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse55 127) (<= (mod .cse51 256) 127) (<= .cse54 |c_ULTIMATE.start_main1_~y~0#1|)))))))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse56 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse57 (mod .cse56 256))) (let ((.cse58 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse57) 256))) (or (not (<= (mod (+ .cse56 .cse4) 256) 127)) (= .cse57 0) (not (<= (mod (+ .cse56 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse58 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse57 127)) (not (= (mod (mod .cse57 .cse58) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse59 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse61 (mod (+ .cse59 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse60 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse61) 256))) (or (not (<= (mod (+ .cse59 .cse4) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse60 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse61 127)) (= 0 .cse61) (not (<= (mod .cse59 256) 127)) (not (= (mod (mod .cse61 .cse60) 256) 0))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse63 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse62 (mod .cse63 256))) (let ((.cse64 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse62) 256))) (or (= .cse62 0) (not (<= (mod (+ .cse63 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse63 .cse4) 256) 127) (<= .cse64 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse62 127)) (not (= (mod (mod .cse62 .cse64) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse67 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse68 (mod (+ .cse67 .cse4) 256))) (let ((.cse65 (+ (- 256) .cse68))) (let ((.cse69 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse65))) (let ((.cse66 (mod .cse69 256))) (or (not (= (mod (mod .cse65 .cse66) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse67 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse68 127) (<= .cse66 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse67 256) 127)) (<= (mod (+ (* .cse67 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse69) 256) 127) (= .cse67 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse72 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse74 (mod (+ .cse72 .cse4) 256))) (let ((.cse70 (+ (- 256) .cse74))) (let ((.cse73 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse70))) (let ((.cse71 (mod .cse73 256))) (or (not (= (mod (mod .cse70 .cse71) 256) 0)) (not (<= (mod (+ (* .cse72 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse73) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse72 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse74 127) (<= .cse71 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse72 256) 127)) (= .cse72 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse35) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse76 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse75 (mod .cse76 256))) (let ((.cse77 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse75) 256))) (or (= .cse75 0) (<= (mod (+ .cse76 .cse4) 256) 127) (<= .cse77 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse75 127)) (not (= (mod (mod .cse75 .cse77) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse76 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse78 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse82 (mod (+ .cse78 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse81 (+ (- 256) .cse82))) (let ((.cse79 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse81))) (let ((.cse80 (mod .cse79 256))) (or (<= (mod (+ (* .cse78 255) .cse4 .cse79) 256) 127) (<= .cse80 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse81 .cse80) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse78 .cse4) 256) 127) (not (<= (mod .cse78 256) 127)) (<= .cse82 127) (= .cse78 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse85 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse85 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse84 (+ (- 256) .cse87))) (let ((.cse86 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse84))) (let ((.cse83 (mod .cse86 256))) (or (<= .cse83 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse84 .cse83) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse85 .cse4) 256) 127) (not (<= (mod (+ (* .cse85 255) .cse4 .cse86) 256) 127)) (not (<= (mod .cse85 256) 127)) (<= .cse87 127)))))))))))) (or .cse35 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse88 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse91 (mod .cse88 256))) (let ((.cse89 (+ (- 256) .cse91))) (let ((.cse92 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse89))) (let ((.cse90 (mod .cse92 256))) (or (not (<= (mod (+ .cse88 .cse4) 256) 127)) (not (= (mod (mod .cse89 .cse90) 256) 0)) (not (<= (mod (+ .cse88 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse91 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse90 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse88 255) .cse92) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse93 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse97 (mod .cse93 256))) (let ((.cse94 (+ (- 256) .cse97))) (let ((.cse96 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse94))) (let ((.cse95 (mod .cse96 256))) (or (not (<= (mod (+ .cse93 .cse4) 256) 127)) (not (= (mod (mod .cse94 .cse95) 256) 0)) (not (<= (mod (+ (* .cse93 255) .cse96) 256) 127)) (not (<= (mod (+ .cse93 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse97 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse95 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse99 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse98 (mod (+ .cse99 .cse4) 256))) (let ((.cse100 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse98) 256))) (or (not (<= .cse98 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse99 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse98 0) (<= (mod .cse99 256) 127) (<= .cse100 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse98 .cse100) 256) 0))))))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse101 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse105 (mod (+ .cse101 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse104 (+ (- 256) .cse105))) (let ((.cse102 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse104))) (let ((.cse103 (mod .cse102 256))) (or (not (<= (mod (+ .cse101 .cse4) 256) 127)) (<= (mod (+ (* .cse101 255) .cse4 .cse102) 256) 127) (<= .cse103 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse104 .cse103) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse101 256) 127) (<= .cse105 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse106 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse110 (mod .cse106 256))) (let ((.cse107 (+ (- 256) .cse110))) (let ((.cse109 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse107))) (let ((.cse108 (mod .cse109 256))) (or (not (<= (mod (+ .cse106 .cse4) 256) 127)) (not (= (mod (mod .cse107 .cse108) 256) 0)) (not (<= (mod (+ (* .cse106 255) .cse109) 256) 127)) (<= .cse110 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse108 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse106 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse111 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse114 (mod .cse111 256))) (let ((.cse112 (+ (- 256) .cse114))) (let ((.cse115 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse112))) (let ((.cse113 (mod .cse115 256))) (or (not (<= (mod (+ .cse111 .cse4) 256) 127)) (not (= (mod (mod .cse112 .cse113) 256) 0)) (<= .cse114 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse113 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse111 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse111 255) .cse115) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse116 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse120 (mod (+ .cse116 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse118 (+ (- 256) .cse120))) (let ((.cse119 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse118))) (let ((.cse117 (mod .cse119 256))) (or (not (<= (mod (+ .cse116 .cse4) 256) 127)) (<= .cse117 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse118 .cse117) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse116 256) 127) (not (<= (mod (+ (* .cse116 255) .cse4 .cse119) 256) 127)) (<= .cse120 127)))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse122 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse121 (mod (+ .cse122 .cse4) 256))) (let ((.cse123 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse121) 256))) (or (not (<= .cse121 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse121 0) (not (<= (mod .cse122 256) 127)) (<= (mod (+ .cse122 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= .cse123 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse121 .cse123) 256) 0)) (= .cse122 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse124 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse125 (mod .cse124 256))) (let ((.cse126 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse125) 256))) (or (not (<= (mod (+ .cse124 .cse4) 256) 127)) (= .cse125 0) (<= .cse126 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse125 127)) (not (= (mod (mod .cse125 .cse126) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse124 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse35) (or .cse35 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse128 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse127 (mod (+ .cse128 .cse4) 256))) (let ((.cse129 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse127) 256))) (or (not (<= .cse127 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse128 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse127 0) (not (<= (mod .cse128 256) 127)) (<= .cse129 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse127 .cse129) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse130 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse131 (mod .cse130 256))) (let ((.cse132 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse131) 256))) (or (not (<= (mod (+ .cse130 .cse4) 256) 127)) (= .cse131 0) (not (<= (mod (+ .cse130 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse132 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse131 127)) (not (= (mod (mod .cse131 .cse132) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse35 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse135 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse136 (mod .cse135 256))) (let ((.cse133 (+ (- 256) .cse136))) (let ((.cse137 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse133))) (let ((.cse134 (mod .cse137 256))) (or (not (= (mod (mod .cse133 .cse134) 256) 0)) (<= (mod (+ .cse135 .cse4) 256) 127) (<= .cse136 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse134 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse135 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse135 255) .cse137) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse140 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse142 (mod (+ .cse140 .cse4) 256))) (let ((.cse138 (+ (- 256) .cse142))) (let ((.cse141 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse138))) (let ((.cse139 (mod .cse141 256))) (or (not (= (mod (mod .cse138 .cse139) 256) 0)) (not (<= (mod (+ (* .cse140 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse141) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse142 127) (<= (mod .cse140 256) 127) (<= .cse139 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse140 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse146 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse145 (mod (+ .cse146 .cse4) 256))) (let ((.cse143 (+ (- 256) .cse145))) (let ((.cse147 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse143))) (let ((.cse144 (mod .cse147 256))) (or (not (= (mod (mod .cse143 .cse144) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse145 127) (<= (mod .cse146 256) 127) (<= .cse144 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse146 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse146 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse147) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse150 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse152 (mod .cse150 256))) (let ((.cse148 (+ (- 256) .cse152))) (let ((.cse151 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse148))) (let ((.cse149 (mod .cse151 256))) (or (not (= (mod (mod .cse148 .cse149) 256) 0)) (not (<= (mod (+ (* .cse150 255) .cse151) 256) 127)) (<= (mod (+ .cse150 .cse4) 256) 127) (<= .cse152 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse149 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse150 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse155 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse154 (mod (+ .cse155 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse153 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse154) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse153 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse154 127)) (<= (mod (+ .cse155 .cse4) 256) 127) (= 0 .cse154) (not (<= (mod .cse155 256) 127)) (not (= (mod (mod .cse154 .cse153) 256) 0)) (= .cse155 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse157 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse156 (mod .cse157 256))) (let ((.cse158 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse156) 256))) (or (= .cse156 0) (not (<= (mod (+ .cse157 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse157 .cse4) 256) 127) (<= .cse158 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse156 127)) (not (= (mod (mod .cse156 .cse158) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse162 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse161 (mod (+ .cse162 .cse4) 256))) (let ((.cse159 (+ (- 256) .cse161))) (let ((.cse163 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse159))) (let ((.cse160 (mod .cse163 256))) (or (not (= (mod (mod .cse159 .cse160) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse161 127) (<= .cse160 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse162 256) 127)) (<= (mod (+ .cse162 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse162 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse163) 256) 127) (= .cse162 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse165 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse164 (mod .cse165 256))) (let ((.cse166 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse164) 256))) (or (= .cse164 0) (<= (mod (+ .cse165 .cse4) 256) 127) (<= .cse166 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse164 127)) (not (= (mod (mod .cse164 .cse166) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse165 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse169 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse171 (mod (+ .cse169 .cse4) 256))) (let ((.cse167 (+ (- 256) .cse171))) (let ((.cse170 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse167))) (let ((.cse168 (mod .cse170 256))) (or (not (= (mod (mod .cse167 .cse168) 256) 0)) (not (<= (mod (+ (* .cse169 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse170) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse171 127) (<= .cse168 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse169 256) 127)) (<= (mod (+ .cse169 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))) .cse35) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse172 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse173 (mod .cse172 256))) (let ((.cse174 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse173) 256))) (or (not (<= (mod (+ .cse172 .cse4) 256) 127)) (= .cse173 0) (<= .cse174 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse173 127)) (not (= (mod (mod .cse173 .cse174) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse172 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse175 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse179 (mod (+ .cse175 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse178 (+ (- 256) .cse179))) (let ((.cse176 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse178))) (let ((.cse177 (mod .cse176 256))) (or (not (<= (mod (+ .cse175 .cse4) 256) 127)) (<= (mod (+ (* .cse175 255) .cse4 .cse176) 256) 127) (<= .cse177 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse178 .cse177) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod .cse175 256) 127)) (<= .cse179 127) (= .cse175 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse180 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse184 (mod (+ .cse180 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse182 (+ (- 256) .cse184))) (let ((.cse183 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse182))) (let ((.cse181 (mod .cse183 256))) (or (not (<= (mod (+ .cse180 .cse4) 256) 127)) (<= .cse181 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse182 .cse181) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ (* .cse180 255) .cse4 .cse183) 256) 127)) (not (<= (mod .cse180 256) 127)) (<= .cse184 127) (= .cse180 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))))) (or .cse35 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse186 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse185 (mod (+ .cse186 .cse4) 256))) (let ((.cse187 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse185) 256))) (or (not (<= .cse185 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse185 0) (<= (mod .cse186 256) 127) (<= (mod (+ .cse186 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= .cse187 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse185 .cse187) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse188 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse192 (mod .cse188 256))) (let ((.cse189 (+ (- 256) .cse192))) (let ((.cse191 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse189))) (let ((.cse190 (mod .cse191 256))) (or (not (<= (mod (+ .cse188 .cse4) 256) 127)) (not (= (mod (mod .cse189 .cse190) 256) 0)) (not (<= (mod (+ (* .cse188 255) .cse191) 256) 127)) (<= .cse192 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse190 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse188 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse193 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse196 (mod .cse193 256))) (let ((.cse194 (+ (- 256) .cse196))) (let ((.cse197 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse194))) (let ((.cse195 (mod .cse197 256))) (or (not (<= (mod (+ .cse193 .cse4) 256) 127)) (not (= (mod (mod .cse194 .cse195) 256) 0)) (<= .cse196 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse195 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse193 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse193 255) .cse197) 256) 127)))))))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse200 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse199 (mod (+ .cse200 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse198 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse199) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse198 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse199 127)) (<= (mod (+ .cse200 .cse4) 256) 127) (<= (mod .cse200 256) 127) (= 0 .cse199) (not (= (mod (mod .cse199 .cse198) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse203 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse204 (mod .cse203 256))) (let ((.cse201 (+ (- 256) .cse204))) (let ((.cse205 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse201))) (let ((.cse202 (mod .cse205 256))) (or (not (= (mod (mod .cse201 .cse202) 256) 0)) (not (<= (mod (+ .cse203 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse203 .cse4) 256) 127) (<= .cse204 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse202 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse203 255) .cse205) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse208 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse209 (mod .cse208 256))) (let ((.cse206 (+ (- 256) .cse209))) (let ((.cse210 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse206))) (let ((.cse207 (mod .cse210 256))) (or (not (= (mod (mod .cse206 .cse207) 256) 0)) (not (<= (mod (+ .cse208 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse208 .cse4) 256) 127) (<= .cse209 127) (< 127 (mod (+ (* .cse208 255) .cse210) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse207 |c_ULTIMATE.start_main1_~y~0#1|))))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) is different from true [2022-11-26 00:06:36,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-26 00:06:36,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:36,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998787814] [2022-11-26 00:06:36,175 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 00:06:36,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552472621] [2022-11-26 00:06:36,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552472621] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:06:36,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [629368193] [2022-11-26 00:06:36,179 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 00:06:36,179 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:06:36,180 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:06:36,180 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:06:36,180 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:06:36,413 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:06:37,130 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '306#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (<= |ULTIMATE.start_gcd_test_#in~a#1| 127) (<= |ULTIMATE.start_main1_~x~0#1| 127) (<= |ULTIMATE.start_gcd_test_#in~b#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (< 0 |ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (ite (<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 (+ |ULTIMATE.start_main1_~x~0#1| 128)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-26 00:06:37,130 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:06:37,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:06:37,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-26 00:06:37,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768532074] [2022-11-26 00:06:37,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:06:37,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:06:37,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:37,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:06:37,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=148, Unknown=5, NotChecked=140, Total=342 [2022-11-26 00:06:37,133 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 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-26 00:06:39,270 WARN L859 $PredicateComparison]: unable to prove that (and (let ((.cse0 (< |c_ULTIMATE.start_main1_~y~0#1| 0))) (or (and .cse0 (let ((.cse1 (mod (* |c_ULTIMATE.start_main1_~y~0#1| 255) 256))) (let ((.cse2 (<= .cse1 127))) (or (and (= .cse1 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (not .cse2)) (and (= .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) .cse2))))) (and (not .cse0) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|)))) (or (let ((.cse38 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse3 (not .cse38)) (.cse7 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse6 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ .cse6 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse5 (+ (- 256) .cse9))) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse5))) (let ((.cse4 (mod .cse8 256))) (or (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse5 .cse4) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse6 .cse7) 256) 127) (<= (mod .cse6 256) 127) (not (<= (mod (+ (* .cse6 255) .cse7 .cse8) 256) 127)) (<= .cse9 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse12 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (mod .cse12 256))) (let ((.cse10 (+ (- 256) .cse13))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse10))) (let ((.cse11 (mod .cse14 256))) (or (not (= (mod (mod .cse10 .cse11) 256) 0)) (<= (mod (+ .cse12 .cse7) 256) 127) (<= .cse13 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse11 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse12 255) .cse14) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse15 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse19 (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse18 (+ (- 256) .cse19))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse18))) (let ((.cse17 (mod .cse16 256))) (or (<= (mod (+ (* .cse15 255) .cse7 .cse16) 256) 127) (<= .cse17 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse18 .cse17) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse15 .cse7) 256) 127) (<= (mod .cse15 256) 127) (<= .cse19 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse22 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod .cse22 256))) (let ((.cse20 (+ (- 256) .cse24))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse20))) (let ((.cse21 (mod .cse23 256))) (or (not (= (mod (mod .cse20 .cse21) 256) 0)) (not (<= (mod (+ (* .cse22 255) .cse23) 256) 127)) (<= (mod (+ .cse22 .cse7) 256) 127) (<= .cse24 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse21 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse22 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod .cse25 256))) (let ((.cse26 (+ (- 256) .cse28))) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse26))) (let ((.cse27 (mod .cse29 256))) (or (not (<= (mod (+ .cse25 .cse7) 256) 127)) (not (= (mod (mod .cse26 .cse27) 256) 0)) (not (<= (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse28 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse27 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse25 255) .cse29) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse30 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse32 (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse31 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse32) 256))) (or (not (<= (mod (+ .cse30 .cse7) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse31 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse32 127)) (<= (mod .cse30 256) 127) (= 0 .cse32) (not (= (mod (mod .cse32 .cse31) 256) 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse36 (mod .cse33 256))) (let ((.cse34 (+ (- 256) .cse36))) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse34))) (let ((.cse35 (mod .cse37 256))) (or (not (<= (mod (+ .cse33 .cse7) 256) 127)) (not (= (mod (mod .cse34 .cse35) 256) 0)) (not (<= (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse36 127) (< 127 (mod (+ (* .cse33 255) .cse37) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse35 |c_ULTIMATE.start_main1_~y~0#1|))))))))))) .cse3) (or .cse38 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 .cse7) 256))) (let ((.cse39 (+ (- 256) .cse42))) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse39))) (let ((.cse40 (mod .cse43 256))) (or (not (= (mod (mod .cse39 .cse40) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse42 127) (<= (mod .cse41 256) 127) (<= .cse40 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse41 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse43) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse46 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse47 (mod .cse46 256))) (let ((.cse44 (+ (- 256) .cse47))) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse44))) (let ((.cse45 (mod .cse48 256))) (or (not (= (mod (mod .cse44 .cse45) 256) 0)) (not (<= (mod (+ .cse46 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse46 .cse7) 256) 127) (<= .cse47 127) (< 127 (mod (+ (* .cse46 255) .cse48) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse45 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse52 (mod .cse51 256))) (let ((.cse49 (+ (- 256) .cse52))) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse49))) (let ((.cse50 (mod .cse53 256))) (or (not (= (mod (mod .cse49 .cse50) 256) 0)) (not (<= (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse51 .cse7) 256) 127) (<= .cse52 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse50 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse51 255) .cse53) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse54 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse58 (mod (+ .cse54 .cse7) 256))) (let ((.cse56 (+ (- 256) .cse58))) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse56))) (let ((.cse57 (mod .cse55 256))) (or (< 127 (mod (+ (* .cse54 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse55) 256)) (not (= (mod (mod .cse56 .cse57) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse54 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse58 127) (<= (mod .cse54 256) 127) (<= .cse57 |c_ULTIMATE.start_main1_~y~0#1|)))))))))))) (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse59 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse60 (mod .cse59 256))) (let ((.cse61 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse60) 256))) (or (not (<= (mod (+ .cse59 .cse7) 256) 127)) (= .cse60 0) (not (<= (mod (+ .cse59 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse61 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse60 127)) (not (= (mod (mod .cse60 .cse61) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse64 (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse63 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse64) 256))) (or (not (<= (mod (+ .cse62 .cse7) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse63 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse64 127)) (= 0 .cse64) (not (<= (mod .cse62 256) 127)) (not (= (mod (mod .cse64 .cse63) 256) 0))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse66 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse65 (mod .cse66 256))) (let ((.cse67 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse65) 256))) (or (= .cse65 0) (not (<= (mod (+ .cse66 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse66 .cse7) 256) 127) (<= .cse67 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse65 127)) (not (= (mod (mod .cse65 .cse67) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse70 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse70 .cse7) 256))) (let ((.cse68 (+ (- 256) .cse71))) (let ((.cse72 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse68))) (let ((.cse69 (mod .cse72 256))) (or (not (= (mod (mod .cse68 .cse69) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse70 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse71 127) (<= .cse69 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse70 256) 127)) (<= (mod (+ (* .cse70 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse72) 256) 127) (= .cse70 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse75 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse77 (mod (+ .cse75 .cse7) 256))) (let ((.cse73 (+ (- 256) .cse77))) (let ((.cse76 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse73))) (let ((.cse74 (mod .cse76 256))) (or (not (= (mod (mod .cse73 .cse74) 256) 0)) (not (<= (mod (+ (* .cse75 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse76) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse77 127) (<= .cse74 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse75 256) 127)) (= .cse75 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse38) (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse79 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse78 (mod .cse79 256))) (let ((.cse80 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse78) 256))) (or (= .cse78 0) (<= (mod (+ .cse79 .cse7) 256) 127) (<= .cse80 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse78 127)) (not (= (mod (mod .cse78 .cse80) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse79 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse81 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse85 (mod (+ .cse81 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse84 (+ (- 256) .cse85))) (let ((.cse82 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse84))) (let ((.cse83 (mod .cse82 256))) (or (<= (mod (+ (* .cse81 255) .cse7 .cse82) 256) 127) (<= .cse83 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse84 .cse83) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse81 .cse7) 256) 127) (not (<= (mod .cse81 256) 127)) (<= .cse85 127) (= .cse81 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse88 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse90 (mod (+ .cse88 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse87 (+ (- 256) .cse90))) (let ((.cse89 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse87))) (let ((.cse86 (mod .cse89 256))) (or (<= .cse86 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse87 .cse86) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse88 .cse7) 256) 127) (not (<= (mod (+ (* .cse88 255) .cse7 .cse89) 256) 127)) (not (<= (mod .cse88 256) 127)) (<= .cse90 127)))))))))))) (or .cse38 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse91 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse94 (mod .cse91 256))) (let ((.cse92 (+ (- 256) .cse94))) (let ((.cse95 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse92))) (let ((.cse93 (mod .cse95 256))) (or (not (<= (mod (+ .cse91 .cse7) 256) 127)) (not (= (mod (mod .cse92 .cse93) 256) 0)) (not (<= (mod (+ .cse91 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse94 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse93 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse91 255) .cse95) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse96 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse100 (mod .cse96 256))) (let ((.cse97 (+ (- 256) .cse100))) (let ((.cse99 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse97))) (let ((.cse98 (mod .cse99 256))) (or (not (<= (mod (+ .cse96 .cse7) 256) 127)) (not (= (mod (mod .cse97 .cse98) 256) 0)) (not (<= (mod (+ (* .cse96 255) .cse99) 256) 127)) (not (<= (mod (+ .cse96 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse100 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse98 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse102 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse101 (mod (+ .cse102 .cse7) 256))) (let ((.cse103 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse101) 256))) (or (not (<= .cse101 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse102 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse101 0) (<= (mod .cse102 256) 127) (<= .cse103 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse101 .cse103) 256) 0))))))))))) (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse104 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse108 (mod (+ .cse104 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse107 (+ (- 256) .cse108))) (let ((.cse105 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse107))) (let ((.cse106 (mod .cse105 256))) (or (not (<= (mod (+ .cse104 .cse7) 256) 127)) (<= (mod (+ (* .cse104 255) .cse7 .cse105) 256) 127) (<= .cse106 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse107 .cse106) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse104 256) 127) (<= .cse108 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse109 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse113 (mod .cse109 256))) (let ((.cse110 (+ (- 256) .cse113))) (let ((.cse112 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse110))) (let ((.cse111 (mod .cse112 256))) (or (not (<= (mod (+ .cse109 .cse7) 256) 127)) (not (= (mod (mod .cse110 .cse111) 256) 0)) (not (<= (mod (+ (* .cse109 255) .cse112) 256) 127)) (<= .cse113 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse111 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse109 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse114 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse117 (mod .cse114 256))) (let ((.cse115 (+ (- 256) .cse117))) (let ((.cse118 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse115))) (let ((.cse116 (mod .cse118 256))) (or (not (<= (mod (+ .cse114 .cse7) 256) 127)) (not (= (mod (mod .cse115 .cse116) 256) 0)) (<= .cse117 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse116 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse114 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse114 255) .cse118) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse119 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse123 (mod (+ .cse119 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse121 (+ (- 256) .cse123))) (let ((.cse122 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse121))) (let ((.cse120 (mod .cse122 256))) (or (not (<= (mod (+ .cse119 .cse7) 256) 127)) (<= .cse120 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse121 .cse120) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse119 256) 127) (not (<= (mod (+ (* .cse119 255) .cse7 .cse122) 256) 127)) (<= .cse123 127)))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse125 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse124 (mod (+ .cse125 .cse7) 256))) (let ((.cse126 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse124) 256))) (or (not (<= .cse124 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse124 0) (not (<= (mod .cse125 256) 127)) (<= (mod (+ .cse125 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= .cse126 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse124 .cse126) 256) 0)) (= .cse125 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse127 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse128 (mod .cse127 256))) (let ((.cse129 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse128) 256))) (or (not (<= (mod (+ .cse127 .cse7) 256) 127)) (= .cse128 0) (<= .cse129 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse128 127)) (not (= (mod (mod .cse128 .cse129) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse127 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse38) (or .cse38 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse131 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse130 (mod (+ .cse131 .cse7) 256))) (let ((.cse132 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse130) 256))) (or (not (<= .cse130 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse131 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse130 0) (not (<= (mod .cse131 256) 127)) (<= .cse132 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse130 .cse132) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse133 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse134 (mod .cse133 256))) (let ((.cse135 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse134) 256))) (or (not (<= (mod (+ .cse133 .cse7) 256) 127)) (= .cse134 0) (not (<= (mod (+ .cse133 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse135 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse134 127)) (not (= (mod (mod .cse134 .cse135) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse38 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse138 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse139 (mod .cse138 256))) (let ((.cse136 (+ (- 256) .cse139))) (let ((.cse140 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse136))) (let ((.cse137 (mod .cse140 256))) (or (not (= (mod (mod .cse136 .cse137) 256) 0)) (<= (mod (+ .cse138 .cse7) 256) 127) (<= .cse139 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse137 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse138 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse138 255) .cse140) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse143 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse145 (mod (+ .cse143 .cse7) 256))) (let ((.cse141 (+ (- 256) .cse145))) (let ((.cse144 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse141))) (let ((.cse142 (mod .cse144 256))) (or (not (= (mod (mod .cse141 .cse142) 256) 0)) (not (<= (mod (+ (* .cse143 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse144) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse145 127) (<= (mod .cse143 256) 127) (<= .cse142 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse143 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse149 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse148 (mod (+ .cse149 .cse7) 256))) (let ((.cse146 (+ (- 256) .cse148))) (let ((.cse150 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse146))) (let ((.cse147 (mod .cse150 256))) (or (not (= (mod (mod .cse146 .cse147) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse148 127) (<= (mod .cse149 256) 127) (<= .cse147 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse149 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse149 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse150) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse153 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse155 (mod .cse153 256))) (let ((.cse151 (+ (- 256) .cse155))) (let ((.cse154 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse151))) (let ((.cse152 (mod .cse154 256))) (or (not (= (mod (mod .cse151 .cse152) 256) 0)) (not (<= (mod (+ (* .cse153 255) .cse154) 256) 127)) (<= (mod (+ .cse153 .cse7) 256) 127) (<= .cse155 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse152 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse153 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))))))) (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse158 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse157 (mod (+ .cse158 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse156 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse157) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse156 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse157 127)) (<= (mod (+ .cse158 .cse7) 256) 127) (= 0 .cse157) (not (<= (mod .cse158 256) 127)) (not (= (mod (mod .cse157 .cse156) 256) 0)) (= .cse158 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse160 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse159 (mod .cse160 256))) (let ((.cse161 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse159) 256))) (or (= .cse159 0) (not (<= (mod (+ .cse160 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse160 .cse7) 256) 127) (<= .cse161 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse159 127)) (not (= (mod (mod .cse159 .cse161) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse165 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse164 (mod (+ .cse165 .cse7) 256))) (let ((.cse162 (+ (- 256) .cse164))) (let ((.cse166 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse162))) (let ((.cse163 (mod .cse166 256))) (or (not (= (mod (mod .cse162 .cse163) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse164 127) (<= .cse163 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse165 256) 127)) (<= (mod (+ .cse165 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse165 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse166) 256) 127) (= .cse165 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse168 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse167 (mod .cse168 256))) (let ((.cse169 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse167) 256))) (or (= .cse167 0) (<= (mod (+ .cse168 .cse7) 256) 127) (<= .cse169 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse167 127)) (not (= (mod (mod .cse167 .cse169) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse168 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse172 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse174 (mod (+ .cse172 .cse7) 256))) (let ((.cse170 (+ (- 256) .cse174))) (let ((.cse173 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse170))) (let ((.cse171 (mod .cse173 256))) (or (not (= (mod (mod .cse170 .cse171) 256) 0)) (not (<= (mod (+ (* .cse172 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse173) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse174 127) (<= .cse171 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse172 256) 127)) (<= (mod (+ .cse172 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))) .cse38) (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse175 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse176 (mod .cse175 256))) (let ((.cse177 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse176) 256))) (or (not (<= (mod (+ .cse175 .cse7) 256) 127)) (= .cse176 0) (<= .cse177 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse176 127)) (not (= (mod (mod .cse176 .cse177) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse175 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse178 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse182 (mod (+ .cse178 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse181 (+ (- 256) .cse182))) (let ((.cse179 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse181))) (let ((.cse180 (mod .cse179 256))) (or (not (<= (mod (+ .cse178 .cse7) 256) 127)) (<= (mod (+ (* .cse178 255) .cse7 .cse179) 256) 127) (<= .cse180 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse181 .cse180) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod .cse178 256) 127)) (<= .cse182 127) (= .cse178 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse183 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse187 (mod (+ .cse183 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse185 (+ (- 256) .cse187))) (let ((.cse186 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse185))) (let ((.cse184 (mod .cse186 256))) (or (not (<= (mod (+ .cse183 .cse7) 256) 127)) (<= .cse184 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse185 .cse184) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ (* .cse183 255) .cse7 .cse186) 256) 127)) (not (<= (mod .cse183 256) 127)) (<= .cse187 127) (= .cse183 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))))) (or .cse38 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse189 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse188 (mod (+ .cse189 .cse7) 256))) (let ((.cse190 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse188) 256))) (or (not (<= .cse188 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse188 0) (<= (mod .cse189 256) 127) (<= (mod (+ .cse189 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= .cse190 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse188 .cse190) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse191 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse195 (mod .cse191 256))) (let ((.cse192 (+ (- 256) .cse195))) (let ((.cse194 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse192))) (let ((.cse193 (mod .cse194 256))) (or (not (<= (mod (+ .cse191 .cse7) 256) 127)) (not (= (mod (mod .cse192 .cse193) 256) 0)) (not (<= (mod (+ (* .cse191 255) .cse194) 256) 127)) (<= .cse195 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse193 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse191 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse196 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse199 (mod .cse196 256))) (let ((.cse197 (+ (- 256) .cse199))) (let ((.cse200 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse197))) (let ((.cse198 (mod .cse200 256))) (or (not (<= (mod (+ .cse196 .cse7) 256) 127)) (not (= (mod (mod .cse197 .cse198) 256) 0)) (<= .cse199 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse198 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse196 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse196 255) .cse200) 256) 127)))))))))))) (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse203 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse202 (mod (+ .cse203 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse201 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse202) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse201 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse202 127)) (<= (mod (+ .cse203 .cse7) 256) 127) (<= (mod .cse203 256) 127) (= 0 .cse202) (not (= (mod (mod .cse202 .cse201) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse206 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse207 (mod .cse206 256))) (let ((.cse204 (+ (- 256) .cse207))) (let ((.cse208 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse204))) (let ((.cse205 (mod .cse208 256))) (or (not (= (mod (mod .cse204 .cse205) 256) 0)) (not (<= (mod (+ .cse206 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse206 .cse7) 256) 127) (<= .cse207 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse205 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse206 255) .cse208) 256) 127)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse211 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse212 (mod .cse211 256))) (let ((.cse209 (+ (- 256) .cse212))) (let ((.cse213 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse209))) (let ((.cse210 (mod .cse213 256))) (or (not (= (mod (mod .cse209 .cse210) 256) 0)) (not (<= (mod (+ .cse211 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse211 .cse7) 256) 127) (<= .cse212 127) (< 127 (mod (+ (* .cse211 255) .cse213) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse210 |c_ULTIMATE.start_main1_~y~0#1|))))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127)) is different from true [2022-11-26 00:06:46,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-11-26 00:06:48,395 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)))) (and (or (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~y~0#1|) .cse0) (let ((.cse21 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse7 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse12 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (let ((.cse18 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse74 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse75 (mod .cse74 256))) (and (not (<= (mod (+ .cse74 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= .cse12 .cse75) (not (<= .cse75 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0))))))) (.cse32 (not .cse7)) (.cse25 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse73 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse72 (mod .cse73 256))) (and (= .cse12 .cse72) (not (<= .cse72 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (not (<= (mod (+ .cse73 .cse21) 256) 127))))))) (.cse54 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse3 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (let ((.cse5 (mod .cse3 256))) (let ((.cse6 (<= .cse5 127))) (or (and (let ((.cse1 (+ .cse5 (- 256)))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse1) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse1))) (and (not (= .cse2 0)) (= (mod (+ .cse2 .cse3) 256) .cse4) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (not .cse6) (or (and .cse7 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse8 (mod .cse9 256))) (and (<= .cse5 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse8) (<= (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse8 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse5 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse10 256)) (= .cse10 0) (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse12) (<= .cse5 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (not (= .cse11 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0) (<= (mod .cse11 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (<= .cse5 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse13 256)) (= .cse13 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse15 (mod .cse14 256))) (and (not (<= (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse15) (<= .cse15 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse16 (mod .cse17 256))) (and (= .cse12 .cse16) (not (<= .cse16 127)) (<= .cse5 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127))))) .cse18 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod .cse19 256) 127)) (= (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse12) (<= .cse5 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse5 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse20 .cse21) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse20 256)) (= .cse20 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse22 (mod .cse23 256))) (and (= .cse12 .cse22) (not (<= .cse22 127)) (<= .cse5 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse23 .cse21) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse5 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse24 256)) (= .cse24 0) (not (<= (mod (+ .cse24 .cse21) 256) 127))))) .cse25 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse5 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= (mod (+ .cse26 .cse21) 256) .cse12) (not (= .cse26 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0) (<= (mod .cse26 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod .cse27 256) 127)) (<= .cse5 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= (mod (+ .cse27 .cse21) 256) .cse12) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse28 (mod .cse29 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse28) (not (<= (mod (+ .cse29 .cse21) 256) 127)) (<= .cse28 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse31 (mod .cse30 256))) (and (<= .cse5 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse30 .cse21) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse31) (<= .cse31 127)))))) .cse32))) (and (not (= .cse5 0)) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse33 256)) (= .cse33 0) (not (<= (mod (+ .cse33 .cse21) 256) 127)) (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ .cse34 .cse21) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse34 256)) (= .cse34 0) (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse35 (mod .cse36 256))) (and (= .cse12 .cse35) (not (<= .cse35 127)) (not (<= (mod (+ .cse36 .cse21) 256) 127)) (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse38 (mod .cse37 256))) (and (<= (mod (+ .cse37 .cse21) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse38) (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse38 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse39 (mod .cse40 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse39) (not (<= (mod (+ .cse40 .cse21) 256) 127)) (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse39 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse41 (mod .cse42 256))) (and (= .cse12 .cse41) (not (<= .cse41 127)) (<= (mod (+ .cse42 .cse21) 256) 127) (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse32) (and .cse7 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse43 (mod .cse44 256))) (and (= .cse12 .cse43) (not (<= .cse43 127)) (<= (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse45 256)) (= .cse45 0) (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse46 (mod .cse47 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse46) (<= (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse46 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse49 (mod .cse48 256))) (and (not (<= (mod (+ .cse48 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse49) (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse49 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse51 (mod .cse50 256))) (and (not (<= (mod (+ .cse50 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= .cse12 .cse51) (not (<= .cse51 127)) (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse52 256)) (= .cse52 0) (<= (mod (+ .cse52 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse5) 256)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse5))) (and (= .cse4 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse53) 256)) (not (= .cse53 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) .cse6)))) .cse54) (and (or (and .cse7 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse55 (mod .cse56 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse55) (<= (mod (+ .cse56 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse55 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse58 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse57 (mod .cse58 256))) (and (= .cse12 .cse57) (not (<= .cse57 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (<= (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse59 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse60 (mod .cse59 256))) (and (not (<= (mod (+ .cse59 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse60) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse60 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse61 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod (+ .cse61 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse61 256)) (= .cse61 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))) .cse18 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse62 256)) (= .cse62 0) (<= (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) (and .cse32 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse63 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ .cse63 .cse21) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse63 256)) (= .cse63 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse65 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse64 (mod .cse65 256))) (and (= .cse12 .cse64) (not (<= .cse64 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (<= (mod (+ .cse65 .cse21) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse67 (mod .cse66 256))) (and (<= (mod (+ .cse66 .cse21) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse67) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse67 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse69 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse68 (mod .cse69 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse68) (not (<= (mod (+ .cse69 .cse21) 256) 127)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse68 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse70 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse70 256)) (= .cse70 0) (not (<= (mod (+ .cse70 .cse21) 256) 127)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))) .cse25))) (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (not .cse54) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse71 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= .cse4 (mod (+ .cse71 .cse3) 256)) (not (= .cse71 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (<= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 256) 0)) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) .cse0) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)))) is different from false [2022-11-26 00:06:50,426 WARN L837 $PredicateComparison]: unable to prove that (and (or (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~y~0#1|) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (let ((.cse10 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (let ((.cse6 (mod .cse10 256))) (let ((.cse24 (<= .cse6 127)) (.cse13 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse16 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse33 (not .cse0)) (.cse19 (not (= .cse6 0))) (.cse28 (not (= |c_ULTIMATE.start_main1_~y~0#1| 0))) (.cse32 (not .cse13)) (.cse3 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse7 (+ .cse6 (- 256))) (.cse14 (not .cse24))) (or (and .cse0 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse2 (mod .cse4 256))) (let ((.cse1 (mod .cse2 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse1 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse1 256)) (not (= .cse2 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse2))) (and (= .cse3 (mod (+ (* .cse4 255) .cse5) 256)) (not (= .cse5 0)) (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse11 (+ (mod (+ .cse9 .cse10) 256) (- 256)))) (let ((.cse12 (mod .cse11 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse11))) (and (not (= .cse8 0)) (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= .cse3 (mod (+ .cse9 .cse10 .cse8) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (= (mod .cse12 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse9 0)) (= .cse12 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))))) .cse13 .cse14) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse18 (+ (mod (+ .cse17 .cse10) 256) (- 256)))) (let ((.cse15 (mod .cse18 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse16) (not (= .cse17 0)) (not (= .cse15 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= .cse3 (mod (+ .cse17 .cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse18)) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse13 .cse14) (and (let ((.cse22 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and .cse13 (or (and .cse19 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse20 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse23) 256)))) (let ((.cse21 (mod .cse20 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse20) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= (mod (+ .cse21 .cse22) 256) .cse16) (not (= .cse21 0)) (not (= .cse23 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse24) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse27 (+ (mod (+ .cse26 .cse10) 256) (- 256)))) (let ((.cse25 (mod .cse27 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse16 (mod (+ .cse25 .cse22) 256)) (not (= .cse26 0)) (not (= .cse25 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse27) 256) |c_ULTIMATE.start_gcd_test_~a#1|))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse14))) (and .cse28 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse31 (+ (- 256) (mod (+ .cse30 .cse10) 256)))) (let ((.cse29 (mod .cse31 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse16 (mod (+ .cse22 .cse29) 256)) (not (= .cse29 0)) (not (= .cse30 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse31) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse32))) .cse33) (and (or (and .cse28 .cse32 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse34) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse34 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse34 0)))))) (and (or (and .cse14 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse35 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse35) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse35 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse35 0)))))) (and .cse19 .cse24 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse36) 256)) (= (mod (mod .cse36 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse36 0)) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse13)) .cse33) (and .cse33 (or (and .cse13 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse39 (+ (mod (+ .cse38 .cse10) 256) (- 256)))) (let ((.cse37 (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod .cse37 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse38 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse39) 256) |c_ULTIMATE.start_gcd_test_~a#1|))) (= .cse37 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse41 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7) 256))) (let ((.cse40 (mod .cse41 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse40 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse41) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse40 256)) (not (= .cse41 0))))))) .cse14) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse42 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse44) 256)))) (let ((.cse43 (mod .cse42 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse42) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= .cse43 0) (not (= .cse44 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse43 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse45 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256))) (let ((.cse46 (mod .cse45 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse45) 256)) (= (mod .cse46 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse45 0)) (= .cse46 0) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse19 .cse24))) (and .cse28 .cse32 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse47 (+ (- 256) (mod (+ .cse49 .cse10) 256)))) (let ((.cse48 (mod .cse47 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse47) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (= .cse48 0) (not (= .cse49 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse48 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse50 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse51 (mod .cse50 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse50) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse51 256)) (= .cse51 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse50 0)))))))))) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse52 (mod .cse53 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse52 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse52 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse54 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse52))) (and (= .cse3 (mod (+ (* .cse53 255) .cse54) 256)) (not (= .cse54 0)) (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))))))) .cse13 .cse14)))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-26 00:06:52,454 WARN L837 $PredicateComparison]: unable to prove that (and (or (<= |c_ULTIMATE.start_main1_~g~0#1| |c_ULTIMATE.start_main1_~y~0#1|) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse3 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (let ((.cse1 (mod .cse3 256))) (let ((.cse10 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse19 (<= .cse1 127)) (.cse12 (< |c_ULTIMATE.start_main1_~g~0#1| 0))) (let ((.cse4 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse26 (not .cse12)) (.cse18 (not (= .cse1 0))) (.cse6 (+ .cse1 (- 256))) (.cse11 (not .cse19)) (.cse13 (not (= |c_ULTIMATE.start_main1_~y~0#1| 0))) (.cse14 (not .cse10)) (.cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (= (mod (mod .cse32 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse32) 256) |c_ULTIMATE.start_main1_~g~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse32 0))))))) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse5 (+ (mod (+ .cse2 .cse3) 256) (- 256)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse5))) (and (not (= .cse0 0)) (<= .cse1 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= (mod (+ .cse2 .cse3 .cse0) 256) .cse4) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (= (mod .cse5 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (= .cse2 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse9 (mod .cse7 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse9))) (and (= .cse4 (mod (+ (* .cse7 255) .cse8) 256)) (not (= .cse8 0)) (<= .cse1 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (= (mod .cse9 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse9 0))))))) .cse10 .cse11 .cse12) (and (or (and .cse13 .cse14 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse15 (+ (- 256) (mod (+ .cse16 .cse3) 256)))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse15) 256) |c_ULTIMATE.start_main1_~g~0#1|) (not (= .cse16 0)) (= (mod (mod .cse15 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) .cse17)) (and (or (and .cse18 .cse19 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse20 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse1) 256))) (and (= (mod .cse20 |c_ULTIMATE.start_main1_~g~0#1|) 0) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse20) 256) |c_ULTIMATE.start_main1_~g~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse20 0)) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse1))) (let ((.cse21 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse22) 256)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse21) 256) |c_ULTIMATE.start_main1_~g~0#1|) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (= .cse22 0)) (= (mod .cse21 |c_ULTIMATE.start_main1_~g~0#1|) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256))) (and (= (mod .cse23 |c_ULTIMATE.start_main1_~g~0#1|) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse23) 256) |c_ULTIMATE.start_main1_~g~0#1|))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse23 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse25 (+ (mod (+ .cse24 .cse3) 256) (- 256)))) (and (not (= .cse24 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse25) 256) |c_ULTIMATE.start_main1_~g~0#1|))) (= (mod (mod .cse25 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse11)) .cse10)) .cse26) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse29 (mod .cse27 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse29))) (and (= .cse4 (mod (+ (* .cse27 255) .cse28) 256)) (not (= .cse28 0)) (<= .cse1 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse29 0)) (= (mod (mod .cse29 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0))))) .cse10 .cse11 .cse12) (and .cse26 (or (and .cse10 (or (and .cse18 .cse19 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse1) 256))) (and (= (mod (mod .cse30 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse30) 256) |c_ULTIMATE.start_main1_~g~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse30 0)) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse31 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse31) 256) |c_ULTIMATE.start_main1_~g~0#1|))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse31 0)) (= (mod (mod .cse31 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0)))) .cse11))) (and .cse13 .cse14 .cse17)))))))) (not (= |c_ULTIMATE.start_main1_~g~0#1| 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| 127)) is different from false [2022-11-26 00:06:52,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:52,747 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-11-26 00:06:52,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 00:06:52,748 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 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 9 [2022-11-26 00:06:52,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:52,748 INFO L225 Difference]: With dead ends: 28 [2022-11-26 00:06:52,749 INFO L226 Difference]: Without dead ends: 24 [2022-11-26 00:06:52,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=62, Invalid=175, Unknown=9, NotChecked=306, Total=552 [2022-11-26 00:06:52,750 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:52,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 65 Unchecked, 2.2s Time] [2022-11-26 00:06:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-26 00:06:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-26 00:06:52,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-26 00:06:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-11-26 00:06:52,779 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 9 [2022-11-26 00:06:52,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:52,779 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-11-26 00:06:52,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 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-26 00:06:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-11-26 00:06:52,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:06:52,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:52,782 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:52,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:06:52,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:52,988 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:52,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:52,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1587976524, now seen corresponding path program 3 times [2022-11-26 00:06:52,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:52,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215359941] [2022-11-26 00:06:52,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:52,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:53,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 00:06:53,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [58753505] [2022-11-26 00:06:53,010 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:06:53,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:53,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:06:53,012 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:06:53,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:06:53,117 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:06:53,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:06:53,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-26 00:06:53,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:31,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 139 [2022-11-26 00:07:31,610 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:31,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215359941] [2022-11-26 00:07:31,610 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 00:07:31,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58753505] [2022-11-26 00:07:31,610 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. [2022-11-26 00:07:31,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1351967399] [2022-11-26 00:07:31,612 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 00:07:31,612 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:07:31,613 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:07:31,613 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:07:31,613 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:07:31,616 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:273) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:221) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 44 more [2022-11-26 00:07:31,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:07:31,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2022-11-26 00:07:31,621 ERROR L170 FreeRefinementEngine]: Strategy SIFA_TAIPAN failed to provide any proof altough trace is infeasible [2022-11-26 00:07:31,621 INFO L360 BasicCegarLoop]: Counterexample might be feasible [2022-11-26 00:07:31,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-26 00:07:31,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-26 00:07:31,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-26 00:07:31,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:31,838 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2022-11-26 00:07:31,840 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:07:31,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:07:31 BoogieIcfgContainer [2022-11-26 00:07:31,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:07:31,854 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:07:31,854 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:07:31,854 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:07:31,854 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:00:19" (3/4) ... [2022-11-26 00:07:31,858 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-26 00:07:31,858 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:07:31,858 INFO L158 Benchmark]: Toolchain (without parser) took 432750.76ms. Allocated memory was 163.6MB in the beginning and 203.4MB in the end (delta: 39.8MB). Free memory was 118.5MB in the beginning and 164.4MB in the end (delta: -45.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:07:31,859 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 163.6MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:07:31,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.99ms. Allocated memory is still 163.6MB. Free memory was 118.5MB in the beginning and 106.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-26 00:07:31,860 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.12ms. Allocated memory is still 163.6MB. Free memory was 106.6MB in the beginning and 104.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:07:31,860 INFO L158 Benchmark]: Boogie Preprocessor took 24.14ms. Allocated memory is still 163.6MB. Free memory was 104.5MB in the beginning and 103.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:07:31,860 INFO L158 Benchmark]: RCFGBuilder took 536.64ms. Allocated memory is still 163.6MB. Free memory was 103.1MB in the beginning and 87.7MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-26 00:07:31,861 INFO L158 Benchmark]: TraceAbstraction took 431884.82ms. Allocated memory was 163.6MB in the beginning and 203.4MB in the end (delta: 39.8MB). Free memory was 87.0MB in the beginning and 165.5MB in the end (delta: -78.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:07:31,861 INFO L158 Benchmark]: Witness Printer took 4.37ms. Allocated memory is still 203.4MB. Free memory was 165.5MB in the beginning and 164.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:07:31,863 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.32ms. Allocated memory is still 163.6MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.99ms. Allocated memory is still 163.6MB. Free memory was 118.5MB in the beginning and 106.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.12ms. Allocated memory is still 163.6MB. Free memory was 106.6MB in the beginning and 104.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.14ms. Allocated memory is still 163.6MB. Free memory was 104.5MB in the beginning and 103.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 536.64ms. Allocated memory is still 163.6MB. Free memory was 103.1MB in the beginning and 87.7MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 431884.82ms. Allocated memory was 163.6MB in the beginning and 203.4MB in the end (delta: 39.8MB). Free memory was 87.0MB in the beginning and 165.5MB in the end (delta: -78.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.37ms. Allocated memory is still 203.4MB. Free memory was 165.5MB in the beginning and 164.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L108] COND TRUE __VERIFIER_nondet_int() [L109] CALL main1() [L49] signed char x = __VERIFIER_nondet_char(); [L50] signed char y = __VERIFIER_nondet_char(); [L51] signed char g; [L53] CALL, EXPR gcd_test(x, y) [L33] signed char t; [L35] COND TRUE a < (signed char)0 [L35] a = -a [L36] COND FALSE !(b < (signed char)0) [L38] COND TRUE b != (signed char)0 [L39] t = b [L40] b = a % b [L41] a = t [L38] COND TRUE b != (signed char)0 [L39] t = b [L40] b = a % b [L41] a = t [L38] COND TRUE b != (signed char)0 [L39] t = b [L40] b = a % b [L41] a = t [L38] COND TRUE b != (signed char)0 [L39] t = b [L40] b = a % b [L41] a = t [L38] COND FALSE !(b != (signed char)0) [L43] return a; [L53] RET, EXPR gcd_test(x, y) [L53] g = gcd_test(x, y) [L55] COND TRUE y > (signed char)0 [L56] CALL __VERIFIER_assert(y >= g) [L26] COND TRUE !(cond) [L27] reach_error() - UnprovableResult [Line: 102]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 25 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 431.8s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 243 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 65 IncrementalHoareTripleChecker+Unchecked, 197 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 119 IncrementalHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 46 mSDtfsCounter, 119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 26.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 412.5s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 33 ConstructedInterpolants, 5 QuantifiedInterpolants, 9799 SizeOfPredicates, 18 NumberOfNonLiveVariables, 266 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/14 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: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f8505e46ba1dfd9d1ec3a293aaba2f619b40b1a80d91e8d871194a57c70c939 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:07:34,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:07:34,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:07:34,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:07:34,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:07:34,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:07:34,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:07:34,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:07:34,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:07:34,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:07:34,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:07:34,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:07:34,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:07:34,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:07:34,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:07:34,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:07:34,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:07:34,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:07:34,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:07:34,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:07:34,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:07:34,153 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:07:34,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:07:34,155 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:07:34,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:07:34,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:07:34,168 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:07:34,171 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:07:34,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:07:34,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:07:34,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:07:34,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:07:34,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:07:34,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:07:34,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:07:34,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:07:34,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:07:34,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:07:34,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:07:34,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:07:34,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:07:34,200 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-26 00:07:34,223 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:07:34,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:07:34,224 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:07:34,224 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:07:34,225 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:07:34,226 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:07:34,226 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:07:34,226 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:07:34,226 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:07:34,227 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:07:34,227 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:07:34,227 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:07:34,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:07:34,228 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:07:34,228 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:07:34,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:07:34,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:07:34,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:07:34,229 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:07:34,229 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-26 00:07:34,230 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-26 00:07:34,230 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-26 00:07:34,230 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:07:34,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:07:34,231 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:07:34,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:07:34,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:07:34,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-26 00:07:34,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:07:34,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:07:34,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:07:34,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:07:34,233 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:07:34,233 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-26 00:07:34,233 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-26 00:07:34,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:07:34,234 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:07:34,234 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-26 00:07:34,234 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 2f8505e46ba1dfd9d1ec3a293aaba2f619b40b1a80d91e8d871194a57c70c939 [2022-11-26 00:07:34,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:07:34,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:07:34,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:07:34,644 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:07:34,644 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:07:34,646 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/combinations/gcd_2+newton_2_1.i [2022-11-26 00:07:37,937 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:07:38,148 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:07:38,148 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i [2022-11-26 00:07:38,158 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/data/e5e598cdb/fd1a3d1645424782bb09e5440c8033e4/FLAG09a8d70e6 [2022-11-26 00:07:38,172 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/data/e5e598cdb/fd1a3d1645424782bb09e5440c8033e4 [2022-11-26 00:07:38,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:07:38,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:07:38,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:07:38,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:07:38,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:07:38,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:07:38" (1/1) ... [2022-11-26 00:07:38,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d72040a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:38, skipping insertion in model container [2022-11-26 00:07:38,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:07:38" (1/1) ... [2022-11-26 00:07:38,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:07:38,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:07:38,361 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_63ae5aad-2374-437b-b79f-61b575ff7e28/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i[1226,1239] [2022-11-26 00:07:38,388 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_63ae5aad-2374-437b-b79f-61b575ff7e28/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i[2841,2854] [2022-11-26 00:07:38,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:07:38,419 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:07:38,446 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_63ae5aad-2374-437b-b79f-61b575ff7e28/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i[1226,1239] [2022-11-26 00:07:38,462 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_63ae5aad-2374-437b-b79f-61b575ff7e28/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i[2841,2854] [2022-11-26 00:07:38,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:07:38,492 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:07:38,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:38 WrapperNode [2022-11-26 00:07:38,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:07:38,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:07:38,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:07:38,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:07:38,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:38" (1/1) ... [2022-11-26 00:07:38,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:38" (1/1) ... [2022-11-26 00:07:38,560 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 80 [2022-11-26 00:07:38,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:07:38,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:07:38,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:07:38,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:07:38,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:38" (1/1) ... [2022-11-26 00:07:38,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:38" (1/1) ... [2022-11-26 00:07:38,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:38" (1/1) ... [2022-11-26 00:07:38,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:38" (1/1) ... [2022-11-26 00:07:38,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:38" (1/1) ... [2022-11-26 00:07:38,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:38" (1/1) ... [2022-11-26 00:07:38,615 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:38" (1/1) ... [2022-11-26 00:07:38,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:38" (1/1) ... [2022-11-26 00:07:38,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:07:38,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:07:38,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:07:38,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:07:38,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:38" (1/1) ... [2022-11-26 00:07:38,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:07:38,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:38,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:07:38,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:07:38,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:07:38,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-26 00:07:38,719 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-26 00:07:38,719 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-26 00:07:38,719 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-26 00:07:38,719 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-26 00:07:38,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:07:38,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:07:38,834 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:07:38,836 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:07:47,930 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:07:47,937 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:07:47,937 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-26 00:07:47,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:07:47 BoogieIcfgContainer [2022-11-26 00:07:47,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:07:47,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:07:47,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:07:47,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:07:47,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:07:38" (1/3) ... [2022-11-26 00:07:47,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a7a588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:07:47, skipping insertion in model container [2022-11-26 00:07:47,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:38" (2/3) ... [2022-11-26 00:07:47,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a7a588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:07:47, skipping insertion in model container [2022-11-26 00:07:47,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:07:47" (3/3) ... [2022-11-26 00:07:47,956 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_1.i [2022-11-26 00:07:47,972 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:07:47,972 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-26 00:07:48,038 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:07:48,047 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;@ae17e5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:07:48,047 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-26 00:07:48,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-26 00:07:48,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:07:48,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:48,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:07:48,072 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:07:48,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:48,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-26 00:07:48,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:07:48,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64231428] [2022-11-26 00:07:48,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:48,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:07:48,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:07:48,098 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:07:48,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-26 00:07:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:48,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:07:48,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:48,313 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-26 00:07:48,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:07:48,315 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:07:48,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64231428] [2022-11-26 00:07:48,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64231428] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:07:48,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:07:48,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:07:48,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383222821] [2022-11-26 00:07:48,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:07:48,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:07:48,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:07:48,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:07:48,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:07:48,361 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-26 00:07:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:48,461 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2022-11-26 00:07:48,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:07:48,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-26 00:07:48,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:48,472 INFO L225 Difference]: With dead ends: 68 [2022-11-26 00:07:48,472 INFO L226 Difference]: Without dead ends: 30 [2022-11-26 00:07:48,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-26 00:07:48,480 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:48,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:07:48,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-26 00:07:48,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-26 00:07:48,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-26 00:07:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-26 00:07:48,518 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-11-26 00:07:48,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:48,519 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-26 00:07:48,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-26 00:07:48,519 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-26 00:07:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:07:48,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:48,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:07:48,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-26 00:07:48,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:07:48,727 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:07:48,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:48,727 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-11-26 00:07:48,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:07:48,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410543484] [2022-11-26 00:07:48,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:48,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:07:48,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:07:48,730 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:07:48,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-26 00:07:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:48,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:07:48,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:48,946 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-26 00:07:48,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:07:48,948 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:07:48,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410543484] [2022-11-26 00:07:48,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410543484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:07:48,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:07:48,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:07:48,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261457692] [2022-11-26 00:07:48,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:07:48,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:07:48,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:07:48,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:07:48,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:07:48,958 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-26 00:07:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:49,208 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-11-26 00:07:49,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:07:49,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-26 00:07:49,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:49,210 INFO L225 Difference]: With dead ends: 37 [2022-11-26 00:07:49,211 INFO L226 Difference]: Without dead ends: 31 [2022-11-26 00:07:49,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:07:49,213 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:49,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 84 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:07:49,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-26 00:07:49,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-11-26 00:07:49,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-26 00:07:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-26 00:07:49,221 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-11-26 00:07:49,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:49,221 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-26 00:07:49,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-26 00:07:49,222 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-26 00:07:49,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:07:49,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:49,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:07:49,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:49,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:07:49,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:07:49,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:49,435 INFO L85 PathProgramCache]: Analyzing trace with hash 149955676, now seen corresponding path program 1 times [2022-11-26 00:07:49,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:07:49,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086637530] [2022-11-26 00:07:49,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:49,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:07:49,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:07:49,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:07:49,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-26 00:07:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:49,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:07:49,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:07:49,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:07:49,686 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:07:49,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086637530] [2022-11-26 00:07:49,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086637530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:07:49,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:07:49,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:07:49,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033338338] [2022-11-26 00:07:49,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:07:49,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:07:49,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:07:49,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:07:49,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:07:49,690 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-26 00:07:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:49,820 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-11-26 00:07:49,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:07:49,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-26 00:07:49,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:49,823 INFO L225 Difference]: With dead ends: 38 [2022-11-26 00:07:49,823 INFO L226 Difference]: Without dead ends: 30 [2022-11-26 00:07:49,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:07:49,825 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:49,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:07:49,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-26 00:07:49,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-26 00:07:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-26 00:07:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-26 00:07:49,834 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 12 [2022-11-26 00:07:49,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:49,835 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-26 00:07:49,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-26 00:07:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-26 00:07:49,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:07:49,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:49,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:07:49,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:50,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:07:50,037 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:07:50,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:50,038 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2022-11-26 00:07:50,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:07:50,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605501976] [2022-11-26 00:07:50,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:50,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:07:50,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:07:50,045 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:07:50,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-26 00:07:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:50,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 00:07:50,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:07:50,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:07:51,673 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:07:51,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605501976] [2022-11-26 00:07:51,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605501976] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:51,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [73506169] [2022-11-26 00:07:51,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:51,681 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:07:51,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:07:51,690 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:07:51,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-11-26 00:07:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:51,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 00:07:51,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:07:52,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:07:52,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [73506169] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:52,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244915316] [2022-11-26 00:07:52,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:52,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:52,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:52,414 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:52,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:07:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:52,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-26 00:07:52,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:07:52,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:07:53,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244915316] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:53,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-26 00:07:53,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 7] total 18 [2022-11-26 00:07:53,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333499944] [2022-11-26 00:07:53,723 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-26 00:07:53,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-26 00:07:53,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:07:53,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-26 00:07:53,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-11-26 00:07:53,726 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:07:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:58,273 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-11-26 00:07:58,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-26 00:07:58,275 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-26 00:07:58,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:58,275 INFO L225 Difference]: With dead ends: 43 [2022-11-26 00:07:58,276 INFO L226 Difference]: Without dead ends: 20 [2022-11-26 00:07:58,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2022-11-26 00:07:58,278 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 63 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:58,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 159 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-26 00:07:58,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-26 00:07:58,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-26 00:07:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-26 00:07:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-11-26 00:07:58,284 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2022-11-26 00:07:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:58,285 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-11-26 00:07:58,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:07:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-11-26 00:07:58,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:07:58,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:58,286 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:07:58,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:58,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:58,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:58,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:07:58,891 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:07:58,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:58,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1535073882, now seen corresponding path program 1 times [2022-11-26 00:07:58,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:07:58,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889741637] [2022-11-26 00:07:58,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:58,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:07:58,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:07:58,894 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:07:58,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63ae5aad-2374-437b-b79f-61b575ff7e28/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process