./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_3_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_3_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 613ee8845912b921567ac9e82f8c414d8758c61c69ed2c2ac2cbc303a1b4f001 --- 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-5e519f3 [2022-11-02 20:52:15,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:52:15,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:52:15,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:52:15,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:52:15,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:52:15,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:52:15,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:52:15,250 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:52:15,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:52:15,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:52:15,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:52:15,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:52:15,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:52:15,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:52:15,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:52:15,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:52:15,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:52:15,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:52:15,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:52:15,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:52:15,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:52:15,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:52:15,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:52:15,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:52:15,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:52:15,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:52:15,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:52:15,301 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:52:15,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:52:15,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:52:15,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:52:15,307 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:52:15,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:52:15,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:52:15,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:52:15,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:52:15,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:52:15,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:52:15,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:52:15,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:52:15,314 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:52:15,354 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:52:15,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:52:15,355 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:52:15,355 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:52:15,356 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:52:15,356 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:52:15,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:52:15,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:52:15,358 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:52:15,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:52:15,360 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:52:15,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:52:15,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:52:15,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:52:15,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:52:15,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:52:15,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:52:15,361 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:52:15,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:52:15,362 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:52:15,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:52:15,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:52:15,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:52:15,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:52:15,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:52:15,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:52:15,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:52:15,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:52:15,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:52:15,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:52:15,364 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:52:15,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:52:15,365 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:52:15,365 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_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/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_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc 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 -> Automizer 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 -> 613ee8845912b921567ac9e82f8c414d8758c61c69ed2c2ac2cbc303a1b4f001 [2022-11-02 20:52:15,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:52:15,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:52:15,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:52:15,675 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:52:15,676 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:52:15,677 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/combinations/gcd_2+newton_3_1.i [2022-11-02 20:52:15,761 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/data/ef40b9bbf/6b4e67da4e784504b5eb16c17a067646/FLAGad3d65503 [2022-11-02 20:52:16,209 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:52:16,214 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i [2022-11-02 20:52:16,222 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/data/ef40b9bbf/6b4e67da4e784504b5eb16c17a067646/FLAGad3d65503 [2022-11-02 20:52:16,601 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/data/ef40b9bbf/6b4e67da4e784504b5eb16c17a067646 [2022-11-02 20:52:16,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:52:16,608 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:52:16,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:52:16,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:52:16,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:52:16,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:52:16" (1/1) ... [2022-11-02 20:52:16,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b1d11a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:16, skipping insertion in model container [2022-11-02 20:52:16,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:52:16" (1/1) ... [2022-11-02 20:52:16,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:52:16,650 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:52:16,912 WARN L230 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_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[1226,1239] [2022-11-02 20:52:16,957 WARN L230 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_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[2862,2875] [2022-11-02 20:52:16,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:52:16,966 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:52:16,985 WARN L230 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_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[1226,1239] [2022-11-02 20:52:17,009 WARN L230 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_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[2862,2875] [2022-11-02 20:52:17,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:52:17,024 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:52:17,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:17 WrapperNode [2022-11-02 20:52:17,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:52:17,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:52:17,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:52:17,027 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:52:17,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:17" (1/1) ... [2022-11-02 20:52:17,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:17" (1/1) ... [2022-11-02 20:52:17,093 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 82 [2022-11-02 20:52:17,095 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:52:17,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:52:17,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:52:17,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:52:17,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:17" (1/1) ... [2022-11-02 20:52:17,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:17" (1/1) ... [2022-11-02 20:52:17,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:17" (1/1) ... [2022-11-02 20:52:17,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:17" (1/1) ... [2022-11-02 20:52:17,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:17" (1/1) ... [2022-11-02 20:52:17,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:17" (1/1) ... [2022-11-02 20:52:17,135 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:17" (1/1) ... [2022-11-02 20:52:17,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:17" (1/1) ... [2022-11-02 20:52:17,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:52:17,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:52:17,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:52:17,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:52:17,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:17" (1/1) ... [2022-11-02 20:52:17,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:52:17,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:17,184 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:52:17,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:52:17,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:52:17,238 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-02 20:52:17,238 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-02 20:52:17,238 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-02 20:52:17,240 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-02 20:52:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:52:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:52:17,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:52:17,323 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:52:17,326 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:52:17,580 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:52:17,591 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:52:17,592 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:52:17,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:52:17 BoogieIcfgContainer [2022-11-02 20:52:17,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:52:17,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:52:17,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:52:17,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:52:17,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:52:16" (1/3) ... [2022-11-02 20:52:17,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab7330d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:52:17, skipping insertion in model container [2022-11-02 20:52:17,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:17" (2/3) ... [2022-11-02 20:52:17,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab7330d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:52:17, skipping insertion in model container [2022-11-02 20:52:17,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:52:17" (3/3) ... [2022-11-02 20:52:17,604 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_1.i [2022-11-02 20:52:17,623 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:52:17,624 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:52:17,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:52:17,701 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=PETRI_NET, 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;@5e3b5a1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:52:17,703 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 20:52:17,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:52:17,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:52:17,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:17,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:17,723 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:17,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:17,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-02 20:52:17,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:17,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704005543] [2022-11-02 20:52:17,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:17,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:18,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:18,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:18,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704005543] [2022-11-02 20:52:18,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704005543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:18,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:18,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:52:18,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493892995] [2022-11-02 20:52:18,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:18,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:52:18,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:18,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:52:18,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:52:18,186 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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-02 20:52:18,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:18,300 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-11-02 20:52:18,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:52:18,303 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-02 20:52:18,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:18,311 INFO L225 Difference]: With dead ends: 96 [2022-11-02 20:52:18,311 INFO L226 Difference]: Without dead ends: 39 [2022-11-02 20:52:18,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:52:18,320 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 29 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:18,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 122 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:18,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-02 20:52:18,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2022-11-02 20:52:18,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:52:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-11-02 20:52:18,370 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2022-11-02 20:52:18,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:18,371 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-11-02 20:52:18,371 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-02 20:52:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-11-02 20:52:18,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:52:18,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:18,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:18,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:52:18,374 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:18,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:18,375 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-11-02 20:52:18,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:18,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413539801] [2022-11-02 20:52:18,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:18,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:18,510 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-02 20:52:18,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:18,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413539801] [2022-11-02 20:52:18,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413539801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:18,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:18,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:52:18,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233556755] [2022-11-02 20:52:18,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:18,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:52:18,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:18,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:52:18,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:52:18,522 INFO L87 Difference]: Start difference. First operand 32 states and 37 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-02 20:52:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:18,575 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-11-02 20:52:18,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:52:18,576 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-02 20:52:18,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:18,577 INFO L225 Difference]: With dead ends: 39 [2022-11-02 20:52:18,577 INFO L226 Difference]: Without dead ends: 33 [2022-11-02 20:52:18,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:52:18,579 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:18,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 97 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:52:18,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-02 20:52:18,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-02 20:52:18,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:52:18,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-11-02 20:52:18,590 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2022-11-02 20:52:18,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:18,592 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-11-02 20:52:18,593 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-02 20:52:18,594 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-11-02 20:52:18,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:52:18,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:18,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:18,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:52:18,597 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:18,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:18,599 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2022-11-02 20:52:18,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:18,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879887487] [2022-11-02 20:52:18,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:18,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:18,618 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:52:18,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911843675] [2022-11-02 20:52:18,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:18,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:18,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:18,631 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:18,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:52:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:18,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:52:18,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:18,881 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-02 20:52:18,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:18,984 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-02 20:52:18,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:18,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879887487] [2022-11-02 20:52:18,985 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:52:18,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911843675] [2022-11-02 20:52:18,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911843675] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:52:18,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:52:18,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-11-02 20:52:18,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791040824] [2022-11-02 20:52:18,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:18,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:18,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:18,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:18,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:18,994 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-02 20:52:19,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:19,127 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-11-02 20:52:19,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:19,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-02 20:52:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:19,129 INFO L225 Difference]: With dead ends: 40 [2022-11-02 20:52:19,131 INFO L226 Difference]: Without dead ends: 34 [2022-11-02 20:52:19,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:52:19,133 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:19,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 183 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-02 20:52:19,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-02 20:52:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:52:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-11-02 20:52:19,141 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2022-11-02 20:52:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:19,141 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-11-02 20:52:19,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-02 20:52:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-11-02 20:52:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:52:19,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:19,143 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:19,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:19,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:19,364 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:19,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:19,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1659957129, now seen corresponding path program 2 times [2022-11-02 20:52:19,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:19,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925738175] [2022-11-02 20:52:19,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:19,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:19,381 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:52:19,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2057997274] [2022-11-02 20:52:19,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:52:19,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:19,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:19,387 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:19,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:52:19,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:52:19,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:52:19,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-02 20:52:19,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:29,576 WARN L234 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:52:42,447 WARN L234 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:52:51,123 WARN L234 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:53:02,978 WARN L234 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 45 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:53:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:03,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:16,443 WARN L855 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) (let ((.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse5 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (let ((.cse1 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse32 (mod .cse33 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse32) 256) 0)) (< .cse32 .cse5) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (<= (mod (+ .cse33 .cse3) 256) 127) (not (<= .cse32 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (.cse6 (not .cse0)) (.cse9 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (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 ((.cse31 (mod .cse30 256))) (or (not (<= (mod (+ .cse30 .cse3) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse31) 256) 0)) (< .cse31 .cse5) (not (<= (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (<= .cse31 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0))))))))) (and (or .cse0 .cse1) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse2 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse4 (mod .cse2 256))) (or (not (<= (mod (+ .cse2 .cse3) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse4) 256) 0)) (< .cse4 .cse5) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= .cse4 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse2 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))) .cse6) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse8 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod (+ .cse8 .cse3) 256))) (or (not (<= .cse7 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse8 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse7) 256) 0)) (< .cse7 .cse5) (<= (mod (+ .cse8 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (or (and .cse9 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse11 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse10 (mod (+ .cse11 .cse3) 256))) (or (not (<= .cse10 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse10) 256) 0)) (not (<= (mod .cse11 256) 127)) (< .cse10 .cse5)))))))) .cse0) (or .cse6 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|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 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (<= (mod (+ .cse12 .cse3) 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (< .cse13 .cse5) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse13 127)) (<= (mod .cse12 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse13) 256) 0))))))) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse15 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod (+ .cse15 .cse3) 256))) (or (not (<= .cse14 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod .cse15 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse14) 256) 0)) (< .cse14 .cse5))))) .cse0) (or .cse6 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse17 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (< .cse16 .cse5) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse16 127)) (<= (mod (+ .cse17 .cse3) 256) 127) (<= (mod .cse17 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse16) 256) 0))))))) (or .cse6 .cse1) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod .cse19 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse18) 256) 0)) (< .cse18 .cse5) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse19 .cse3) 256) 127) (not (<= .cse18 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod .cse20 256))) (or (not (<= (mod (+ .cse20 .cse3) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse21) 256) 0)) (< .cse21 .cse5) (not (<= .cse21 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse23 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod (+ .cse23 .cse3) 256))) (or (not (<= .cse22 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse22) 256) 0)) (not (<= (mod .cse23 256) 127)) (< .cse22 .cse5) (<= (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse23 0))))) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse6 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (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 ((.cse24 (mod .cse25 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse24) 256) 0)) (< .cse24 .cse5) (not (<= (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse25 .cse3) 256) 127) (not (<= .cse24 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (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 ((.cse26 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse26 .cse5) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse26 127)) (<= (mod (+ .cse27 .cse3) 256) 127) (not (<= (mod .cse27 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse26) 256) 0)) (= .cse27 0))))))))) (or .cse6 (and .cse9 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (<= (mod (+ .cse28 .cse3) 256) 127)) (< .cse29 .cse5) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse29 127)) (not (<= (mod .cse28 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse29) 256) 0)))))))))))))) is different from true [2022-11-02 20:53:56,115 WARN L234 SmtUtils]: Spent 30.76s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:53:59,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 20:53:59,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:59,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925738175] [2022-11-02 20:53:59,273 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:53:59,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057997274] [2022-11-02 20:53:59,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057997274] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:53:59,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:59,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-11-02 20:53:59,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604074785] [2022-11-02 20:53:59,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:59,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 20:53:59,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:59,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 20:53:59,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=193, Unknown=5, NotChecked=28, Total=272 [2022-11-02 20:53:59,276 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:04,640 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-11-02 20:54:04,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:54:04,640 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 20:54:04,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:04,641 INFO L225 Difference]: With dead ends: 41 [2022-11-02 20:54:04,641 INFO L226 Difference]: Without dead ends: 35 [2022-11-02 20:54:04,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 86.8s TimeCoverageRelationStatistics Valid=53, Invalid=218, Unknown=5, NotChecked=30, Total=306 [2022-11-02 20:54:04,643 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:04,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 321 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 56 Unchecked, 0.2s Time] [2022-11-02 20:54:04,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-02 20:54:04,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-02 20:54:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:54:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-11-02 20:54:04,650 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 13 [2022-11-02 20:54:04,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:04,651 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-11-02 20:54:04,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-11-02 20:54:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:54:04,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:04,652 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:04,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-02 20:54:04,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:04,868 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:04,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:04,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1682229690, now seen corresponding path program 3 times [2022-11-02 20:54:04,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:04,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990914259] [2022-11-02 20:54:04,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:04,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:04,887 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:54:04,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1848725893] [2022-11-02 20:54:04,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:54:04,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:04,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:04,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:54:04,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e65ee92-2405-4a1d-9cdb-0221d9e709a5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:54:05,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 20:54:05,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:54:05,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-02 20:54:05,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:34,102 WARN L234 SmtUtils]: Spent 18.86s on a formula simplification. DAG size of input: 63 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:54:51,436 WARN L234 SmtUtils]: Spent 5.54s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:55:21,213 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse19 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (let ((.cse37 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse65 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse65 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse65 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (= .cse65 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))))) (.cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse64 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (not (<= (mod (+ .cse64 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse64 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))))) (.cse32 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse63 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (<= .cse63 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)) (= .cse63 |c_ULTIMATE.start_gcd_test_~b#1|))))) (.cse20 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse62 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (not (<= .cse62 127)) (= .cse62 .cse19) (not (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))))) (.cse31 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse61 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse60 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (not (<= (mod (+ .cse60 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod .cse61 256) |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (= .cse61 0))))))) (or (and .cse0 .cse1) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse3 (mod .cse2 256))) (and (not (<= (mod (+ .cse2 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse3) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (<= .cse4 127) (<= .cse3 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse4 |c_ULTIMATE.start_gcd_test_~b#1|)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse5 (mod (+ .cse6 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse5)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse6 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse6 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse5 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= (mod .cse7 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse7 0)))))))))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse10 (mod (+ .cse8 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse10)))) (and (not (<= (mod (+ .cse8 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod .cse9 256) |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse10 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= (mod .cse11 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse11 0)))) (= .cse9 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse12 (mod .cse13 256))) (and (not (= .cse12 0)) (<= (mod (+ .cse13 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse12) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse14 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (<= .cse14 127) (<= .cse12 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse14 |c_ULTIMATE.start_gcd_test_~b#1|)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)))))))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse15 (mod (+ .cse16 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse15)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse16 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse17 (mod (+ .cse20 .cse18) 256))) (and (<= .cse15 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (<= .cse17 127)) (not (= .cse18 0)) (= .cse17 .cse19) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0))))) (not (= .cse16 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse21 (mod .cse23 256))) (and (not (= .cse21 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse22 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (not (<= .cse22 127)) (<= .cse21 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse22 .cse19)))) (<= (mod (+ .cse23 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse21) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse24 (mod .cse26 256))) (and (not (= .cse24 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse24 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod .cse25 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse25 0)))) (<= (mod (+ .cse26 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse24) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse28 (mod (+ .cse27 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (not (<= (mod (+ .cse27 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse28)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse29 (mod (+ .cse20 .cse30) 256))) (and (<= .cse28 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (<= .cse29 127)) (not (= .cse30 0)) (= .cse29 .cse19) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0))))))))))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (and .cse31 .cse32) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse34 (mod (+ .cse33 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (not (<= (mod (+ .cse33 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse34)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse35 (mod (+ .cse20 .cse36) 256))) (and (<= .cse35 127) (= .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse34 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse36 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0))))))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (and .cse37 .cse0) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse39 (mod (+ .cse38 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (not (<= (mod (+ .cse38 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse39)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse39 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= (mod .cse40 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse40 0)))))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse42 (mod .cse41 256))) (and (not (<= (mod (+ .cse41 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse42 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod .cse43 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse43 0)))) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse42) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse44 (mod (+ .cse45 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse44)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse45 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse45 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse46 (mod (+ .cse20 .cse47) 256))) (and (<= .cse46 127) (= .cse46 |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse44 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse47 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0))))))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse51 (mod (+ .cse48 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse51)))) (and (not (<= (mod (+ .cse48 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod .cse49 256) |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (= .cse49 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse50 (mod (+ .cse20 .cse52) 256))) (and (<= .cse50 127) (= .cse50 |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse51 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse52 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))))))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (and .cse37 .cse32) (and .cse1 .cse32) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse53 (mod (+ .cse55 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse53)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse54 (mod (+ .cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|)) 256))) (and (<= .cse53 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (<= .cse54 127)) (= .cse54 .cse19) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))) (not (<= (mod (+ .cse55 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod .cse56 256) |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (= .cse56 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (and .cse0 .cse31) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse57 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse59 (mod .cse57 256))) (and (not (<= (mod (+ .cse57 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse58 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (not (<= .cse58 127)) (<= .cse59 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse58 .cse19)))) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse59) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127)) is different from false [2022-11-02 20:55:26,841 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (let ((.cse7 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0)))) (.cse0 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse2 (mod (+ .cse3 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse2)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse0 .cse1) 256) 0) (<= .cse2 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse1 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))) (not (<= (mod (+ .cse3 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod .cse4 256) |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (= .cse4 0)))))))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse6 (mod .cse5 256))) (and (not (<= (mod (+ .cse5 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse6) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 0))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (and .cse7 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse8 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (not (<= (mod (+ .cse8 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod .cse9 256) |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (= .cse9 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse11 (mod (+ .cse10 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (not (<= (mod (+ .cse10 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse11)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= .cse11 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 0))))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse12 (mod (+ .cse13 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse12)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse13 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= .cse12 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 0))) (not (= .cse13 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (and .cse7 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (not (<= (mod (+ .cse14 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse14 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse15 (mod .cse16 256))) (and (not (= .cse15 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0) (<= .cse15 |v_ULTIMATE.start_gcd_test_~a#1_20|))) (<= (mod (+ .cse16 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse15) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse18 (mod (+ .cse19 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse0 .cse17) 256) 0) (<= .cse18 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse17 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))) (not (<= (mod (+ .cse19 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse18)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))))) (and .cse7 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse20 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse20 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (= .cse20 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse22 (mod .cse21 256))) (and (not (<= (mod (+ .cse21 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0) (<= .cse22 |v_ULTIMATE.start_gcd_test_~a#1_20|))) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse22) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)))))))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse23 (mod .cse24 256))) (and (not (= .cse23 0)) (<= (mod (+ .cse24 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse23) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= .cse23 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 0))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse26 (mod (+ .cse27 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse0 .cse25) 256) 0) (<= .cse26 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse25 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse26)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse27 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse27 0)))))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse30 (mod (+ .cse28 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse30)))) (and (not (<= (mod (+ .cse28 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod .cse29 256) |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= .cse30 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 0))) (= .cse29 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|)))))))) is different from false [2022-11-02 20:55:32,728 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse12 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0)))) (.cse6 (* 255 |c_ULTIMATE.start_gcd_test_#res#1|))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse1 (mod .cse0 256))) (and (not (<= (mod (+ .cse0 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse1) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)))))))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse2 (mod (+ .cse3 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse2)) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (not (<= (mod (+ .cse3 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= .cse2 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|) 0))))))))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse4 (mod (+ .cse7 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse4)) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse5 0)) (= (mod (+ .cse6 .cse5) 256) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))) (<= (mod (+ .cse7 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse7 0)))))))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse8 (mod (+ .cse9 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse8)) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (mod (+ .cse9 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse9 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= .cse8 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|) 0))))))))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse11 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (= (mod .cse10 256) |c_ULTIMATE.start_gcd_test_#res#1|) (not (<= (mod (+ .cse11 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (= .cse10 0))))) .cse12) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse14 (mod .cse13 256))) (and (not (<= (mod (+ .cse13 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse14) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= .cse14 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|) 0))))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse15 (mod .cse16 256))) (and (not (= .cse15 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse15) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (mod (+ .cse16 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= .cse15 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (and .cse12 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse17 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (not (<= (mod (+ .cse17 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse18 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (mod (+ .cse18 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (= .cse18 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0))))) .cse12) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse19 (mod .cse20 256))) (and (not (= .cse19 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse19) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (mod (+ .cse20 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= .cse19 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|) 0))))))))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse23 (mod (+ .cse22 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse23)))) (and (= (mod .cse21 256) |c_ULTIMATE.start_gcd_test_#res#1|) (not (<= (mod (+ .cse22 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= .cse23 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (= .cse21 0)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse24 (mod (+ .cse25 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse24)) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (not (<= (mod (+ .cse25 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|))) (and (<= .cse24 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse26 0)) (= (mod (+ .cse6 .cse26) 256) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|))) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse29 (mod (+ .cse28 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse29)))) (and (= (mod .cse27 256) |c_ULTIMATE.start_gcd_test_#res#1|) (not (<= (mod (+ .cse28 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|))) (and (<= .cse29 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse30 0)) (= (mod (+ .cse6 .cse30) 256) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (= .cse27 0)))))))) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127)) is different from false [2022-11-02 20:55:42,400 WARN L833 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse1 (mod (+ .cse0 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (let ((.cse2 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse1)) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (<= (mod (+ .cse0 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse1 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse0 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse2) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse2) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse5 (mod (+ .cse3 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (let ((.cse6 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse5)) 256))) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse6))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (not (<= (mod (+ .cse3 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (not (= .cse4 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse5 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse6) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0) (= (mod (+ (* .cse6 255) .cse4) 256) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse8 (mod .cse7 256))) (let ((.cse9 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse8) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (not (<= (mod (+ .cse7 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse8 |v_ULTIMATE.start_gcd_test_~a#1_20|) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse9) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse9) 256) 0) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse11 (mod (+ .cse10 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse11)))) (let ((.cse12 (mod .cse13 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (not (<= (mod (+ .cse10 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse11 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse12) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse12) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (= .cse13 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse16 (mod .cse14 256))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse16) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (not (<= (mod (+ .cse14 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse15) 0) (<= .cse16 |v_ULTIMATE.start_gcd_test_~a#1_20|) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse15) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse19 (mod (+ .cse18 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (let ((.cse20 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse19)) 256))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse20))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (not (= .cse17 0)) (<= (mod (+ .cse18 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse19 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse18 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse20) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0) (= (mod (+ (* .cse20 255) .cse17) 256) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse21 (mod .cse22 256))) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse21) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (not (= .cse21 0)) (<= (mod (+ .cse22 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse21 |v_ULTIMATE.start_gcd_test_~a#1_20|) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse23) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse23) 256) 0) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse24 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse25 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse24) 256) 0) (<= (mod (+ .cse25 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_20|) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (not (= .cse25 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse24) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse26 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))))) (let ((.cse27 (mod .cse28 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (not (<= (mod (+ .cse26 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse27) 256) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_20|) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse27) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (= .cse28 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse29 (mod .cse30 256))) (let ((.cse31 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse29) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (not (= .cse29 0)) (<= (mod (+ .cse30 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse31) 0) (<= .cse29 |v_ULTIMATE.start_gcd_test_~a#1_20|) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse31) (not (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse33 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse32 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (not (<= (mod (+ .cse32 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse33) 256) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_20|) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse33) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse35 (mod (+ .cse34 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse35)) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (not (<= (mod (+ .cse34 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse35 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse36) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse36) (<= |v_ULTIMATE.start_gcd_test_~b#1_16| |v_ULTIMATE.start_gcd_test_~a#1_19|) (not (< |v_ULTIMATE.start_gcd_test_~b#1_16| 0)))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127)) is different from false [2022-11-02 20:55:52,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 20:55:52,583 INFO L328 TraceCheckSpWp]: Computing backward predicates...