./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/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_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/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_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/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 2f8505e46ba1dfd9d1ec3a293aaba2f619b40b1a80d91e8d871194a57c70c939 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:12:16,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:12:16,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:12:16,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:12:16,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:12:16,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:12:16,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:12:16,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:12:16,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:12:16,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:12:16,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:12:16,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:12:16,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:12:16,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:12:16,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:12:16,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:12:16,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:12:16,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:12:16,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:12:16,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:12:16,291 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:12:16,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:12:16,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:12:16,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:12:16,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:12:16,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:12:16,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:12:16,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:12:16,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:12:16,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:12:16,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:12:16,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:12:16,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:12:16,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:12:16,315 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:12:16,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:12:16,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:12:16,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:12:16,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:12:16,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:12:16,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:12:16,319 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:12:16,359 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:12:16,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:12:16,359 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:12:16,360 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:12:16,387 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:12:16,388 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:12:16,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:12:16,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:12:16,389 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:12:16,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:12:16,391 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:12:16,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:12:16,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:12:16,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:12:16,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:12:16,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:12:16,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:12:16,392 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:12:16,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:12:16,393 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:12:16,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:12:16,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:12:16,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:12:16,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:12:16,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:12:16,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:12:16,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:12:16,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:12:16,397 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:12:16,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:12:16,398 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:12:16,398 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:12:16,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:12:16,399 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_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/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_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/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 -> 2f8505e46ba1dfd9d1ec3a293aaba2f619b40b1a80d91e8d871194a57c70c939 [2022-11-02 20:12:16,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:12:16,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:12:16,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:12:16,720 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:12:16,721 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:12:16,722 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/combinations/gcd_2+newton_2_1.i [2022-11-02 20:12:16,799 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/data/bd6174fc5/62e8e0cc080f4d1292e562ab807a2ad6/FLAG67326f4d6 [2022-11-02 20:12:17,215 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:12:17,215 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i [2022-11-02 20:12:17,222 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/data/bd6174fc5/62e8e0cc080f4d1292e562ab807a2ad6/FLAG67326f4d6 [2022-11-02 20:12:17,603 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/data/bd6174fc5/62e8e0cc080f4d1292e562ab807a2ad6 [2022-11-02 20:12:17,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:12:17,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:12:17,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:12:17,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:12:17,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:12:17,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:12:17" (1/1) ... [2022-11-02 20:12:17,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63a62bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:17, skipping insertion in model container [2022-11-02 20:12:17,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:12:17" (1/1) ... [2022-11-02 20:12:17,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:12:17,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:12:17,813 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_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i[1226,1239] [2022-11-02 20:12:17,835 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_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i[2841,2854] [2022-11-02 20:12:17,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:12:17,845 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:12:17,857 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_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i[1226,1239] [2022-11-02 20:12:17,868 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_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/sv-benchmarks/c/combinations/gcd_2+newton_2_1.i[2841,2854] [2022-11-02 20:12:17,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:12:17,884 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:12:17,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:17 WrapperNode [2022-11-02 20:12:17,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:12:17,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:12:17,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:12:17,886 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:12:17,893 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:12:17" (1/1) ... [2022-11-02 20:12:17,915 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:12:17" (1/1) ... [2022-11-02 20:12:17,954 INFO L138 Inliner]: procedures = 27, calls = 16, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 77 [2022-11-02 20:12:17,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:12:17,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:12:17,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:12:17,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:12:17,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:17" (1/1) ... [2022-11-02 20:12:17,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:17" (1/1) ... [2022-11-02 20:12:17,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:17" (1/1) ... [2022-11-02 20:12:17,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:17" (1/1) ... [2022-11-02 20:12:17,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:17" (1/1) ... [2022-11-02 20:12:17,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:17" (1/1) ... [2022-11-02 20:12:17,998 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:17" (1/1) ... [2022-11-02 20:12:18,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:17" (1/1) ... [2022-11-02 20:12:18,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:12:18,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:12:18,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:12:18,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:12:18,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:17" (1/1) ... [2022-11-02 20:12:18,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:12:18,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:12:18,045 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:12:18,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:12:18,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:12:18,088 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-02 20:12:18,088 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-02 20:12:18,088 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-02 20:12:18,088 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-02 20:12:18,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:12:18,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:12:18,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:12:18,154 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:12:18,156 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:12:18,348 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:12:18,357 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:12:18,357 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:12:18,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:12:18 BoogieIcfgContainer [2022-11-02 20:12:18,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:12:18,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:12:18,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:12:18,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:12:18,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:12:17" (1/3) ... [2022-11-02 20:12:18,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ba1a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:12:18, skipping insertion in model container [2022-11-02 20:12:18,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:17" (2/3) ... [2022-11-02 20:12:18,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ba1a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:12:18, skipping insertion in model container [2022-11-02 20:12:18,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:12:18" (3/3) ... [2022-11-02 20:12:18,396 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_1.i [2022-11-02 20:12:18,432 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:12:18,433 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:12:18,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:12:18,489 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;@6bc8b4b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:12:18,489 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 20:12:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:12:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:12:18,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:18,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:18,503 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:12:18,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:18,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-02 20:12:18,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:18,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719010822] [2022-11-02 20:12:18,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:18,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:18,908 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:12:18,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:18,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719010822] [2022-11-02 20:12:18,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719010822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:18,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:18,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:12:18,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649218516] [2022-11-02 20:12:18,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:18,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:12:18,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:18,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:12:18,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:12:18,961 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 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:12:19,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:19,079 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2022-11-02 20:12:19,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:12:19,082 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:12:19,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:19,093 INFO L225 Difference]: With dead ends: 90 [2022-11-02 20:12:19,094 INFO L226 Difference]: Without dead ends: 36 [2022-11-02 20:12:19,100 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:12:19,104 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 29 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 107 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:12:19,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 107 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:12:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-02 20:12:19,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-11-02 20:12:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:12:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-11-02 20:12:19,175 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2022-11-02 20:12:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:19,175 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-11-02 20:12:19,176 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:12:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-11-02 20:12:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:12:19,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:19,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:19,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:12:19,179 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:12:19,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:19,180 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-11-02 20:12:19,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:19,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097730924] [2022-11-02 20:12:19,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:19,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:19,328 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:12:19,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:19,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097730924] [2022-11-02 20:12:19,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097730924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:19,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:19,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:12:19,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71322407] [2022-11-02 20:12:19,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:19,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:12:19,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:19,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:12:19,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:12:19,340 INFO L87 Difference]: Start difference. First operand 29 states and 32 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:12:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:19,387 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-11-02 20:12:19,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:12:19,390 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:12:19,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:19,391 INFO L225 Difference]: With dead ends: 36 [2022-11-02 20:12:19,392 INFO L226 Difference]: Without dead ends: 30 [2022-11-02 20:12:19,393 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:12:19,395 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 82 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:12:19,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:12:19,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-02 20:12:19,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-02 20:12:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:12:19,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-02 20:12:19,406 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-11-02 20:12:19,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:19,407 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-02 20:12:19,407 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:12:19,407 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-02 20:12:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:12:19,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:19,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:19,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:12:19,409 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:12:19,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:19,410 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2022-11-02 20:12:19,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:19,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274303826] [2022-11-02 20:12:19,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:19,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:19,425 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:12:19,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [395572451] [2022-11-02 20:12:19,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:19,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:12:19,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:12:19,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:12:19,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:12:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:19,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:12:19,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:12:19,589 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:12:19,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:12:19,651 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:12:19,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:19,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274303826] [2022-11-02 20:12:19,652 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:12:19,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395572451] [2022-11-02 20:12:19,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395572451] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:12:19,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:12:19,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-11-02 20:12:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992471713] [2022-11-02 20:12:19,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:12:19,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:12:19,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:19,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:12:19,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:12:19,655 INFO L87 Difference]: Start difference. First operand 30 states and 33 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:12:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:19,740 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-11-02 20:12:19,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:12:19,741 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:12:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:19,742 INFO L225 Difference]: With dead ends: 37 [2022-11-02 20:12:19,742 INFO L226 Difference]: Without dead ends: 31 [2022-11-02 20:12:19,742 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:12:19,743 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 153 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.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:19,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 153 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:12:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-02 20:12:19,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-02 20:12:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:12:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-11-02 20:12:19,750 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2022-11-02 20:12:19,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:19,750 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-11-02 20:12:19,750 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:12:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-11-02 20:12:19,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:12:19,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:19,752 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:19,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:12:19,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:12:19,967 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:12:19,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:19,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1659957129, now seen corresponding path program 2 times [2022-11-02 20:12:19,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:19,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126863209] [2022-11-02 20:12:19,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:19,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:19,980 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:12:19,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [387176819] [2022-11-02 20:12:19,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:12:19,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:12:19,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:12:19,982 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:12:19,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:12:20,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:12:20,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:12:20,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-02 20:12:20,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:12:30,020 WARN L234 SmtUtils]: Spent 8.27s 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:12:40,894 WARN L234 SmtUtils]: Spent 8.39s 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:12:49,680 WARN L234 SmtUtils]: Spent 6.35s 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:13:00,955 WARN L234 SmtUtils]: Spent 6.47s 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:13:01,295 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:13:01,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:13:13,560 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:13:17,512 WARN L855 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse3 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse1 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (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 ((.cse0 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse2 (mod .cse0 256))) (or (not (<= (mod (+ .cse0 .cse1) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse2) 256) 0)) (< .cse2 .cse3) (not (<= (mod (+ .cse0 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (<= .cse2 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse5 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse4 (mod (+ .cse5 .cse1) 256))) (or (not (<= .cse4 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 (+ .cse5 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod .cse5 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse4) 256) 0)) (< .cse4 .cse3))))) (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 ((.cse7 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod (+ .cse7 .cse1) 256))) (or (not (<= .cse6 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse7 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse6) 256) 0)) (not (<= (mod .cse7 256) 127)) (< .cse6 .cse3))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse8 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod .cse8 256))) (or (not (<= (mod (+ .cse8 .cse1) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse9) 256) 0)) (< .cse9 .cse3) (not (<= .cse9 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse8 |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) (|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 .cse1) 256))) (or (not (<= .cse10 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 .cse11 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse10) 256) 0)) (< .cse10 .cse3) (<= (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod .cse13 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse12) 256) 0)) (< .cse12 .cse3) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (<= (mod (+ .cse13 .cse1) 256) 127) (not (<= .cse12 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse15 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod (+ .cse15 .cse1) 256))) (or (not (<= .cse14 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse14) 256) 0)) (not (<= (mod .cse15 256) 127)) (< .cse14 .cse3) (<= (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse15 0))))) (< |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) (|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 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse16) 256) 0)) (< .cse16 .cse3) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse17 .cse1) 256) 127) (not (<= .cse16 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) is different from true [2022-11-02 20:13:19,457 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:13:19,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:13:19,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126863209] [2022-11-02 20:13:19,458 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:13:19,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387176819] [2022-11-02 20:13:19,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387176819] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:13:19,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:13:19,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-11-02 20:13:19,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317021926] [2022-11-02 20:13:19,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:13:19,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 20:13:19,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:13:19,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 20:13:19,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=169, Unknown=6, NotChecked=54, Total=272 [2022-11-02 20:13:19,461 INFO L87 Difference]: Start difference. First operand 31 states and 34 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:13:23,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:13:23,610 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-11-02 20:13:23,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:13:23,611 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:13:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:13:23,612 INFO L225 Difference]: With dead ends: 38 [2022-11-02 20:13:23,612 INFO L226 Difference]: Without dead ends: 32 [2022-11-02 20:13:23,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 47.4s TimeCoverageRelationStatistics Valid=49, Invalid=193, Unknown=6, NotChecked=58, Total=306 [2022-11-02 20:13:23,613 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:13:23,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 291 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 79 Unchecked, 0.0s Time] [2022-11-02 20:13:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-02 20:13:23,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-02 20:13:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:13:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-02 20:13:23,621 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 13 [2022-11-02 20:13:23,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:13:23,621 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-02 20:13:23,621 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:13:23,622 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-02 20:13:23,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:13:23,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:13:23,623 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:13:23,665 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:13:23,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:13:23,824 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:13:23,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:13:23,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1682229690, now seen corresponding path program 3 times [2022-11-02 20:13:23,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:13:23,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948984948] [2022-11-02 20:13:23,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:13:23,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:13:23,831 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:13:23,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [184505982] [2022-11-02 20:13:23,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:13:23,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:13:23,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:13:23,833 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:13:23,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d9ab28a-6c90-47a2-80f4-a95d50c0364d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:13:23,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 20:13:23,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:13:23,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-02 20:13:23,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:13:52,014 WARN L234 SmtUtils]: Spent 16.98s 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:14:47,550 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse16 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (let ((.cse7 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse46 (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)))))) (.cse41 (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|))))) (.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 .cse16) (not (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))))) (.cse40 (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 ((.cse61 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse61 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (= (mod .cse60 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse61 |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 (= .cse61 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)) (= .cse60 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|) (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 ((.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 ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse5)))) (and (= (mod .cse2 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse3 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse3 0)) (= .cse2 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse4 (mod (+ .cse7 .cse6) 256))) (and (<= .cse4 127) (= .cse4 |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse5 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse6 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|))))) (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 ((.cse9 (mod .cse8 256))) (and (not (<= (mod (+ .cse8 |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| .cse9) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse10 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (<= .cse10 127) (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse10 |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 ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse11 (mod (+ .cse12 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse11)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse12 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse12 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse11 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= (mod .cse13 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse13 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 ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse14 (mod (+ .cse18 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse14)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse15 (mod (+ .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|)) 256))) (and (<= .cse14 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (<= .cse15 127)) (= .cse15 .cse16) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))) (= (mod .cse17 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse18 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse18 0)) (= .cse17 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 ((.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 (+ .cse20 |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| .cse19) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse21 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (<= .cse21 127) (<= .cse19 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse21 |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 ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse22 (mod (+ .cse23 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse22)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse23 |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 ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse24 (mod (+ .cse7 .cse25) 256))) (and (<= .cse22 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (<= .cse24 127)) (not (= .cse25 0)) (= .cse24 .cse16) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0))))) (not (= .cse23 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 ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse26 (mod .cse28 256))) (and (not (= .cse26 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse27 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (not (<= .cse27 127)) (<= .cse26 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= .cse27 .cse16)))) (<= (mod (+ .cse28 |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| .cse26) 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 ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse29 (mod .cse31 256))) (and (not (= .cse29 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|))) (and (<= .cse29 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod .cse30 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse30 0)))) (<= (mod (+ .cse31 |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| .cse29) 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 ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse33 (mod (+ .cse32 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (not (<= (mod (+ .cse32 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse33)) 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 ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse34 (mod (+ .cse7 .cse35) 256))) (and (<= .cse33 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (<= .cse34 127)) (not (= .cse35 0)) (= .cse34 .cse16) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 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 ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse38 (mod (+ .cse37 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse38)))) (and (= (mod .cse36 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse37 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse37 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse38 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= (mod .cse39 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse39 0)))) (= .cse36 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)))) (and .cse40 .cse41) (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 ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse43 (mod (+ .cse42 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (not (<= (mod (+ .cse42 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse43)) 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 ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse44 (mod (+ .cse7 .cse45) 256))) (and (<= .cse44 127) (= .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse43 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse45 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 .cse46 .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 ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse48 (mod (+ .cse47 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (not (<= (mod (+ .cse47 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse48)) 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 ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse48 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (= (mod .cse49 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse49 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 ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse51 (mod .cse50 256))) (and (not (<= (mod (+ .cse50 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (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|))) (and (<= .cse51 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod .cse52 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse52 0)))) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse51) 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 ((.cse54 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse53 (mod (+ .cse54 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse53)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse54 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse54 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse55 (mod (+ .cse7 .cse56) 256))) (and (<= .cse55 127) (= .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse53 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse56 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 .cse46 .cse41) (and .cse1 .cse41) (and .cse0 .cse40) (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 .cse16)))) (= |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:14:53,322 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse9 (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)))) (.cse15 (* |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)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (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)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse1) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= .cse1 |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)))) (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 ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse4 (mod (+ .cse3 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse4)))) (and (= (mod .cse2 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (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 (<= .cse4 (+ 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 (= .cse3 0)) (= .cse2 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 (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 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (not (<= (mod (+ .cse5 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse6)) 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 (<= .cse6 (+ 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 ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse7 (mod (+ .cse8 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse7)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse8 |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 (<= .cse7 (+ 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 (= .cse8 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 .cse9 (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_~a#1|) (<= (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|) (not (= .cse11 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)) (= .cse10 0)))))) (and .cse9 (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 ((.cse12 (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 (+ .cse12 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse12 (* 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 ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse13 (mod .cse14 256))) (and (not (= .cse13 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) (<= .cse13 |v_ULTIMATE.start_gcd_test_~a#1_20|))) (<= (mod (+ .cse14 |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| .cse13) 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 (<= |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 ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse17 (mod (+ .cse19 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse17)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse15 .cse16) 256) 0) (<= .cse17 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse16 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))) (= (mod .cse18 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse19 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse19 0)) (= .cse18 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 ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse21 (mod (+ .cse22 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse15 .cse20) 256) 0) (<= .cse21 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse20 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))) (not (<= (mod (+ .cse22 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse21)) 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 .cse9 (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 ((.cse23 (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 (+ .cse23 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse23 |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 (= .cse23 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 ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse25 (mod .cse24 256))) (and (not (<= (mod (+ .cse24 |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) (<= .cse25 |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| .cse25) 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 ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse26 (mod .cse27 256))) (and (not (= .cse26 0)) (<= (mod (+ .cse27 |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| .cse26) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= .cse26 |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 ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse29 (mod (+ .cse30 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse15 .cse28) 256) 0) (<= .cse29 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse28 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse29)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse30 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse30 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)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127)) is different from false [2022-11-02 20:14:58,659 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (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)))) (.cse9 (* 255 |c_ULTIMATE.start_gcd_test_#res#1|))) (or (and .cse0 (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 ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse2 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (= (mod .cse1 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (mod (+ .cse2 |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 (= .cse2 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 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 ((.cse4 (mod .cse3 256))) (and (not (<= (mod (+ .cse3 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse4) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= .cse4 |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 ((.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_#res#1|) (not (<= (mod (+ .cse6 |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 (<= .cse5 (+ 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 ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse7 (mod (+ .cse10 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse7)) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|))) (and (<= .cse7 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse8 0)) (= (mod (+ .cse9 .cse8) 256) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))) (<= (mod (+ .cse10 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse10 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 ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse11 (mod (+ .cse12 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse11)) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (mod (+ .cse12 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse12 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_#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)) (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 ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse14 (mod (+ .cse16 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse14)))) (and (= (mod .cse13 256) |c_ULTIMATE.start_gcd_test_#res#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_#res#1|))) (and (<= .cse14 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse15 0)) (= (mod (+ .cse9 .cse15) 256) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| 0)))) (<= (mod (+ .cse16 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse16 0)) (= .cse13 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)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse18 (mod .cse17 256))) (and (not (<= (mod (+ .cse17 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse18) 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 (<= .cse18 |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 ((.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) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= .cse19 |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 .cse0 (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 ((.cse21 (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 (+ .cse21 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (not (<= (mod (+ .cse21 |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)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_16| Int)) (and (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 ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse24 (mod (+ .cse23 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse24)))) (and (= (mod .cse22 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (mod (+ .cse23 |v_ULTIMATE.start_gcd_test_~b#1_16|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_18| 0) (not (= .cse23 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= .cse24 (+ 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))) (= .cse22 0)))))))) (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)))) (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 ((.cse25 (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 (+ .cse25 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (mod (+ .cse25 |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 (= .cse25 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))))) .cse0) (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 ((.cse26 (mod .cse27 256))) (and (not (= .cse26 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse26) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (mod (+ .cse27 |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 (<= .cse26 |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)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse28 (mod (+ .cse29 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) .cse28)) 256) |c_ULTIMATE.start_gcd_test_#res#1|) (not (<= (mod (+ .cse29 |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 (<= .cse28 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|)) (not (= .cse30 0)) (= (mod (+ .cse9 .cse30) 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)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127)) is different from false [2022-11-02 20:15:08,560 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (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)) (<= (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|)) (not (= .cse10 0)) (= (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 ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse26 (mod .cse27 256))) (let ((.cse28 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| .cse26) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (not (= .cse26 0)) (<= (mod (+ .cse27 |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| .cse28) 0) (<= .cse26 |v_ULTIMATE.start_gcd_test_~a#1_20|) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse28) (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 ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_16|))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| (+ (- 256) (mod (+ .cse30 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_16|)) 256))))) (let ((.cse29 (mod .cse31 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_16| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse29) 256) 0) (<= (mod (+ .cse30 |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 (= .cse30 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse29) (<= |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)) (= .cse31 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))))))))) is different from false [2022-11-02 20:15:20,462 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:15:20,462 INFO L328 TraceCheckSpWp]: Computing backward predicates...